Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY

DOI10.1007/978-3-319-66787-4_33MaRDI QIDQ5114657zbMATH OpenOpenAlexFDO

Authors Jérémy Jean, Amir Moradi, Thomas Peyrin, Pascal Sasdrich

Publication date 24 June 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-66787-4_33

zbMATH Keywords

lightweight cryptographybit-serial implementationsbit-slide

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• GIFT: a small present. Towards reaching the limit of lightweight encryption
• Spin me right round rotational symmetry for FPGA-specific AES: extended version
• Six shades of AES
• Atomic-AES: a compact implementation of the AES encryption/decryption core
• PRESENT: An Ultra-Lightweight Block Cipher

Cited in

(9)

• WARP: revisiting GFN for lightweight 128-bit block cipher
• More Results on Shortest Linear Programs
• TNT: how to tweak a block cipher
• Implementing Grover oracles for quantum key search on AES and LowMC
• A first-order SCA resistant AES without fresh randomness
• Six shades of AES
• A small GIFT-COFB: lightweight bit-serial architectures
• Spin me right round rotational symmetry for FPGA-specific AES: extended version
• On area, time, and the right trade-off

Describes a project that uses

Uses Software

• SPECK
• SKINNY
• SIMON
• PRINCE
• PHOTON
• EPCBC
• PRESENT

This page was built for publication: Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114657)