Provably secure reflection ciphers

DOI10.1007/978-3-031-15985-5_9zbMATH Open1517.94063OpenAlexW4312915334MaRDI QIDQ6166950FDOQ6166950

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

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

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)

Cites Work

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

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
• Title not available (Why is that?)
• 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)