Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations

DOI10.1007/S11128-022-03799-WOpenAlexW4317213585MaRDI QIDQ2686210

Yanyan Li

Publication date: 24 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-022-03799-w

zbMATH Keywords

multiplicationquantum circuitcomposite fieldbasis conversion

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Quantum gates (81P65)

Uses Software

• Camellia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Quantum reversible circuit of AES-128
• Grover meets Simon -- quantumly attacking the FX-construction
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication
• Quantum circuit implementations of AES with fewer qubits
• Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
• Applying Grover’s Algorithm to AES: Quantum Resource Estimates
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography

This page was built for publication: Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations