Algebraic Attack to SMS4 and the Comparison with AES

Ji, Wen; Hu, Lei; Ou, Haiwen

doi:10.1109/ias.2009.171

Cited by 8 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, breaking the system over GF (2 8 ) does not appear to provide any benefit over solving over GF (2). Specifically, the claims of [5] and [6] are contradicted by our experimental results. This casts very serious doubts about the basis of their theoretical analysis.…”

Section: Conclusion and Discussioncontrasting

confidence: 56%

“…The authors of [5] have updated their analysis in [6], including adding an analysis of SMS4 over GF (2). Their complexity prediction of 2 90 for the four round attack over GF (2 8 ) is even higher, and their estimates for GF(2) attacks at 4 rounds (2 102 ) and 5 rounds (2 121 ) show drastically higher complexity, and higher increase in complexity, than we observed in our experiments.…”

Section: Gf(2 8 ) Attackscontrasting

confidence: 50%

“…No effective guess-and-determine attack strategy was found, but some preliminary results were determined. We found evidence that the results in [5] and [6] are very inaccurate. This casts serious doubt about the their theoretical analysis and the previous analysis they relied on.…”

Section: Introductionmentioning

confidence: 71%

“…Thus, we have attempted to attack it with algebraic attacks over GF (2). Wen Ji and Lei Hu have also attempted to attack SMS4 with an algebraic attack over both GF (2) and GF (2 8 ), as shown in [5] and [6], but their papers present only theoretical results, not any experimental results. We have found our experimental results contradictory to their analysis.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared

Erickson

Ding

Christensen

2010

Information, Security and Cryptology – ICISC 2009

View full text Add to dashboard Cite

Abstract. The SMS4 block cipher is part of the Chinese WAPI wireless standard. This paper describes the specification and offers a specification for a toy version called simplified SMS4 (S-SMS4). We explore algebraic attacks on SMS4 and S-SMS4 using Gröbner basis attacks on equation systems over GF(2) and GF(2 8 ), as well as attacks using a SAT solver derived from the GF(2) model. A comparison of SAT and Gröbner basis attacks is provided.

show abstract

Section: Conclusion and Discussioncontrasting

confidence: 56%

Section: Gf(2 8 ) Attackscontrasting

confidence: 50%

Section: Introductionmentioning

confidence: 71%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared

Erickson

Ding

Christensen

2010

Information, Security and Cryptology – ICISC 2009

View full text Add to dashboard Cite

show abstract

“…Ji et al [20] examined algebraic attacks against SM4 and compared the resistances of SM4 with that of AES. Their result indicate that SM4 seems stronger than AES.…”

Section: Related Workmentioning

confidence: 99%

On the Design and Performance of Chinese OSCCA-approved Cryptographic Algorithms

Martinkauppi

Qiu-ping

Ilie

2020

2020 13th International Conference on Communications (COMM)

View full text Add to dashboard Cite

SM2, SM3, and SM4 are cryptographic standards authorized to be used in China. To comply with Chinese cryptography laws, standard cryptographic algorithms in products targeting the Chinese market may need to be replaced with the algorithms mentioned above. It is important to know beforehand if the replaced algorithms impact performance. Bad performance may degrade user experience and increase future system costs.We present a performance study of the standard cryptographic algorithms (RSA, ECDSA, SHA-256, and AES-128) and corresponding Chinese cryptographic algorithms.Our results indicate that the digital signature algorithms SM2 and ECDSA have similar design and also similar performance. SM2 and RSA have fundamentally different designs. SM2 performs better than RSA when generating keys and signatures. Hash algorithms SM3 and SHA-256 have many design similarities, but SHA-256 performs slightly better than SM3. AES-128 and SM4 share some similarities in the design. In the controlled experiment, AES-128 outperforms SM4 with a significant margin.

show abstract

Enhanced Differential Cache Attacks on SM4 with Algebraic Analysis and Error-Tolerance

Lou

Zhang

et al. 2020

Information Security and Cryptology

View full text Add to dashboard Cite

Algebraic Attack to SMS4 and the Comparison with AES

Cited by 8 publications

References 3 publications

Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared

Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared

On the Design and Performance of Chinese OSCCA-approved Cryptographic Algorithms

Enhanced Differential Cache Attacks on SM4 with Algebraic Analysis and Error-Tolerance

Contact Info

Product

Resources

About