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

doi:10.1007/978-3-030-01054-6_87

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 proceeding › Conference contribution › Research › peer-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 language	English
Title of host publication	Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1
Publisher	Springer-Verlag GmbH and Co. KG
Pages	1251-1258
Number of pages	8
ISBN (Print)	9783030010539
DOIs	https://doi.org/10.1007/978-3-030-01054-6_87
Publication status	Published - 1 Jan 2019
Event	Intelligent Systems Conference, IntelliSys 2018 - London, United Kingdom Duration: 6 Sep 2018 → 7 Sep 2018

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	868
ISSN (Print)	2194-5357

Conference

Conference	Intelligent Systems Conference, IntelliSys 2018
Country	United Kingdom
City	London
Period	06.09.2018 → 07.09.2018

Keywords

Blockchain
Digital signature
Public key
Quantum computer

Access to Document

10.1007/978-3-030-01054-6_87

Link to publication in Scopus

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

Zavalishina, E., Krendelev, S., Volkov, E., Permiashkin, D., & Gridin, D. (2019). Public key and digital signature for blockchain technology: Based on the complexity of solving a system of polynomial equations. In Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1 (pp. 1251-1258). (Advances in Intelligent Systems and Computing; Vol. 868). Springer-Verlag GmbH and Co. KG. https://doi.org/10.1007/978-3-030-01054-6_87

Zavalishina, Elena ; Krendelev, Sergey ; Volkov, Egor ; Permiashkin, Dmitry ; Gridin, Dmitry. / Public key and digital signature for blockchain technology : Based on the complexity of solving a system of polynomial equations. Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1. Springer-Verlag GmbH and Co. KG, 2019. pp. 1251-1258 (Advances in Intelligent Systems and Computing).

@inproceedings{e5785776bc3a43e5a0aff32e7baea90e,

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

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.",

keywords = "Blockchain, Digital signature, Public key, Quantum computer",

author = "Elena Zavalishina and Sergey Krendelev and Egor Volkov and Dmitry Permiashkin and Dmitry Gridin",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-01054-6_87",

language = "English",

isbn = "9783030010539",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer-Verlag GmbH and Co. KG",

pages = "1251--1258",

booktitle = "Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1",

address = "Germany",

note = "Intelligent Systems Conference, IntelliSys 2018 ; Conference date: 06-09-2018 Through 07-09-2018",

}

Zavalishina, E, Krendelev, S, Volkov, E, Permiashkin, D & Gridin, D 2019, Public key and digital signature for blockchain technology: Based on the complexity of solving a system of polynomial equations. in Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1. Advances in Intelligent Systems and Computing, vol. 868, Springer-Verlag GmbH and Co. KG, pp. 1251-1258, Intelligent Systems Conference, IntelliSys 2018, London, United Kingdom, 06.09.2018. https://doi.org/10.1007/978-3-030-01054-6_87

Public key and digital signature for blockchain technology : Based on the complexity of solving a system of polynomial equations. / Zavalishina, Elena; Krendelev, Sergey; Volkov, Egor; Permiashkin, Dmitry; Gridin, Dmitry.

Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1. Springer-Verlag GmbH and Co. KG, 2019. p. 1251-1258 (Advances in Intelligent Systems and Computing; Vol. 868).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Public key and digital signature for blockchain technology

T2 - Intelligent Systems Conference, IntelliSys 2018

AU - Zavalishina, Elena

AU - Krendelev, Sergey

AU - Volkov, Egor

AU - Permiashkin, Dmitry

AU - Gridin, Dmitry

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Blockchain

KW - Digital signature

KW - Public key

KW - Quantum computer

UR - http://www.scopus.com/inward/record.url?scp=85057082814&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-01054-6_87

DO - 10.1007/978-3-030-01054-6_87

M3 - Conference contribution

AN - SCOPUS:85057082814

SN - 9783030010539

T3 - Advances in Intelligent Systems and Computing

SP - 1251

EP - 1258

BT - Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1

PB - Springer-Verlag GmbH and Co. KG

Y2 - 6 September 2018 through 7 September 2018

ER -

Zavalishina E, Krendelev S, Volkov E, Permiashkin D, Gridin D. Public key and digital signature for blockchain technology: Based on the complexity of solving a system of polynomial equations. In Intelligent Systems and Applications - Proceedings of the 2018 Intelligent Systems Conference IntelliSys Volume 1. Springer-Verlag GmbH and Co. KG. 2019. p. 1251-1258. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-030-01054-6_87