Filters








82 Hits in 4.7 sec

Post-Quantum Security of the Even-Mansour Cipher [article]

Gorjan Alagic and Chen Bai and Jonathan Katz and Christian Majenz
2021 arXiv   pre-print
still be proven secure in this natural, "post-quantum" setting.  ...  Our results apply to both the two-key and single-key variants of Even-Mansour.  ...  Acknowledgments The authors thank Andrew Childs and Bibhusa Rawal for useful discussions.  ... 
arXiv:2112.07530v1 fatcat:fci365m5wbed7psmqss7l752eq

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

Xavier Bonnetain, André Schrottenloher, Ferdinand Sibleyras
2021 arXiv   pre-print
Regarding post-quantum security of symmetric ciphers, it is commonly assumed that doubling the key sizes is a sufficient precaution.  ...  It is a key length extension technique which provides an n-bit block cipher with 5n/2 bits of security out of an n-bit block cipher with 2n bits of key, with a security proof in the ideal model.  ...  Even-Mansour Cipher The Even-Mansour cipher [25] is a minimalistic construction which is ubiquitous in idealized designs.  ... 
arXiv:2110.02836v1 fatcat:r5m6f4bqu5hjhdcaliuh3nat2y

Breaking Symmetric Cryptosystems Using Quantum Period Finding [chapter]

Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia
2016 Lecture Notes in Computer Science  
On the other hand, the impact of quantum computing on secret key cryptography is much less understood.  ...  This is quite surprising compared to the situation with encryption modes: Anand et al. show that standard modes are secure with a quantum-secure PRF.  ...  This work was supported by the Commission of the European Communities through the Horizon 2020 program under project number 645622 PQCRYPTO.  ... 
doi:10.1007/978-3-662-53008-5_8 fatcat:zmmqzo3tn5ggdnuo7axmpc4n2a

Breaking Symmetric Cryptosystems using Quantum Period Finding [article]

Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia
2016 arXiv   pre-print
On the other hand, the impact of quantum computing on secret key cryptography is much less understood.  ...  This is quite surprising compared to the situation with encryption modes: Anand et al. show that standard modes are secure with a quantum-secure PRF.  ...  This work was supported by the Commission of the European Communities through the Horizon 2020 program under project number 645622 PQCRYPTO.  ... 
arXiv:1602.05973v3 fatcat:qmlnmfubvvhhzmsxmsku2qnjke

Quantum Period Finding against Symmetric Primitives in Practice [article]

Xavier Bonnetain, Samuel Jaques
2020 arXiv   pre-print
We present the first complete implementation of the offline Simon's algorithm, and estimate its cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight candidate AEAD scheme Elephant  ...  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  ...  The authors would like to thank Léo Perrin for fruitful discussions about S-boxes. Samuel Jaques was supported by the University of Oxford Clarendon fund.  ... 
arXiv:2011.07022v1 fatcat:vqdrmksia5fqhjgtwh3muy2uje

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 provide a list of cryptographic applications, including the Even-Mansour construction, the FX construction, some Sponge authenticated modes of encryption, and many more.  ...  In particular, we are able to break the Even-Mansour construction in quantum time Õ(2^n/3), with O(2^n/3) classical queries and O(n^2) qubits only.  ...  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).  ... 
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  
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).  ...  The authors thank Léo Perrin for proofreading this article and Elena Kirshanova for helpful remarks.  ...  This has led to the common saying that "doubling the key sizes" should ensure a similar level of post-quantum security.  ... 
dblp:journals/iacr/BonnetainHNSS19 fatcat:ect45gqmujcb5ez25pymrixrlm

Quantum Period Finding against Symmetric Primitives in Practice

Xavier Bonnetain, Samuel Jaques
2021 Transactions on Cryptographic Hardware and Embedded Systems  
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  ...  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  ...  The authors would like to thank Léo Perrin for fruitful discussions about S-boxes. Samuel Jaques was supported by the University of Oxford Clarendon fund.  ... 
doi:10.46586/tches.v2022.i1.1-27 fatcat:yvkivcg2ubccppx4yvwmff3eke

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

Akinori Hosoyamada, Yu Sasaki
2018 Lecture Notes in Computer Science  
Our attacks convert a type of classical meet-inthe-middle attacks into quantum ones. The attack cost depends on the number of available qubits and the way to realize the quantum hardware.  ...  The idea is then applied to the FX-construction to discover new tradeoffs in the classical query model. keywords: post-quantum cryptography, classical query model, meet-inthe-middle, tradeoff, Chaskey,  ...  Security of Chaskey is the same level as the Even-Mansour construction.  ... 
doi:10.1007/978-3-319-76953-0_11 fatcat:5zpkumcntzdkxnnbep6in5sr6m

