On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
From MaRDI portal
Publication:3211253
DOI10.1007/0-387-34805-0_42zbMath0722.94020OpenAlexW1830378742WikidataQ56235048 ScholiaQ56235048MaRDI QIDQ3211253
Yuliang Zheng, Tsutomu Matsumoto, Hiroshi Imai
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
Related Items (39)
Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Very Compact Hardware Implementations of the Blockcipher CLEFIA ⋮ On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ WARP: revisiting GFN for lightweight 128-bit block cipher ⋮ Collision Attack on 4-Branch, Type-2 GFN Based Hash Functions Using Sliced Biclique Cryptanalysis Technique ⋮ Analysis of minimum numbers of linearly active \(S\)-boxes of a class of generalized Feistel block ciphers ⋮ On the guaranteed number of activations in $\mathsf{XS}$-circuits ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ О групповых свойствах классов 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 networks revisited ⋮ Quantum attacks on generalized Feistel networks based on the strong-weak separability ⋮ Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ LLLWBC: a new low-latency light-weight block cipher ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Applications of Simon's algorithm in quantum attacks on Feistel variants ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ New algorithm for exhausting optimal permutations for generalized Feistel networks ⋮ Analysis of \(3\)-line generalized Feistel networks with double SD-functions ⋮ 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 ⋮ On unbalanced feistel networks with contracting MDS diffusion ⋮ The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers ⋮ Robust Encryption, Revisited ⋮ Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited ⋮ Pseudorandomness of Camellia-like scheme ⋮ Construction of MDS matrices from generalized Feistel structures ⋮ Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure ⋮ $\mathsf{XS}$-circuits in block ciphers ⋮ On the Diffusion of Generalized Feistel Structures Regarding Differential and Linear Cryptanalysis ⋮ Provable related-key security of contracting Feistel networks ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions ⋮ On the diffusion of the improved generalized Feistel ⋮ An Enhanced Differential Cache Attack on CLEFIA for Large Cache Lines ⋮ Unnamed Item ⋮ Provable security against impossible differential and zero correlation linear cryptanalysis of some Feistel structures ⋮ Unnamed Item ⋮ Tweakable Pseudorandom Permutation from Generalized Feistel Structure
This page was built for publication: On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
