Quantum Computer-Resistant Electronic Signature Generation Using Gaussian Prime Numbers

The use of electronic signature is one of the most widely used tools in the public and private sectors. Ownership and verification of the produced documents are mostly done by electronic signing. Signing algorithms utilized today are produced with the RSA algorithm or its derivatives. Classically generated digital signatures are produced utilizing very large prime numbers, open switching technologies, and modular mathematics. Many different algorithms are used in the generation of numbers ionosonde. In this study, we aim to produce electronic signatures and certificates by employing Gaussian prime numbers (GPN). The novel method considered within the scope of this study is the realization of quantum digital signature generation employing GPN to produce a common digital signature used by classical computers and quantum computers. The produced signing algorithm can be used for classical computers and quantum computers. It is foreseen that the proposed method will be both resistant to quantum computers and increase security in classical computers. The proposed method aims to maximize the security level of digital signature processes. Thus, the common use of classical and quantum computers is expected to provide an advantage in the science of cryptology in storing, securely sharing, and transferring information.