CRYPTOSCHEME DESIGN BASED ON THE PROBLEM OF DISCRETE LOGARITHM MODULO A NUMBER DIFFICULT FOR FACTORING
In order to improve security, a justification have been given for designing the public-key algorithms and protocols based on difficulty of finding discrete logarithm modulo in case of using a composite number that is difficult for factoring. It is proposed to use the product of two strong primes as the modulo, with their sizes relation 2:1. This approach provides an alternative solution for construction of the cryptoschemes, based on difficulty of simultaneous solving both the discrete logarithm modulo prime problem and the factoring problem. The approach provides reducing the signature size in digital signature protocols and increasing the rate of the cryptoschemes.
Authors: A. N. Berezin, N. A. Moldovyan
Direction: Informatics, management and Computer Technology
Keywords: Cryptographic protocol, digital signature, blind collective signature, factoring problem, discrete logarithm problem, public key
View full article