Quantum key-recovery attack on Feistel structures

Xiaoyang Dong, Xiaoyun Wang
2018 Science China Information Sciences  
The time complexity of our attacks is less than that observed for quantum brute-force search by a factor of 2 0.75n . When compared with the best classical attacks, i.e., Dinur et al.'  ...  Post-quantum cryptography has drawn considerable attention from cryptologists on a global scale.  ...  They exhibited that the Even-Mansour ciphers could be broken in polynomial time using Simon's algorithm [9] , which could estimate the period of a periodic function in polynomial time in case of a quantum  ... 
doi:10.1007/s11432-017-9468-y fatcat:wgy64wwntbemfoiutrsj5yvcbm

Superposition Attacks on Pseudorandom Schemes based on Two or Less Permutations [article]

Shaoxuan Zhang, Chun Guo, Qingju Wang
2022 IACR Cryptology ePrint Archive  
We first extend Kuwakado and Morii's attack against the Even-Mansour cipher (ISITA 2012), and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n-bit  ...  (ASIACRYPT 2019), we show that the keys of a wide class of TPPR schemes can be recovered with O(n) superposition queries and O(n2 n/2 ) quantum steps.  ...  Other Related Work Quantum Q1 security has been proved for the FX construction and the (1round) Even-Mansour cipher [42, 1] . This line on Q1 security is largely orthogonal to our work.  ... 
dblp:journals/iacr/ZhangGW22 fatcat:t7humw7ybbhnjmkggav32uc3zy

Grover Meets Simon – Quantumly Attacking the FX-construction [chapter]

Gregor Leander, Alexander May
2017 Lecture Notes in Computer Science  
way of extending the key-length of a given cipher to increase the resistance against quantum adversaries.  ...  However, as we show in this work, using whitening keys does not increase the security in the quantum-CPA setting significantly.  ...  The natural question that arises from the attacks on a generic cipher using Grover's algorithm and the attack on the Even-Mansour scheme using Simon's algorithm is the following: How secure is the FX construction  ... 
doi:10.1007/978-3-319-70697-9_6 fatcat:f33k3qutc5boraw4oetjv7imuq

Quantum Attacks on Some Feistel Block Ciphers [article]

Xiaoyang Dong, Bingyou Dong, Xiaoyun Wang
2018 IACR Cryptology ePrint Archive  
Post-quantum cryptography has attracted much attention from worldwide cryptologists. However, most research works are related to public-key cryptosystem due to Shor's attack on RSA and ECC ciphers.  ...  Second, we give a new quantum key-recovery attack on full-round GOST, which is a Russian standard, with 2 114.8 quantum queries of the encryption process, faster than a quantum brute-force search attack  ...  Acknowledgements We would like to thank the anonymous reviewers for their important comments on this paper.  ... 
dblp:journals/iacr/DongDW18 fatcat:f4yc2yq3nfeopjlzvdlblo6kdu

A new quantum cryptanalysis method on block cipher Camellia

Yanjun Li, Hao Lin, Meng Liang, Ying Sun
2021 IET Information Security  
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.  ...  It is the very first time that the specific structure of the round function is used to improve quantum attack on Camellia.  ...  ACKNOWLEDGEMENTS This work is supported by the Fundamental Research Funds for the Central Universities of China (No.328201901), and the Open Project of Guangxi Key Laboratory of Cryptography and Information  ... 
doi:10.1049/ise2.12037 fatcat:efs3i3lwq5hnlapvrbaxcdyu2e

On Quantum Slide Attacks [article]

Xavier Bonnetain, María Naya-Plasencia, André Schrottenloher
2018 IACR Cryptology ePrint Archive  
could be applied to accelerate the slide attack on the alternate-key cipher.  ...  Furthermore, we show that some quantum slide attacks can be composed with other quantum attacks to perform efficient key-recoveries even when the round founction is a strong function classically.  ...  The slidex attack was introduced in [DKS15] and applied to variants of Even-Mansour, DES, XDES. It allows to meet the bound on time for the security of Even-Mansour.  ... 
dblp:journals/iacr/BonnetainNS18 fatcat:i6s6b5fezbgrvetfjaixsoo57a
« Previous Showing results 1 — 15 out of 82 results