Results 11 to 20 of about 5,946 (156)
Quantum Differential and Linear Cryptanalysis
Quantum computers, that may become available one day, would impact many scientific fields, most notably cryptography since many asymmetric primitives are insecure against an adversary with quantum capabilities.
Marc Kaplan +3 more
doaj +1 more source
The complexity of MinRank [PDF]
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case.
Caminata, Alessio, Gorla, Elisa
core +2 more sources
Concrete quantum cryptanalysis of binary elliptic curves
This paper analyzes and optimizes quantum circuits for computing discrete logarithms on binary elliptic curves, including reversible circuits for fixed-base-point scalar multiplication and the full stack of relevant subroutines.
Gustavo Banegas +3 more
doaj +3 more sources
A new quantum cryptanalysis method on block cipher Camellia
Symmetric cryptography is expected to be quantum safe when long‐term security is needed. Kuwakado and Morii gave a 3‐round quantum distinguisher of the Feistel cipher based on Simon's algorithm.
Yanjun Li, Hao Lin, Meng Liang, Ying Sun
doaj +1 more source
Quantum Security Analysis of AES
In this paper we analyze for the first time the post-quantum security of AES. AES is the most popular and widely used block cipher, established as the encryption standard by the NIST in 2001. We consider the secret key setting and, in particular, AES-256,
Xavier Bonnetain +2 more
doaj +1 more source
Dense-Coding Attack on Three-Party Quantum Key Distribution Protocols [PDF]
Cryptanalysis is an important branch in the study of cryptography, including both the classical cryptography and the quantum one. In this paper we analyze the security of two three-party quantum key distribution protocols (QKDPs) proposed recently, and ...
Gao, Fei +3 more
core +1 more source
Provably Quantum-Secure Tweakable Block Ciphers
Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting.
Akinori Hosoyamada, Tetsu Iwata
doaj +1 more source
Solving systems of Boolean multivariate equations with quantum annealing
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based postquantum cryptography, coding theory, and computer algebra.
Sergi Ramos-Calderer +6 more
doaj +1 more source
Lattice-Based Cryptography in the Quantum Era: A Survey
The advent of quantum computing reveals current classical cryptography’s incapacity to withstand attacks within the new paradigm. Quantum algorithms break such encryption with impressive ease, with Shor and Grover algorithms being the main perpetrators ...
Mauricio Cisneros, Javier Olazabal
doaj +1 more source
Grover on KATAN: Quantum Resource Estimation
This article presents the cost analysis of mounting Grover’s key search attack on the family of KATAN block cipher. Several designs of the reversible quantum circuit of KATAN are proposed. Owing to the National Insitute of Standards and Technology&
Mostafizar Rahman, Goutam Paul
doaj +1 more source

