SIMECK

swMATH13823WikidataQ123191660 ScholiaQ123191660MaRDI QIDQ25734FDOQ25734

Author name not available (Why is that?)

Cited In (65)

• Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
• Differential characteristics of base operations in ARX-ciphers
• On linear hulls and trails
• 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
• A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not
• \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
• A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
• Structural evaluation by generalized integral property
• New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers
• Lightweight MDS generalized circulant matrices
• Impossible differential attack on reduced round SPARX-64/128
• Algebraic analysis of the Simon block cipher family
• Observations on the \textsf{SIMON} block cipher family
• 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-based division property and application to \textsc{Simon} family
• Design Strategies for ARX with Provable Bounds: Sparx and LAX
• The MALICIOUS framework: embedding backdoors into tweakable block ciphers
• 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
• Differential-ML distinguisher: machine learning based generic extension for differential cryptanalysis
• 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
• Cryptanalysis of reduced-round SIMON32 and SIMON48
• 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
• A MAC mode for lightweight block ciphers
• Beyond birthday bound secure fresh rekeying: application to authenticated encryption
• A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
• Pen and Paper Arguments for SIMON and SIMON-like Designs
• Improved Linear Cryptanalysis of Reduced-Round SIMON-32 and SIMON-48
• Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX)
• Revisiting the wrong-key-randomization hypothesis
• Revised version of block cipher CHAM
• A comparison of the homomorphic encryption schemes FV and YASHE
• Linear cryptanalysis of reduced-round SIMECK variants
• Linear hull attack on round-reduced Simeck with dynamic key-guessing techniques
• SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations
• Automatic Search for Differential Trails in ARX Ciphers
• Extended meet-in-the-middle attacks on some Feistel constructions
• Improved differential-linear attack with application to round-reduced Speck32/64
• Meet-in-the-middle attacks on generic Feistel constructions
• On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Perfect nonlinear functions and cryptography
• CHAM: a family of lightweight block ciphers for resource-constrained devices
• Automatic search for the best trails in ARX: application to block cipher \textsc{Speck}
• Algebraic insights into the secret Feistel network
• A white-box speck implementation using self-equivalence encodings
• The summation-truncation hybrid: reusing discarded bits for free
• 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
• Truncated differential based known-key attacks on round-reduced SIMON

This page was built for software: SIMECK