Filters








56 Hits in 7.3 sec

Cryptanalysis Against Symmetric-Key Schemes with Online Classical Queries and Offline Quantum Computations [chapter]

Akinori Hosoyamada, Yu Sasaki
2018 Lecture Notes in Computer Science  
In this paper, quantum attacks against symmetric-key schemes are presented in which adversaries only make classical queries but use quantum computers for offline computations.  ...  Those schemes are broken when quantum computations are available to the adversaries.  ...  We present quantum attacks against symmetric-key schemes in which adversaries make queries only in the classical manner but use quantum computers for offline computations.  ... 
doi:10.1007/978-3-319-76953-0_11 fatcat:5zpkumcntzdkxnnbep6in5sr6m

Breaking the quadratic barrier: Quantum cryptanalysis of Milenage, telecommunications' cryptographic backbone [article]

Vincent Ulitzsch, Jean-Pierre Seifert
2022 IACR Cryptology ePrint Archive  
Still, these secret key algorithms have not yet been subject to quantum cryptanalysis.  ...  Instead, many quantum security considerations for telecommunication networks argue that the threat posed by quantum computers is restricted to public-key cryptography.  ...  ACKNOWLEDGMENT The work described in this paper has been supported by the Einstein Research Unit "Perspectives of a quantum digital transformation: Near-term quantum computational devices and quantum processors  ... 
dblp:journals/iacr/UlitzschS22 fatcat:4umgxxfqsvdtjagq7wfy2uq3ne

Beyond quadratic speedups in quantum attacks on symmetric schemes [article]

Xavier Bonnetain, André Schrottenloher, Ferdinand Sibleyras
2021 arXiv   pre-print
In this paper, we report the first quantum key-recovery attack on a symmetric block cipher design, using classical queries only, with a more than quadratic time speedup compared to the best classical attack  ...  Regarding post-quantum security of symmetric ciphers, it is commonly assumed that doubling the key sizes is a sufficient precaution.  ...  All exponential speedups in quantum cryptanalysis that we know to date, including Q2 attacks on symmetric primitives, and attacks on asymmetric schemes, are based on variants of Simon's and Shor's algorithms  ... 
arXiv:2110.02836v1 fatcat:r5m6f4bqu5hjhdcaliuh3nat2y

XOR of PRPs in a Quantum World [chapter]

Bart Mennink, Alan Szepieniec
2017 Lecture Notes in Computer Science  
We investigate security of this construction against adversaries who have access to quantum computers. We first present a key recovery attack in |K| r/(r+1) complexity.  ...  min{|K|, |X|} queries, where K and X are the key and state space of the block cipher E.  ...  Therefore, the distinguisher is given unlimited computational power, and security is solely measured by the number of queries to the online oracle: the scheme is evaluated against a distinguisher with  ... 
doi:10.1007/978-3-319-59879-6_21 fatcat:7cae3w7j3reefes4sfmv2i3ewy

Quantum Attacks Without Superposition Queries: The Offline Simon's Algorithm [chapter]

Xavier Bonnetain, Akinori Hosoyamada, María Naya-Plasencia, Yu Sasaki, André Schrottenloher
2019 Lecture Notes in Computer Science  
We manage to leverage the algebraic structure of cryptosystems in the context of a quantum attacker limited to classical queries and offline quantum computations.  ...  In symmetric cryptanalysis, the model of superposition queries has led to surprising results, with many constructions being broken in polynomial time thanks to Simon's period-finding algorithm.  ...  The authors thank Léo Perrin for proofreading this article and Elena Kirshanova for helpful remarks.  ... 
doi:10.1007/978-3-030-34578-5_20 fatcat:lznl6couvve7voow33fc3freo4

Quantum Attacks without Superposition Queries: the Offline Simon Algorithm [article]

Xavier Bonnetain, Akinori Hosoyamada, María Naya-Plasencia, Yu Sasaki, André Schrottenloher
2019 IACR Cryptology ePrint Archive  
The authors thank Léo Perrin for proofreading this article and Elena Kirshanova for helpful remarks.  ...  This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement n o 714294acronym QUASYModo).  ...  Q1 Attacks on Symmetric Schemes This section shows that our new algorithm Alg-ExpQ1 can be used to construct Q1 attacks on various symmetric schemes, with a tradeoff between online classical queries, denoted  ... 
dblp:journals/iacr/BonnetainHNSS19 fatcat:ect45gqmujcb5ez25pymrixrlm

Quantum Attacks on HCTR and Its Variants

Mostafizar Rahman, Goutam Paul
2020 IEEE Transactions on Quantum Engineering  
Recently, in Asiacrypt 2019, Bonnetain et al. have shown attacks by quantum adversaries on FX construction and Even-Mansour Cipher without using superposition queries to the encryption oracle.  ...  INDEX TERMS Grover's search algorithm, Hash-Counter-Hash (HCH), Hash-Counter (HCTR), Simon's algorithm, symmetric key cryptography, tweakable-HCTR.  ...  for cryptanalysis of symmetric key schemes in the quantum setting.  ... 
doi:10.1109/tqe.2020.3041426 fatcat:3cqz4azmsbefjdtvlqd5wkejsq

Quantum Attacks on HCTR and its Variants [article]

