Quantum Algorithm to Construct Linear Approximation of an S-Box

  • Malviya* A
  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


Linear cryptanalysis, a Known-Plaintext Attack, for symmetric block cipher works by constructing linear approximations of the non-linear components of the cipher. The only component which introduces non-linearity in the symmetric block cipher is an S-box. Using classical computing algorithms, the best known solution to find a linear approximation of a non-linear function, in this case an S-box, requires queries to the S-box and time-complexity, where is the input size of the S-box and is the output size. In this paper, a quantum algorithm is presented which can produce best linear approximations of a non-linear S-box using only queries to S-box with time-complexity. The proposed algorithm shows a significant improvement over the classical algorithm. Correctness proof of the proposed quantum algorithm is presented along with an example.




Malviya*, A. K., & Tiwari, N. (2019). Quantum Algorithm to Construct Linear Approximation of an S-Box. International Journal of Recent Technology and Engineering (IJRTE), 8(4), 9096–9099. https://doi.org/10.35940/ijrte.d4608.118419

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free