An Extended Analysis of the Correlation Extraction Algorithm in the Context of Linear Cryptanalysis
Guardado en:
| Publicado en: | Quantum Reports vol. 6, no. 4 (2024), p. 714 |
|---|---|
| Autor principal: | |
| Otros Autores: | , , , , |
| Publicado: |
MDPI AG
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3149722940 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2624-960X | ||
| 024 | 7 | |a 10.3390/quantum6040043 |2 doi | |
| 035 | |a 3149722940 | ||
| 045 | 2 | |b d20240101 |b d20241231 | |
| 100 | 1 | |a Graebnitz, Christoph |u Secure Systems Engineering, Fraunhofer AISEC, Lichtenbergstraße 11, 85748 Garching, Germany; <email>valentin.pickel@aisec.fraunhofer.de</email> (V.P.); <email>hanneshattenbach.dev@gmail.com</email> (H.H.); <email>marian.margraf@aisec.fraunhofer.de</email> (M.M.) | |
| 245 | 1 | |a An Extended Analysis of the Correlation Extraction Algorithm in the Context of Linear Cryptanalysis | |
| 260 | |b MDPI AG |c 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a In cryptography, techniques and tools developed in the subfield of linear cryptanalysis have previously successfully been used to allow attackers to break many sophisticated cryptographic ciphers. Since these linear cryptanalytic techniques require exploitable linear approximations to relate the input and output of vectorial Boolean functions, e.g., the plaintext, ciphertext, and key of the cryptographic function, finding these approximations is essential. For this purpose, the Correlation Extraction Algorithm (CEA), which leverages the emerging field of quantum computing, appears promising. However, there has been no comprehensive analysis of the CEA regarding finding an exploitable linear approximation for linear cryptanalysis. In this paper, we conduct a thorough theoretical analysis of the CEA. We aim to investigate its potential in finding a linear approximation with prescribed statistical characteristics. To support our theoretical work, we also present the results of a small empirical study based on a computer simulation. The analysis in this paper shows that an approach that uses the CEA to find exploitable linear approximations has an asymptotic advantage, reducing a linear factor to a logarithmic one in terms of time complexity, and an exponential advantage in terms of space complexity compared to a classical approach that uses the fast Walsh transform. Furthermore, we show that in specific scenarios, CEA can exponentially reduce the search space for exploitable linear approximations in terms of the number of input bits of the cipher. Neglecting the unresolved issue of efficiently checking the property of linear approximations measured by the CEA, our results indicate that the CEA can support the linear cryptanalysis of vectorial Boolean functions with relatively few (e.g., <inline-formula>n≤32</inline-formula>) output bits. | |
| 653 | |a Cryptography | ||
| 653 | |a Quantum computing | ||
| 653 | |a Boolean functions | ||
| 653 | |a Asymptotic methods | ||
| 653 | |a Random variables | ||
| 653 | |a Success | ||
| 653 | |a Boolean | ||
| 653 | |a Walsh transforms | ||
| 653 | |a Algorithms | ||
| 653 | |a Data encryption | ||
| 653 | |a Codes | ||
| 653 | |a Complexity | ||
| 653 | |a Bias | ||
| 653 | |a Approximation | ||
| 700 | 1 | |a Pickel, Valentin |u Secure Systems Engineering, Fraunhofer AISEC, Lichtenbergstraße 11, 85748 Garching, Germany; <email>valentin.pickel@aisec.fraunhofer.de</email> (V.P.); <email>hanneshattenbach.dev@gmail.com</email> (H.H.); <email>marian.margraf@aisec.fraunhofer.de</email> (M.M.) | |
| 700 | 1 | |a Eble, Holger |u Bundesdruckerei GmbH, Kommandantenstraße 18, 10969 Berlin, Germany; <email>holger.eble@bdr.de</email> (H.E.); <email>frank.morgner@bdr.de</email> (F.M.) | |
| 700 | 1 | |a Morgner, Frank |u Bundesdruckerei GmbH, Kommandantenstraße 18, 10969 Berlin, Germany; <email>holger.eble@bdr.de</email> (H.E.); <email>frank.morgner@bdr.de</email> (F.M.) | |
| 700 | 1 | |a Hattenbach, Hannes |u Secure Systems Engineering, Fraunhofer AISEC, Lichtenbergstraße 11, 85748 Garching, Germany; <email>valentin.pickel@aisec.fraunhofer.de</email> (V.P.); <email>hanneshattenbach.dev@gmail.com</email> (H.H.); <email>marian.margraf@aisec.fraunhofer.de</email> (M.M.) | |
| 700 | 1 | |a Margraf, Marian |u Secure Systems Engineering, Fraunhofer AISEC, Lichtenbergstraße 11, 85748 Garching, Germany; <email>valentin.pickel@aisec.fraunhofer.de</email> (V.P.); <email>hanneshattenbach.dev@gmail.com</email> (H.H.); <email>marian.margraf@aisec.fraunhofer.de</email> (M.M.) | |
| 773 | 0 | |t Quantum Reports |g vol. 6, no. 4 (2024), p. 714 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3149722940/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3149722940/fulltextwithgraphics/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3149722940/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |