SPECK

swMATH33879MaRDI QIDQ45588FDOQ45588

Author name not available (Why is that?)

Cited In (52)

• Automatic key recovery of Feistel ciphers: application to SIMON and SIMECK
• Dual Relationship Between Impossible Differentials and Zero Correlation Linear Hulls of SIMON-Like Ciphers
• GIFT: a small present. Towards reaching the limit of lightweight encryption
• A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
• A survey on implementation of lightweight block ciphers for resource constraints devices
• Improving attacks on round-reduced Speck32/64 using deep learning
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
• WARP: revisiting GFN for lightweight 128-bit block cipher
• Security analysis of SIMECK block cipher against related-key impossible differential
• Automatic differential analysis of ARX block ciphers with application to SPECK and LEA
• Correlation power analysis of lightweight block ciphers: from theory to practice
• The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
• Grover on \(SIMON\)
• Blockcipher-based authenticated encryption: how small can we go?
• Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
• How to build fully secure tweakable blockciphers from classical blockciphers
• Impossible differential attack on reduced round SPARX-64/128
• Thinking outside the superbox
• Exploring energy efficiency of lightweight block ciphers
• Atomic-AES: a compact implementation of the AES encryption/decryption core
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
• Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY
• Design Strategies for ARX with Provable Bounds: Sparx and LAX
• Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT
• Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: improved cryptanalysis of an ISO standard
• A bit-vector differential model for the modular addition by a constant
• On linear hulls and trails
• Differential-ML distinguisher: machine learning based generic extension for differential cryptanalysis
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Constructions with high algebraic degree of differentially 4-uniform \((n, n - 1)\)-functions and differentially 8-uniform \((n, n - 2)\)-functions
• On the Design Rationale of Simon Block Cipher: Integral Attacks and Impossible Differential Attacks against Simon Variants
• The Oribatida v1.3 family of lightweight authenticated encryption schemes
• Security analysis of subterranean 2.0
• A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis
• Automatic search of meet-in-the-middle and impossible differential attacks
• Lower bounds on the degree of block ciphers
• Beyond birthday bound secure fresh rekeying: application to authenticated encryption
• Automatic search of linear trails in ARX with applications to SPECK and Chaskey
• A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
• Pen and Paper Arguments for SIMON and SIMON-like Designs
• Linear cryptanalysis of reduced-round SPECK
• Revisiting the wrong-key-randomization hypothesis
• Revised version of block cipher CHAM
• SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
• Extended meet-in-the-middle attacks on some Feistel constructions
• Improved differential-linear attack with application to round-reduced Speck32/64
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Perfect nonlinear functions and cryptography
• Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK
• A white-box speck implementation using self-equivalence encodings
• On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions

This page was built for software: SPECK