Serpent: a new block cipher proposal
From MaRDI portal
Publication:4639451
DOI10.1007/3-540-69710-1_15zbMATH Open1385.94015OpenAlexW1518029257MaRDI QIDQ4639451FDOQ4639451
Authors: Eli Biham, Ross Anderson, Lars R. Knudsen 
Publication date: 9 May 2018
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-69710-1_15
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning cryptanalysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- New types of cryptanalytic attacks using related keys
- A fast new DES implementation in software
- Title not available (Why is that?)
- An improvement of Davies' attack on DES
- Pairs and triplets of DES S-boxes
Cited In (62)
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- Wave-shaped round functions and primitive groups
- Differential attacks: using alternative operations
- The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
- A note on some algebraic trapdoors for block ciphers
- Type-preserving matrices and security of block ciphers
- Differential-linear cryptanalysis from an algebraic perspective
- Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers
- On weakly APN functions and 4-bit S-boxes
- A note on APN permutations in even dimension
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
- Differential-linear cryptanalysis revisited
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
- RAMus- a new lightweight block cipher for RAM encryption
- On hidden sums compatible with a given block cipher diffusion layer
- On some block ciphers and imprimitive groups
- Parallel algorithms development for programmable devices with application from cryptography
- Title not available (Why is that?)
- Finding the differential characteristics of block ciphers with neural networks
- Multidimensional linear cryptanalysis
- Differential fault analysis of Sosemanuk
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Differential Cryptanalysis of Reduced-Round PRESENT
- A Statistical Saturation Attack against the Block Cipher PRESENT
- A structure for fast data encryption
- Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
- Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
- Counting active S-boxes is not enough
- New attacks from old distinguishers improved attacks on serpent
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- A new construction of differentially 4-uniform \((n,n-1)\)-functions
- New statistical randomness tests based on length of runs
- Primitivity of PRESENT and other lightweight ciphers
- Improbable differential attacks on \texttt{PRESENT} using undisturbed bits
- Key guessing strategies for linear key-schedule algorithms in rectangle attacks
- Pen and Paper Arguments for SIMON and SIMON-like Designs
- Designing against a class of algebraic attacks on symmetric block ciphers
- Cryptanalysis of a Generic Class of White-Box Implementations
- Revisiting key schedule's diffusion in relation with round function's diffusion
- Structural cryptanalysis of SASAS
- Comparative performance of the classifiers for cryptosystem identification
- A methodology for differential-linear cryptanalysis and its applications
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
- Enabling 3-share threshold implementations for all 4-bit S-boxes
- MRHS Equation Systems
- Title not available (Why is that?)
- An efficient 2048-bit block cipher
- Constructing infinite families of low differential uniformity (\(n,m\))-functions with \(m>n/2\)
- Explicit values of the DDT, the BCT, the FBCT, and the FBDT of the inverse, the Gold, and the Bracken-Leander S-boxes
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
- Improved integral attack on generalized Feistel cipher
- Correlation cube attack revisited. Improved cube search and superpoly recovery techniques
- Rotational-XOR differential rectangle cryptanalysis on \textsc{Simon}-like ciphers
- An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
- Designing S-boxes providing stronger security against differential cryptanalysis for ciphers using byte-wise XOR
- Improving linear key recovery attacks using Walsh spectrum puncturing
- New approaches for estimating the bias of differential-linear distinguishers
- Revisiting differential-linear attacks via a boomerang perspective with application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck, and SERPENT
- Indifferentiability of 3-round confusion-diffusion networks
- Divide and rule: \textsf{DiFA} -- division property based fault attacks on \textsf{PRESENT} and \textsf{GIFT}
Uses Software
This page was built for publication: Serpent: a new block cipher proposal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639451)
