Quantum attacks on PRFs based on public random permutations

DOI10.1007/978-3-031-22912-1_25MaRDI QIDQ6169488zbMATH OpenOpenAlexFDO

Authors Ting-Ting Guo, Peng Wang, Lei Hu, Dingfeng Ye

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22912-1_25

zbMATH Keywords

permutationquantum attackPRF

Mathematics Subject Classification ID

Cryptography (94A60) General theory for finite permutation groups (20B05) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)

Recommendations

• Quantum attacks against BBB secure PRFs or MACs built from public random permutations
• XOR of PRPs in a quantum world
• On quantum secure compressing pseudorandom functions
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• How to Construct Quantum Random Functions

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1302860 (Why is no real title available?)
• scientific article; zbMATH DE number 1303128 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• A construction of a cipher from a single pseudorandom permutation.
• Attacks on beyond-birthday-bound MACs in the quantum setting
• Breaking symmetric cryptosystems using quantum period finding
• Categorization of faulty nonce misuse resistant message authentication
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Generic attacks for the Xor of k random permutations
• Grover meets Simon -- quantumly attacking the FX-construction
• How to build pseudorandom functions from public random permutations
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• New hash functions and their use in authentication and set equality
• On fast and provably secure message authentication based on universal hashing
• On the Power of Quantum Computation
• Progress in Cryptology - INDOCRYPT 2004
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum cryptanalysis of hash and claw-free functions
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The advantage of truncated permutations
• Tight bounds for Simon's algorithm
• \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations

Cited in

(1)

• On quantum secure compressing pseudorandom functions

This page was built for publication: Quantum attacks on PRFs based on public random permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169488)