PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- New observations on invariant subspace attack
- On the construction of hardware-friendly \(4\times4\) and \(5\times5\) S-boxes
- Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis
- Differential attacks: using alternative operations
- Key alternating ciphers based on involutions
- sLiSCP: Simeck-based permutations for lightweight sponge cryptographic primitives
- Involutory differentially 4-uniform permutations from known constructions
- Nonlinear diffusion layers
- Characterizations and constructions of triple-cycle permutations of the form x^rh(x^s)
- On the constructions of n-cycle permutations
- SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
- The summation-truncation hybrid: reusing discarded bits for free
- Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- On a generalization of substitution-permutation networks: the HADES design strategy
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Transparency order of \((n, m)\)-functions -- its further characterization and applications
- New constructions of involutions over finite fields
- Blockcipher-based authenticated encryption: how small can we go?
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE
- The phantom of differential characteristics
- Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
- Survey of information security
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Perfect nonlinear functions and cryptography
- PRINCE
- Reflection cryptanalysis of PRINCE-like ciphers
- A new construction for involutions over finite fields
- Mind the propagation of states. New automatic search tool for impossible differentials and impossible polytopic transitions
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- Cryptanalysis of masked ciphers: a not so random idea
- More constructions of n-cycle permutations
- Analyzing permutations for AES-like ciphers: understanding shiftrows
- Practical cryptanalysis of full Sprout with TMD tradeoff attacks
- Cryptanalysis of Feistel networks with secret round functions
- Exploring energy efficiency of lightweight block ciphers
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Correlation power analysis of lightweight block ciphers: from theory to practice
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Automatic search of meet-in-the-middle and impossible differential attacks
- Another view of the division property
- Reflection Cryptanalysis of PRINCE-Like Ciphers
- Security analysis of \textsc{Prince}
- CUBE cipher: a family of quasi-involutive block ciphers easy to mask
- Side-channel analysis protection and low-latency in action -- case study of PRINCE and Midori
- Atomic-AES: a compact implementation of the AES encryption/decryption core
- Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
- LHash: a lightweight hash function
- Links among impossible differential, integral and zero correlation linear cryptanalysis
- Cryptanalysis of full sprout
- Security analysis of the full-round CHESS-64 cipher suitable for pervasive computing environments
- Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
- A MAC mode for lightweight block ciphers
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Low-latency encryption -- is ``lightweight = light + wait?
- AKF: a key alternating Feistel scheme for lightweight cipher designs
- Linear permutations and their compositional inverses over 𝔽qn
- A survey on implementation of lightweight block ciphers for resource constraints devices
- Espresso: a stream cipher for 5G wireless communication systems
- Dual Relationship Between Impossible Differentials and Zero Correlation Linear Hulls of SIMON-Like Ciphers
- Construction of MDS matrices combining the Feistel, Misty and Lai-Massey schemes
- Reflection ciphers
- Redefining the transparency order
- Truncated differential based known-key attacks on round-reduced SIMON
- A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
- Block cipher invariants as eigenvectors of correlation matrices
- An efficient strategy to construct a better differential on multiple-branch-based designs: application to Orthros
- XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
- Improved heuristics for low-latency implementations of linear layers
- Energy consumption of protected cryptographic hardware cores. An experimental study
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- Cryptanalysis of reduced round SPEEDY
- A theoretical analysis of generalized invariants of bijective S-boxes
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
- LLLWBC: a new low-latency light-weight block cipher
- Optimizing the depth of quantum implementations of linear layers
- RAMus- a new lightweight block cipher for RAM encryption
- Categorization of faulty nonce misuse resistant message authentication
- Three input exclusive-or gate support for Boyar-Peralta's algorithm
- Analyzing masked ciphers against transition and coupling effects
- Constructing and deconstructing intentional weaknesses in symmetric ciphers
- Provably secure reflection ciphers
- Four by four MDS matrices with the fewest XOR gates based on words
- Impossible differential cryptanalysis on reduced-round PRINCEcore
- The existence for a class of composite involution polynomials over finite fields
- Trade-Offs for S-Boxes: Cryptographic Properties and Side-Channel Resilience
- A Practical Chosen Message Power Analysis Approach Against Ciphers with the Key Whitening Layers
- An enhanced binary characteristic set algorithm and its applications to algebraic cryptanalysis
- Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
- Observations on the branch number and differential analysis of SPEEDY
- On the construction of near-MDS matrices
- Nilpotent linearized polynomials over finite fields, revisited
- Forgery attacks on several beyond-birthday-bound secure MACs
- A further study on the Ness-Helleseth function
- Parallel verification of serial MAC and AE modes
- Threshold implementations with non-uniform inputs
- Parallel SAT framework to find clustering of differential characteristics and its applications
Describes a project that uses
Uses Software
This page was built for publication: PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911587)
