A Practical Cryptanalysis of WalnutDSA

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

162 Downloads (Pure)

Abstract

We present a practical cryptanalysis ofWalnutDSA, 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-MultiplicationTM 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.
Original languageEnglish
Title of host publicationProceedings of the 21st International Conference on Practice and Theory of Public Key Cryptography
EditorsMichel Abdalla, Ricardo Dahab
PublisherSpringer
Pages381-406
Number of pages27
VolumeVol 1
ISBN (Print)978-3-319-76577-8
DOIs
Publication statusPublished - 2018
Event21st International Conference on Practice and Theory of Public Key Cryptography - Rio de Janeiro, Brazil
Duration: 25 Mar 201828 Mar 2018

Publication series

NameLecture Notes in Computer Science
Volume10769
ISSN (Print)0302-9743

Conference

Conference21st International Conference on Practice and Theory of Public Key Cryptography
Country/TerritoryBrazil
CityRio de Janeiro
Period25/03/1828/03/18

Fingerprint

Dive into the research topics of 'A Practical Cryptanalysis of WalnutDSA'. Together they form a unique fingerprint.

Cite this