PRESENT

swMATH8313MaRDI QIDQ20323FDOQ20323

Author name not available (Why is that?)

Described by source

• FPGA implementation of a statistical saturation attack against PRESENT

Cited In (only showing first 100 items - show all)

• An STP-based model toward designing S-boxes with good cryptographic properties
• The Cryptanalysis of Reduced-Round SMS4
• A note on the signal-to-noise ratio of \((n, m)\)-functions
• Wave-shaped round functions and primitive groups
• Differential attacks: using alternative operations
• Some results on Fruit
• A survey on implementation of lightweight block ciphers for resource constraints devices
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
• Improved (related-key) differential cryptanalysis on GIFT
• WARP: revisiting GFN for lightweight 128-bit block cipher
• Minimizing the two-round Even-Mansour cipher
• What is the effective key length for a block cipher: an attack on every practical block cipher
• Speeding up the GVW algorithm via a substituting method
• Linearly equivalent s-boxes and the division property
• Making the impossible possible
• Regular subgroups with large intersection
• ARMADILLO: A multi-purpose cryptographic primitive dedicated to hardware
• On hidden sums compatible with a given block cipher diffusion layer
• Pushing the limits: a very compact and a threshold implementation of AES
• Higher-order masking schemes for S-boxes
• There is wisdom in harnessing the strengths of your enemy: customized encoding to thwart side-channel attacks
• Implementing lightweight block ciphers on \texttt{x86} architectures
• The resistance of PRESENT-80 against related-key differential attacks
• Exploring energy efficiency of lightweight block ciphers
• Atomic-AES: a compact implementation of the AES encryption/decryption core
• Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
• How fast can higher-order masking be in software?
• A key to success. Success exponents for side-channel distinguishers
• Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY
• ParTI -- towards combined hardware countermeasures against side-channel and fault-injection attacks
• Troika: a ternary cryptographic hash function
• Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: improved cryptanalysis of an ISO standard
• On the efficiency of solving Boolean polynomial systems with the characteristic set method
• Towards closing the security gap of Tweak-aNd-Tweak (TNT)
• New observations on invariant subspace attack
• Security evaluation against side-channel analysis at compilation time
• A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
• Cryptographic properties of small bijective S-boxes with respect to modular addition
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• A first-order SCA resistant AES without fresh randomness
• Generalized MitM attacks on full TWINE
• Improved improbable differential attacks on ISO standard CLEFIA: expansion technique revisited
• A new construction of differentially 4-uniform \((n,n-1)\)-functions
• MRHS solver based on linear algebra and exhaustive search
• The cryptographic power of random selection
• Nonlinear diffusion layers
• Lower bounds on the degree of block ciphers
• A MAC mode for lightweight block ciphers
• Beyond birthday bound secure fresh rekeying: application to authenticated encryption
• Primitivity of PRESENT and other lightweight ciphers
• Fault template attacks on block ciphers exploiting fault propagation
• Bagua: a NFSR-based stream cipher constructed following confusion and diffusion principles
• Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
• Some group-theoretical results on Feistel networks in a long-key scenario
• Another view of the division property
• A single-key attack on the full GOST block cipher
• Design and analysis of small-state grain-like stream ciphers
• A chain of normalizers in the Sylow 2-subgroups of the symmetric group on \({\mathbf{2}}^n\) letters
• SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
• Practical attack on 8 rounds of the lightweight block cipher KLEIN
• On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
• A secure effective key management scheme for dynamic access control in a large leaf class hierarchy
• New links between differential and linear cryptanalysis
• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
• GIFT: a small present. Towards reaching the limit of lightweight encryption
• Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups
• One-key compression function based MAC with security beyond birthday bound
• Cryptanalysis of PRESENT-like ciphers with secret S-boxes
• Understanding Cryptography
• Switchings, extensions, and reductions in central digraphs
• Biclique cryptanalysis of LBlock and TWINE
• Slender-set differential cryptanalysis
• Quark: a lightweight hash
• A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• A note on some algebraic trapdoors for block ciphers
• Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions
• On full differential uniformity of permutations on the ring of integers modulo \(n\)
• The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
• Structural evaluation by generalized integral property
• Compact Implementation and Performance Evaluation of Block Ciphers in ATtiny Devices
• Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
• Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers
• On weakly APN functions and 4-bit S-boxes
• Cryptanalysis of KLEIN
• : Increasing the Security and Efficiency of
• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• Blockcipher-based authenticated encryption: how small can we go?
• 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
• New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers
• Differential-linear cryptanalysis revisited
• Lightweight MDS generalized circulant matrices
• Cellular automata based S-boxes
• Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128
• $\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
• On some block ciphers and imprimitive groups
• Known-key distinguisher on full \(\mathtt{PRESENT}\)

This page was built for software: PRESENT