Differential cryptanalysis of DES-like cryptosystems
From MaRDI portal
Publication:807011
DOI10.1007/BF00630563zbMATH Open0729.68017OpenAlexW1629301835WikidataQ55868749 ScholiaQ55868749MaRDI QIDQ807011FDOQ807011
Authors: Eli Biham, Adi Shamir 
Publication date: 1991
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00630563
Recommendations
differential cryptanalysisdata encryption standarditerated cryptosystemsnew type of cryptanalytic attack
Cites Work
Cited In (only showing first 100 items - show all)
- Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups
- A framework to optimize implementations of matrices
- Generic attacks with standard deviation analysis on a-Feistel schemes
- The block cipher \textsc{Square}
- The rebound attack and subspace distinguishers: application to Whirlpool
- Involutory differentially 4-uniform permutations from known constructions
- A note on some algebraic trapdoors for block ciphers
- Can a differential attack work for an arbitrarily large number of rounds?
- On differential uniformity of maps that may hide an algebraic trapdoor
- A tutorial on linear and differential cryptanalysis
- Higher Order Differential Attack of a CAST Cipher
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- Linear and differential cryptanalysis: another viewpoint
- Efficient cache attacks on AES, and countermeasures
- Related-Key Differential-Linear Attacks on Reduced AES-192
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Notions and relations for RKA-secure permutation and function families
- New Lightweight DES Variants
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- On full differential uniformity of permutations on the ring of integers modulo \(n\)
- Differentially low uniform permutations from known 4-uniform functions
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Variants of the AES key schedule for better truncated differential bounds
- Simpira v2: a family of efficient permutations using the AES round function
- Note on impossible differential attacks
- A chaos-based approach to the design of cryptographically secure substitutions
- On the boomerang uniformity of some permutation polynomials
- A note on complete polynomials over finite fields and their applications in cryptography
- If a generalised butterfly is APN then it operates on 6 bits
- Quantum attacks on some Feistel block ciphers
- Differential fault analysis on block cipher SEED
- Bent functions on a finite nonabelian group
- Boomerang uniformity of popular S-box constructions
- Differential Cryptanalysis of Reduced-Round PRESENT
- Steganography of capacity required using modulo operator for embedding secret image
- Troika: a ternary cryptographic hash function
- On Cryptographically Significant Mappings over GF(2 n )
- Analysis of mixing properties of the operations of modular addition and bitwise addition defined on one carrier
- Some remarks on the TKIP key mixing function of IEEE 802.11i
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
- Swimming dynamics near a wall in a weakly elastic fluid
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Pseudorandom functions: three decades later
- Rigid commutators and a normalizer chain
- Cryptanalytic extraction of neural network models
- Generalization of a class of APN binomials to Gold-like functions
- Substitution-permutation networks resistant to differential and linear cryptanalysis
- Boomerang uniformity of normalized permutation polynomials of low degree
- Title not available (Why is that?)
- On Integral Distinguishers of Rijndael Family of Ciphers
- Title not available (Why is that?)
- On properties of translation groups in the affine general linear group with applications to cryptography
- Non abelian bent functions
- New Improvements of Davies-Murphy Cryptanalysis
- Attacking 9 and 10 Rounds of AES-256
- A methodology for differential-linear cryptanalysis and its applications
- Counting and characterising functions with ``fast points for differential attacks
- Improved bounds on sizes of generalized caps in \(AG(n,q)\)
- New differentially 4-uniform permutations by modifying the inverse function on subfields
- Best differential characteristic search of FEAL
- Antiderivative functions over \(\mathbb{F}_{2^n}\)
- Title not available (Why is that?)
- Linear and differential cryptanalysis of Russian GOST
- Four decades of research on bent functions
- On the security of the LAC authenticated encryption algorithm
- The differential spectrum of a class of power functions over finite fields
- Some results on the differential functions over finite fields
- On derivatives of polynomials over finite fields through integration
- Several classes of PcN power functions over finite fields
- Group theoretic properties of Rijndael-like ciphers
- A new characterization of group action-based perfect nonlinearity
- 3D: A Three-Dimensional Block Cipher
- On the relationships between perfect nonlinear functions and universal hash families
- Title not available (Why is that?)
- A new family of differentially 4-uniform permutations over \(\mathbb{F}_{2^{2k}}\) for odd \(k\)
- More differentially 6-uniform power functions
- Towards the optimality of Feistel ciphers with substitution-permutation functions
- On the differential and linear efficiency of balanced Feistel networks
- Higher Order Derivatives and Differential Cryptanalysis
- A new large class of functions not APN infinitely often
- A novel heuristic method for obtaining \(S\)-boxes
- An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps
- A construction of novel chaos base nonlinear component of block cipher
- Binomial differentially 4 uniform permutations with high nonlinearity
- Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
- Title not available (Why is that?)
- Higher order differentiation over finite fields with applications to generalising the cube attack
- Impossible differential attacks on 13-round CLEFIA-128
- Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- New commutative semifields defined by new PN multinomials
- Nonlinearities of S-boxes
- New explicit constructions of differentially 4-uniform permutations via special partitions of \(\mathbb{F}_{2^{2 k}}\)
- Algebraic Cryptanalysis of the Data Encryption Standard
- Differentially 4-uniform bijections by permuting the inverse function
- A cryptanalytic time-memory trade-off
- More constructions of differentially 4-uniform permutations on \(\mathbb {F}_{2^{2k}}\)
- On some block ciphers and imprimitive groups
This page was built for publication: Differential cryptanalysis of DES-like cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807011)
