How fast can SM4 be in software?

DOI10.1007/978-3-031-26553-2_1MaRDI QIDQ6134004zbMATH OpenFDO

Authors Xin Miao, Chun Guo, Meiqin Wang, Weijia Wang

Publication date 21 August 2023

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-26553-2_1

zbMATH Keywords

bitsliced implementationCTR modeGCMSM4

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A Provable-Security Treatment of the Key-Wrap Problem
• A Very Compact S-Box for AES
• Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared
• Analysis of the SMS4 Block Cipher
• Bitslice Implementation of AES
• Breaking and repairing GCM security proofs
• Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
• Foundationalism, probability, and mutual support
• GCM security bounds reconsidered
• Logic minimization techniques with applications to cryptology
• On the Shortest Linear Straight-Line Program for Computing Linear Forms
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: How fast can SM4 be in software?

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