Quantum Period Finding against Symmetric Primitives in Practice

We present the first complete descriptions of quantum circuits for the offline Simon’s algorithm, and estimate their cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight finalist AEAD scheme Elephant. These attacks require a reasonable amount of qubits, comparable to the...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Xavier Bonnetain, Samuel Jaques
Formato:	article
Lenguaje:	EN
Publicado:	Ruhr-Universität Bochum 2021
Materias:	Quantum cryptanalysis quantum circuits symmetric cryptography Simon’s algorithm Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64
Acceso en línea:	https://doaj.org/article/c1cdf884973249948a3a63168eab5021
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:c1cdf884973249948a3a63168eab5021
record_format	dspace
spelling	oai:doaj.org-article:c1cdf884973249948a3a63168eab50212021-11-19T14:36:15ZQuantum Period Finding against Symmetric Primitives in Practice10.46586/tches.v2022.i1.1-272569-2925https://doaj.org/article/c1cdf884973249948a3a63168eab50212021-11-01T00:00:00Zhttps://tches.iacr.org/index.php/TCHES/article/view/9288https://doaj.org/toc/2569-2925 We present the first complete descriptions of quantum circuits for the offline Simon’s algorithm, and estimate their cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight finalist AEAD scheme Elephant. These attacks require a reasonable amount of qubits, comparable to the number of qubits required to break RSA-2048. They are faster than other collision algorithms, and the attacks against PRINCE and Chaskey are the most efficient known to date. As Elephant has a key smaller than its state size, the algorithm is less efficient and its cost ends up very close to or above the cost of exhaustive search. We also propose an optimized quantum circuit for boolean linear algebra as well as complete reversible implementations of PRINCE, Chaskey, spongent and Keccak which are of independent interest for quantum cryptanalysis. We stress that our attacks could be applied in the future against today’s communications, and recommend caution when choosing symmetric constructions for cases where long-term security is expected. Xavier BonnetainSamuel JaquesRuhr-Universität BochumarticleQuantum cryptanalysisquantum circuitssymmetric cryptographySimon’s algorithmComputer engineering. Computer hardwareTK7885-7895Information technologyT58.5-58.64ENTransactions on Cryptographic Hardware and Embedded Systems, Vol 2022, Iss 1 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Quantum cryptanalysis quantum circuits symmetric cryptography Simon’s algorithm Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64
spellingShingle	Quantum cryptanalysis quantum circuits symmetric cryptography Simon’s algorithm Computer engineering. Computer hardware TK7885-7895 Information technology T58.5-58.64 Xavier Bonnetain Samuel Jaques Quantum Period Finding against Symmetric Primitives in Practice
description	We present the first complete descriptions of quantum circuits for the offline Simon’s algorithm, and estimate their cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight finalist AEAD scheme Elephant. These attacks require a reasonable amount of qubits, comparable to the number of qubits required to break RSA-2048. They are faster than other collision algorithms, and the attacks against PRINCE and Chaskey are the most efficient known to date. As Elephant has a key smaller than its state size, the algorithm is less efficient and its cost ends up very close to or above the cost of exhaustive search. We also propose an optimized quantum circuit for boolean linear algebra as well as complete reversible implementations of PRINCE, Chaskey, spongent and Keccak which are of independent interest for quantum cryptanalysis. We stress that our attacks could be applied in the future against today’s communications, and recommend caution when choosing symmetric constructions for cases where long-term security is expected.
format	article
author	Xavier Bonnetain Samuel Jaques
author_facet	Xavier Bonnetain Samuel Jaques
author_sort	Xavier Bonnetain
title	Quantum Period Finding against Symmetric Primitives in Practice
title_short	Quantum Period Finding against Symmetric Primitives in Practice
title_full	Quantum Period Finding against Symmetric Primitives in Practice
title_fullStr	Quantum Period Finding against Symmetric Primitives in Practice
title_full_unstemmed	Quantum Period Finding against Symmetric Primitives in Practice
title_sort	quantum period finding against symmetric primitives in practice
publisher	Ruhr-Universität Bochum
publishDate	2021
url	https://doaj.org/article/c1cdf884973249948a3a63168eab5021
work_keys_str_mv	AT xavierbonnetain quantumperiodfindingagainstsymmetricprimitivesinpractice AT samueljaques quantumperiodfindingagainstsymmetricprimitivesinpractice
_version_	1718420037976457216

Quantum Period Finding against Symmetric Primitives in Practice

Ejemplares similares