Optimized reversible quantum circuits for F_(2^8) multiplication
Quantum computers represent a serious threat to the safety of modern encryption standards. Within symmetric cryptography, Advanced Encryption Standard (AES) is believed to be quantum resistant if the key sizes are large enough. Arithmetic operations in AES are performed over the binary field F_(2^m)...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/7819 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/7819 |
| Access Level: | acceso abierto |
| Palabra clave: | 004.8 Quantum computing Reversible circuit Optimization Finite field arithmetic Multiplier Cryptography Inteligencia artificial (Informática) 1203.04 Inteligencia Artificial |
| Sumario: | Quantum computers represent a serious threat to the safety of modern encryption standards. Within symmetric cryptography, Advanced Encryption Standard (AES) is believed to be quantum resistant if the key sizes are large enough. Arithmetic operations in AES are performed over the binary field F_(2^m) generated by an irreducible pentanomial of degree m=8 using polynomial basis (PB) representation. Multiplication over F_(2^m) is the most complex and important arithmetic operation, so efficient implementations are highly desired. A number of quantum circuits realizing F_(2^m) multiplication have been proposed, where the number of qubits, the number of quantum gates and the depth of the circuit are mainly considered as optimization objectives. In this work, optimized reversible quantum circuits for F_(2^8) multiplication using PB generated by two irreducible pentanomials are presented. The proposed reversible multipliers require the minimum number of qubits and CNOT gates, and the minimum depth among similar F_(2^8) multipliers found in the literature. |
|---|