Public key and digital signature for blockchain technology: Based on the complexity of solving a system of polynomial equations

Elena Zavalishina, Sergey Krendelev, Egor Volkov, Dmitry Permiashkin, Dmitry Gridin

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

This article proposes the algorithm of generation of public key for digital signature. The algorithm is quantum-resistant because it uses the complexity of solving a system of polynomial equations. It is assumed that in this case a standard hash function is used for the digital signature implementation, which has 384-512 bit output. The digital signature that is formed in this way will allow the blockchain technology to be quantum-resistant.

Original languageEnglish
Title of host publicationIntelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1
PublisherSpringer-Verlag GmbH and Co. KG
Pages1251-1258
Number of pages8
ISBN (Print)9783030010539
DOIs
Publication statusPublished - 1 Jan 2019
EventIntelligent Systems Conference, IntelliSys 2018 - London, United Kingdom
Duration: 6 Sep 20187 Sep 2018

Publication series

NameAdvances in Intelligent Systems and Computing
Volume868
ISSN (Print)2194-5357

Conference

ConferenceIntelligent Systems Conference, IntelliSys 2018
CountryUnited Kingdom
CityLondon
Period06.09.201807.09.2018

Keywords

  • Blockchain
  • Digital signature
  • Public key
  • Quantum computer

Fingerprint Dive into the research topics of 'Public key and digital signature for blockchain technology: Based on the complexity of solving a system of polynomial equations'. Together they form a unique fingerprint.

Cite this