Mostafizar Rahman, Goutam Paul
2020 IACR Cryptology ePrint Archive  
Recently, in Asiacrypt 2019, Bonnetain et al. have shown attacks by quantum adversaries on FX construction and Even-Mansour Cipher without using superposition queries to the encryption oracle.  ...  In addition, we mount attacks on HCTR, Tweakable-HCTR and HCH using the superposition queries to the encryption oracle using strategies proposed by Leander and May in Asiacrypt 2017 and Kaplan et al. in  ...  for cryptanalysis of symmetric key schemes in the quantum setting.  ... 
dblp:journals/iacr/RahmanP20 fatcat:u5u5gwyzcvanvno4l5vxhd4xzm

Quantum Demiric-Selçuk Meet-in-the-Middle Attacks: Applications to 6-Round Generic Feistel Constructions [chapter]

Akinori Hosoyamada, Yu Sasaki
2018 Lecture Notes in Computer Science  
approaches in the classical setting against symmetric-key schemes.  ...  When the adversary has an access to quantum computers for offline computations but online queries are made in a classical manner (so called Q1 model), the attack complexities are O(2 n/2 ) classical queries  ...  We do not consider parallelization here, since it seems unreasonable to assume that there exist many copies of the online quantum oracle and adversaries can parallelly access to them.  ... 
doi:10.1007/978-3-319-98113-0_21 fatcat:56pc6x3gungvtjhukta4o43xlm

Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256

Amit Kumar Chauhan, Abhishek Kumar, Somitra Kumar Sanadhya
2021 IACR Transactions on Symmetric Cryptology  
Our attack succeeds with a time complexity of 285.11 and requires 216 qRAM in the quantum-attack setting, where an attacker can make only classical queries to the oracle and perform offline computations  ...  Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP.  ...  Kai-Min Chung for initial discussions on quantum computing which led to the initiation of this work.  ... 
doi:10.46586/tosc.v2021.i1.316-336 fatcat:noxbr4ogc5bqvdbplkc2e2kwby

Security Protocols in a Nutshell [article]

Mohsen Toorani
2016 arXiv   pre-print
Furthermore, a survey on computational security models for authenticated key exchange (AKE) and password-authenticated key exchange (PAKE) protocols, as the most important and well-studied type of security  ...  Specifically, it clarifies differences between information-theoretic and computational security, and computational and symbolic models.  ...  Acknowledgment The author would like to thank Øyvind Ytrehus for helpful comments and discussions.  ... 
arXiv:1605.09771v2 fatcat:mkbc3in6tvdo7madnvqaxogbfq

Quantum key recovery attack on SIMON32/64

Hui Liu, Li Yang
2021 Cybersecurity  
However, the existing quantum attacks on lightweight block ciphers only focused on the quantum exhaustive search, while the quantum attacks combined with classical cryptanalysis methods haven't been well  ...  We treat the two phases of key recovery attack as two QAA instances separately, and the first QAA instance consists of four sub-QAA instances.  ...  The initial idea of measuring quantum attack complexity from quantum resources cost was proposed Yang. Liu developed the original idea and implemented an attack in this paper.  ... 
doi:10.1186/s42400-021-00089-3 fatcat:xxv5m5mgcvebjkowgkri7jryze

Impossible Differential Cryptanalysis on Deoxys-BC-256

Farokhlagha Moazami, Alireza Mehrdad, Hadi Soleimany
2018 Isecure  
We then present several cryptanalysis based upon the 4.5 rounds distinguisher against round-reduced Deoxys-BC-256 in both single-key and related-key settings.  ...  at FSE 2018, but requires a lower memory complexity with an equal time complexity.  ...  We then present several cryptanalysis based upon the 4.5 rounds distinguisher against round-reduced Deoxys-BC-256 in both single-key and related-key settings.  ... 
doi:10.22042/isecure.2018.114245.405 dblp:journals/isecure/MoazamiMS18 fatcat:etf4af7p4ra3rg3omuqin2m3du

Group Key Establishment in a Quantum-Future Scenario

María Isabel González Vasco, Ángel L. Pérez del Pozo, Rainer Steinwandt
2020 Informatica  
Our proposal uses password authentication and builds upon efficient and reasonably well understood primitives: a message authentication code and a post-quantum key encapsulation mechanism.  ...  In this paper, we put forward a security model for group key establishment (GAKE) with an adversary that may execute efficient quantum algorithms, yet only once the execution of the protocol has concluded  ...  transitioning from classical to quantum resistant schemes.  ... 
doi:10.15388/20-infor427 fatcat:rnohrzkxtfcljblfmdohkuqxim

The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications [article]

István András Seres, Máté Horváth, Péter Burcsi
2021 IACR Cryptology ePrint Archive  
This new perspective sheds some light on the complexity of key-recovery attacks against the Legendre PRF. We conduct algebraic cryptanalysis on the resulting MQ instance.  ...  In this work, we show that key-recovery attacks against the Legendre PRF are equivalent to solving a specific family of multivariate quadratic (MQ) equation system over a finite prime field.  ...  The protocol can be divided into online and offline parts.  ... 
dblp:journals/iacr/SeresHB21 fatcat:cz2shencbbb3hit7u3lwjwg3v4
« Previous Showing results 1 — 15 out of 56 results