On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses

DOI10.1007/0-387-34805-0_42zbMATH Open0722.94020OpenAlexW1830378742WikidataQ56235048 ScholiaQ56235048MaRDI QIDQ3211253FDOQ3211253

Hideki Imai, Yuliang Zheng, Tsutomu Matsumoto

Publication date: 1990

Published in: Advances in Cryptology — CRYPTO’ 89 Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-387-34805-0_42

Recommendations

• Building Secure Block Ciphers on Generic Attacks Assumptions
• Dial C for Cipher
• New structure of block ciphers with provable security against differential and linear cryptanalysis
• scientific article; zbMATH DE number 1418252
• Conditionally-perfect secrecy and a provably-secure randomized cipher

zbMATH Keywords

information securitycryptographysecret-key block cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (48)

• Related-key analysis of generalized Feistel networks with expanding round functions
• $\mathsf{XS}$-circuits in block ciphers
• Title not available (Why is that?)
• WARP: revisiting GFN for lightweight 128-bit block cipher
• Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
• Very Compact Hardware Implementations of the Blockcipher CLEFIA
• LLLWBC: a new low-latency light-weight block cipher
• Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
• Towards Understanding the Known-Key Security of Block Ciphers
• Collision Attack on 4-Branch, Type-2 GFN Based Hash Functions Using Sliced Biclique Cryptanalysis Technique
• Simpira v2: A Family of Efficient Permutations Using the AES Round Function
• Provable security against impossible differential and zero correlation linear cryptanalysis of some Feistel structures
• CCA security for contracting (quasi-)Feistel constructions with tight round complexity
• New algorithm for exhausting optimal permutations for generalized Feistel networks
• Provable related-key security of contracting Feistel networks
• The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers
• Automated meet-in-the-middle attack goes to Feistel
• An Enhanced Differential Cache Attack on CLEFIA for Large Cache Lines
• Title not available (Why is that?)
• Generalized Feistel networks revisited
• Analysis of \(3\)-line generalized Feistel networks with double SD-functions
• Tweakable Pseudorandom Permutation from Generalized Feistel Structure
• Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
• Title not available (Why is that?)
• Invertible quadratic non-linear functions over \(\mathbb{F}_p^n\) via multiple local maps
• \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
• Title not available (Why is that?)
• Construction of MDS matrices from generalized Feistel structures
• Key-recovery attacks on \texttt{CRAFT} and \texttt{WARP}
• Simplified MITM modeling for permutations: new (quantum) attacks
• Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited
• On unbalanced feistel networks with contracting MDS diffusion
• Building Secure Block Ciphers on Generic Attacks Assumptions
• Towards minimizing tweakable blockcipher-based generalized Feistel networks
• Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure
• On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability
• О групповых свойствах классов SH- и TH-алгоритмов Фейстеля с линейно зависящими от координат ключа функциями усложнения;On group properties of classes Source-Heavy and Target-Heavy Feistel block ciphers with round functions linear dependent on round keys parts
• Generalized Feistel ciphers for efficient prime field masking
• Pseudorandomness of Camellia-like scheme
• Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
• Analysis of minimum numbers of linearly active \(S\)-boxes of a class of generalized Feistel block ciphers
• On the diffusion of the improved generalized Feistel
• Applications of Simon's algorithm in quantum attacks on Feistel variants
• On the Diffusion of Generalized Feistel Structures Regarding Differential and Linear Cryptanalysis
• On the guaranteed number of activations in $\mathsf{XS}$-circuits
• Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis
• Quantum attacks on generalized Feistel networks based on the strong-weak separability
• Robust Encryption, Revisited

This page was built for publication: On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses

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