Quantum Algorithm to Construct Linear Approximation
Ashwini Kumar Malviya1, Namita Tiwari2
1Ashwini Kumar Malviya, Department of Computer Science and Engineering, Maulana Azad National Institute of Technology, Bhopal, India.
2Namita Tiwari, Department of Computer Science and Engineering, Maulana Azad National Institute of Technology, Bhopal, India.
Manuscript received on November 19, 2019. | Revised Manuscript received on November 29 2019. | Manuscript published on 30 November, 2019. | PP: 9096-9099 | Volume-8 Issue-4, November 2019. | Retrieval Number: D4608118419/2019©BEIESP | DOI: 10.35940/ijrte.D4608.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Linear Cryptanalysis, Linear Approximation.
Scope of the Article: Pervasive Computing.