How fast can SM4 be in software?
From MaRDI portal
Publication:6134004
DOI10.1007/978-3-031-26553-2_1MaRDI QIDQ6134004
Xin Miao, Chun Guo, Wei-Jia Wang, Meiqin Wang
Publication date: 21 August 2023
Published in: Information Security and Cryptology (Search for Journal in Brave)
Cites Work
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Logic minimization techniques with applications to cryptology
- Foundationalism, probability, and mutual support
- Breaking and Repairing GCM Security Proofs
- GCM Security Bounds Reconsidered
- A Very Compact S-Box for AES
- Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared
- A Provable-Security Treatment of the Key-Wrap Problem
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Analysis of the SMS4 Block Cipher
- Bitslice Implementation of AES
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: How fast can SM4 be in software?