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.