swMATH21989MaRDI QIDQ33786FDOQ33786
Author name not available (Why is that?)
Official website: http://www.cl.cam.ac.uk/~rja14/serpent.html
Cited In (74)
- Improved integral attack on generalized Feistel cipher
- Differential fault analysis of Sosemanuk
- Cryptanalysis of Hummingbird-1
- 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
- Pen and Paper Arguments for SIMON and SIMON-like Designs
- Designing against a class of algebraic attacks on symmetric block ciphers
- Revisiting key schedule's diffusion in relation with round function's diffusion
- Comparative performance of the classifiers for cryptosystem identification
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- 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
- SM4
- A note on some algebraic trapdoors for block ciphers
- Efficient cache attacks on AES, and countermeasures
- Type-preserving matrices and security of block ciphers
- Title not available (Why is that?)
- SEA: A Scalable Encryption Algorithm for Small Embedded Applications
- Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions
- 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
- The design of composite permutations with applications to DES-like 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
- 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
- Finding the differential characteristics of block ciphers with neural networks
- Multidimensional linear cryptanalysis
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Cryptographic analysis of all \(4 \times 4\)-bit s-boxes
- Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
- New attacks from old distinguishers improved attacks on serpent
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- Rumba20
- Rabbit
- PRESENT
- Camellia
- NOEKEON
- SOSEMANUK
- ICEBERG
- Twofish
- New statistical randomness tests based on length of runs
- SNOW
- MacGuffin
- PICARO
- SAFER
- MISTY
- muFP
- DLCT
- 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
- New criteria for linear maps in AES-like ciphers
- TEA
- Kuznyechik
- Streebog
- Cryptanalysis of a Generic Class of White-Box Implementations
- Serpent: a new block cipher proposal
- Modeling energy-efficient secure communications in multi-mode wireless mobile devices
- Structural cryptanalysis of SASAS
- A Differential-Linear Attack on 12-Round Serpent
- A methodology for differential-linear cryptanalysis and its applications
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Constructing infinite families of low differential uniformity (\(n,m\))-functions with \(m>n/2\)
- CRAFT
- 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
This page was built for software: Serpent
