Paper 2017/1160 Original: eprint.iacr.org/2017/1160 ↗

A Practical Cryptanalysis of WalnutDSA

Daniel Hart
DoHoon Kim
Giacomo Micheli
Guillermo Pascual Perez
Christophe Petit
Yuxuan Quek
Abstract

We present a practical cryptanalysis of WalnutDSA, a digital signature algorithm trademarked by SecureRF. WalnutDSA uses techniques from permutation groups, matrix groups, and braid groups, and is designed to provide post-quantum security in lightweight IoT device contexts. The attack given in this paper bypasses the E-Multiplication and cloaked conjugacy search problems at the heart of the algorithm and forges signatures for arbitrary messages in approximately two minutes. We also discuss potential countermeasures to the attack.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2017-11-30: last updated
2017-11-30: published
Short URL
https://ia.cr/2017/1160
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2017/1160,
      author = {Daniel Hart and DoHoon Kim and Giacomo Micheli and Guillermo Pascual Perez and Christophe Petit and Yuxuan Quek},
      title = {A Practical Cryptanalysis of WalnutDSA},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/1160},
      year = {2017},
      url = {https://eprint.iacr.org/2017/1160}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.