Provably secure reflection ciphers

DOI10.1007/978-3-031-15985-5_9MaRDI QIDQ6166950zbMATH OpenOpenAlexFDO

Authors Tim Beyne, Yu Long Chen

Publication date 7 July 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15985-5_9

zbMATH Keywords

ideal cipher modelreflection ciphers\textsc{Prince}public random permutationssum capture theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Reflection ciphers
• Reflection cryptanalysis of PRINCE-like ciphers
• Reflection Cryptanalysis of PRINCE-Like Ciphers
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• Tight security bounds for key-alternating ciphers

Cites work

• scientific article; zbMATH DE number 697813 (Why is no real title available?)
• An asymptotically tight security analysis of the iterated Even-Mansour cipher
• Analysis of the single-permutation encrypted Davies-Meyer construction
• Block cipher invariants as eigenvectors of correlation matrices
• Cryptanalytic time-memory-data tradeoffs for FX-constructions with applications to PRINCE and PRIDE
• Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
• How to Protect DES Against Exhaustive Key Search
• How to build pseudorandom functions from public random permutations
• How to protect DES against exhaustive key search (an analysis of DESX).
• Key alternating ciphers based on involutions
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
• Minimalism in cryptography: the Even-Mansour scheme revisited
• Minimizing the two-round Even-Mansour cipher
• Mirror theory and cryptography
• PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
• PRINCEv2. More security for (almost) no overhead
• Reflection ciphers
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
• The “Coefficients H” Technique
• Tight security bounds for key-alternating ciphers
• \textsc{Friet}: an authenticated encryption scheme with built-in fault detection

Cited in

(7)

• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Reflection Cryptanalysis of PRINCE-Like Ciphers
• Reflection cryptanalysis of PRINCE-like ciphers
• A modular approach to the security analysis of two-permutation constructions
• scientific article; zbMATH DE number 177048 (Why is no real title available?)
• Proof of mirror theory for a wide range of \(\xi_{\max }\)
• Reflection ciphers

This page was built for publication: Provably secure reflection ciphers

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