How fast can SM4 be in software?

DOI10.1007/978-3-031-26553-2_1MaRDI QIDQ6134004FDOQ6134004

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)

zbMATH Keywords

GCMSM4bitsliced implementationCTR mode

Mathematics Subject Classification ID

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

Cites Work

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

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)