PRINCE

swMATH13240MaRDI QIDQ25155FDOQ25155

Author name not available (Why is that?)

Described by source

• PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract

Cited In (79)

• Differential attacks: using alternative operations
• A survey on implementation of lightweight block ciphers for resource constraints devices
• On the constructions of \(n\)-cycle permutations
• Involutory differentially 4-uniform permutations from known constructions
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
• A new non-random property of 4.5-round PRINCE
• PRINCEv2. More security for (almost) no overhead
• WARP: revisiting GFN for lightweight 128-bit block cipher
• Correlation power analysis of lightweight block ciphers: from theory to practice
• Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
• Multi-user collisions: applications to discrete logarithm, Even-Mansour and PRINCE
• The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
• A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
• Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
• Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\)
• Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
• Cryptanalysis of KLEIN
• Blockcipher-based authenticated encryption: how small can we go?
• Blockcipher-based authenticated encryption: how small can we go?
• Key alternating ciphers based on involutions
• Practical cryptanalysis of full Sprout with TMD tradeoff attacks
• Construction of lightweight S-boxes using Feistel and MISTY structures
• Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, Lblock, DES(L) and other bit-oriented block ciphers
• Observations on the \textsf{SIMON} block cipher family
• Implementing lightweight block ciphers on \texttt{x86} architectures
• Exploring energy efficiency of lightweight block ciphers
• Atomic-AES: a compact implementation of the AES encryption/decryption core
• Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
• Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY
• On Bruteforce-Like Cryptanalysis: New Meet-in-the-Middle Attacks in Symmetric Cryptanalysis
• Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes
• New constructions of involutions over finite fields
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Reflection cryptanalysis of PRINCE-like ciphers
• New observations on invariant subspace attack
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Cryptanalysis of reduced-round SIMON32 and SIMON48
• Cryptanalysis of Feistel networks with secret round functions
• A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Automatic search of meet-in-the-middle and impossible differential attacks
• Nonlinear diffusion layers
• A MAC mode for lightweight block ciphers
• Beyond birthday bound secure fresh rekeying: application to authenticated encryption
• AKF: a key alternating Feistel scheme for lightweight cipher designs
• Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
• On a generalization of substitution-permutation networks: the HADES design strategy
• Differential power analysis in Hamming weight model: how to choose among (extended) affine equivalent S-boxes
• Revised version of block cipher CHAM
• Another view of the division property
• Cryptanalysis of iterated Even-Mansour schemes with two keys
• SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
• On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
• Cryptanalysis of full sprout
• On the security of Piccolo lightweight block cipher against related-key impossible differentials
• Espresso: a stream cipher for 5G wireless communication systems
• Generic key recovery attack on Feistel scheme
• 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
• Reflection ciphers
• Redefining the transparency order
• Block cipher invariants as eigenvectors of correlation matrices
• Perfect nonlinear functions and cryptography
• CHAM: a family of lightweight block ciphers for resource-constrained devices
• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
• The phantom of differential characteristics
• The summation-truncation hybrid: reusing discarded bits for free
• Truncated differential based known-key attacks on round-reduced SIMON
• PRINCE: accurate approximation of the copy number of tandem repeats
• Side-channel analysis protection and low-latency in action -- case study of PRINCE and Midori
• Hashing mode using a lightweight blockcipher
• A new construction for involutions over finite fields
• Dual Relationship Between Impossible Differentials and Zero Correlation Linear Hulls of SIMON-Like Ciphers
• Cryptanalysis of masked ciphers: a not so random idea
• Mind the propagation of states. New automatic search tool for impossible differentials and impossible polytopic transitions
• More constructions of \(n\)-cycle permutations
• Construction of MDS matrices combining the Feistel, Misty and Lai-Massey schemes
• Authenticated encryption: how reordering can impact performance
• Linear permutations and their compositional inverses over 𝔽qn

This page was built for software: PRINCE