Quantum attacks on PRFs based on public random permutations

DOI10.1007/978-3-031-22912-1_25zbMath1530.81055OpenAlexW4313347230MaRDI QIDQ6169488

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• A construction of a cipher from a single pseudorandom permutation.
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Grover meets Simon -- quantumly attacking the FX-construction
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• Attacks on beyond-birthday-bound MACs in the quantum setting
• Tight bounds for Simon's algorithm
• How to build pseudorandom functions from public random permutations
• Quantum attacks without superposition queries: the offline Simon's algorithm
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• The advantage of truncated permutations
• \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Generic Attacks for the Xor of k Random Permutations
• Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• On the Power of Quantum Computation
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Progress in Cryptology - INDOCRYPT 2004
• Quantum cryptanalysis of hash and claw-free functions
• Categorization of faulty nonce misuse resistant message authentication

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