LS-designs: bitslice encryption for efficient masked software implementations
From MaRDI portal
Publication:2946901
DOI10.1007/978-3-662-46706-0_2zbMATH Open1382.94111OpenAlexW930621015MaRDI QIDQ2946901FDOQ2946901
Authors: Vincent Grosso, Gaëtan Leurent, Kerem Varici, François-Xavier Standaert 
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01093491/file/bislice_cipher.pdf
Recommendations
- Improving the security and efficiency of block ciphers based on LS-designs
- Block ciphers that are easier to mask: how far can we go?
- How fast can higher-order masking be in software?
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Higher-order masking schemes for S-boxes
Cited In (35)
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
- Differential fault attack on lightweight block cipher PIPO
- \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations
- A new non-random property of 4.5-round PRINCE
- WARP: revisiting GFN for lightweight 128-bit block cipher
- Correlation power analysis of lightweight block ciphers: from theory to practice
- Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
- RAMus- a new lightweight block cipher for RAM encryption
- Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Differential-linear and related key cryptanalysis of round-reduced scream
- How fast can higher-order masking be in software?
- Boomerang uniformity of popular S-box constructions
- New classes of 8-bit permutations based on a butterfly structure
- Related-key attack on full-round PICARO
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
- Block ciphers that are easier to mask: how far can we go?
- Designing S-boxes providing stronger security against differential cryptanalysis for ciphers using byte-wise XOR
- New observations on invariant subspace attack
- Mode-level vs. implementation-level physical security in symmetric cryptography. A practical guide through the leakage-resistance jungle
- Nonlinear diffusion layers
- A MAC mode for lightweight block ciphers
- Leakage resilient value comparison with application to message authentication
- Generalized Feistel ciphers for efficient prime field masking
- Cryptanalysis results on spook. Bringing full-round shadow-512 to the light
- CUBE cipher: a family of quasi-involutive block ciphers easy to mask
- Построение подстановок пространства $V_{2m}$ с использованием $(2m,m)$-функций
- A theoretical analysis of generalized invariants of bijective S-boxes
- Improving the security and efficiency of block ciphers based on LS-designs
- Tornado: automatic generation of probing-secure masked bitsliced implementations
- Differential uniformity and linearity of S-boxes by multiplicative complexity
- On degree-\(d\) zero-sum sets of full rank
- Improved filter permutators for efficient FHE: better instances and implementations
This page was built for publication: LS-designs: bitslice encryption for efficient masked software implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946901)
