A Practical Cryptanalysis of WalnutDSA

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

Authors

  • Daniel Hart
  • DoHoon Kim
  • Giacomo Micheli
  • Guillermo Pascual Perez
  • Yuxuan Quek

Colleges, School and Institutes

External organisations

  • University of Oxford

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.

Details

Original languageEnglish
Title of host publicationProceedings of the 21st International Conference on Practice and Theory of Public Key Cryptography
EditorsMichel Abdalla, Ricardo Dahab
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
CountryBrazil
CityRio de Janeiro
Period25/03/1828/03/18