PRESENT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups
- Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
- An STP-based model toward designing S-boxes with good cryptographic properties
- A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
- A new variant of PMAC: beyond the birthday bound
- One-key compression function based MAC with security beyond birthday bound
- Cryptanalysis of PRESENT-like ciphers with secret S-boxes
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- PRESENT runs fast. Efficient and secure implementation in software
- Biclique cryptanalysis of LBlock and TWINE
- Switchings, extensions, and reductions in central digraphs
- The Cryptanalysis of Reduced-Round SMS4
- Wave-shaped round functions and primitive groups
- Differential attacks: using alternative operations
- A note on the signal-to-noise ratio of \((n, m)\)-functions
- Some results on Fruit
- Understanding Cryptography
- A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock
- Slender-set differential cryptanalysis
- SPEEDY on Cortex-M3: efficient software implementation of SPEEDY on ARM Cortex-M3
- Quark: a lightweight hash
- \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
- Improved (related-key) differential cryptanalysis on GIFT
- The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
- WARP: revisiting GFN for lightweight 128-bit block cipher
- A note on some algebraic trapdoors for block ciphers
- A survey on implementation of lightweight block ciphers for resource constraints devices
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Minimizing the two-round Even-Mansour cipher
- A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
- What is the effective key length for a block cipher: an attack on every practical block cipher
- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
- Speeding up the GVW algorithm via a substituting method
- PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware
- Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions
- Type-preserving matrices and security of block ciphers
- BitCryptor: Bit-Serialized Flexible Crypto Engine for Lightweight Applications
- On full differential uniformity of permutations on the ring of integers modulo \(n\)
- Cryptanalysis of the light-weight cipher A2U2
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- Structural evaluation by generalized integral property
- Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
- On weakly APN functions and 4-bit S-boxes
- Compact Implementation and Performance Evaluation of Block Ciphers in ATtiny Devices
- Polynomial evaluation and side channel analysis
- Linearly equivalent s-boxes and the division property
- Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers
- Cryptanalysis of KLEIN
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
- : Increasing the Security and Efficiency of
- Blockcipher-based authenticated encryption: how small can we go?
- Making the impossible possible
- Constructing TI-friendly substitution boxes using shift-invariant permutations
- Regular subgroups with large intersection
- Blockcipher-based authenticated encryption: how small can we go?
- Practical cryptanalysis of full Sprout with TMD tradeoff attacks
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Differential-linear cryptanalysis revisited
- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise
- Lightweight MDS generalized circulant matrices
- New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers
- Cellular automata based S-boxes
- On some block ciphers and imprimitive groups
- On hidden sums compatible with a given block cipher diffusion layer
- Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128
- Pushing the limits: a very compact and a threshold implementation of AES
- ARMADILLO: A multi-purpose cryptographic primitive dedicated to hardware
- Affine equivalence and its application to tightening threshold implementations
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, Lblock, DES(L) and other bit-oriented block ciphers
- Known-key distinguisher on full \(\mathtt{PRESENT}\)
- Thinking outside the superbox
- Resilient uniformity: applying resiliency in masking
- The resistance of PRESENT-80 against related-key differential attacks
- Implementing lightweight block ciphers on \texttt{x86} architectures
- There is wisdom in harnessing the strengths of your enemy: customized encoding to thwart side-channel attacks
- Higher-order masking schemes for S-boxes
- Exploring energy efficiency of lightweight block ciphers
- Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
- Atomic-AES: a compact implementation of the AES encryption/decryption core
- Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
- ParTI -- towards combined hardware countermeasures against side-channel and fault-injection attacks
- A key to success. Success exponents for side-channel distinguishers
- How fast can higher-order masking be in software?
- Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY
- Impossible differential attacks on reduced-round LBlock
- Hiding higher-order side-channel leakage. Randomizing cryptographic implementations in reconfigurable hardware
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT
- On differential properties of a symmetric cryptoalgorithm based on pseudo-dynamic substitutions
- Troika: a ternary cryptographic hash function
- Differential cryptanalysis of round-reduced printcipher: computing roots of permutations
- Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: improved cryptanalysis of an ISO standard
- Linear cryptanalysis of printcipher -- trails and samples everywhere
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
- Ultra-Lightweight Implementations for Smart Devices – Security for 1000 Gate Equivalents
- Biclique attack of block cipher \texttt{SKINNY}
This page was built for software: PRESENT
