ShangMi 3 (SM3) is a cryptographic hash function, standardised for use in commercial cryptography in China.[1] It was published by the National Cryptography Administration (Chinese: 国家密码管理局) on 2010-12-17[2][3] as "GM/T 0004-2012: SM3 cryptographic hash algorithm".[2]
| General | |
|---|---|
| Designers | National Cryptography Administration |
| First published | 2010 |
SM3 is used for implementing digital signatures, message authentication codes, and pseudorandom number generators.[4] The algorithm is public[5][6] and is considered similar to SHA-256 in security and efficiency.[7] SM3 is used with Transport Layer Security.[8]
Definitive standards
editSM3 is defined in each of:
References
edit- ^ Martinkauppi, Louise Bergman; He, Qiuping; Ilie, Dragos (June 2020). "On the Design and Performance of Chinese OSCCA-approved Cryptographic Algorithms". 2020 13th International Conference on Communications (COMM). pp. 119–124. doi:10.1109/COMM48946.2020.9142035. ISBN 978-1-7281-5611-8. S2CID 220668639.
- ^ a b c "Announcement No.23 of the State Cryptography Administration" (in Chinese (China)). The Office of the State Commercial Code Administration (OSCCA). 2012-03-21. Archived from the original on 2016-08-14. Retrieved 2016-07-24.
- ^ "SM3 cryptographic hash algorithm" (in Chinese (China)). CNNIC. 2013-12-04. Archived from the original on 2016-09-19. Retrieved 2016-07-24.
- ^ a b "The SM3 Cryptographic Hash Function". Internet Engineering Task Force. 2018-01-08. Retrieved 2023-11-16.
- ^ "Announcement No.22 of the State Cryptography Administration" (in Chinese (China)). The Office of the State Commercial Code Administration (OSCCA). 2010-12-17. Retrieved 2016-08-06.
- ^ "SM3 cryptographic hash algorithm" (PDF) (in Chinese (China)).
- ^ "An Efficient and Low-Power Design of the SM3 Hash Algorithm for IoT". Electronics. 2019-09-11. Retrieved 2021-02-11.
- ^ Yang, P (March 2021). RFC 8998. IETF. doi:10.17487/RFC8998. Retrieved 2022-07-30.
- ^ Wang Xiaoyun. SM3 Cryptographic Hash Algorithm[J]. Journal of Information Security Research, 2016, 2(11): 983-994.
See also
edit
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |