Alexander Andreevich Moldovyan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The paper proposes justification of using Mersenne primes in the following cryptoschemes: commutative and public-key encryption algorithms and zero-knowledge protocol. The cryptoschemes are based on computational difficulty of finding discrete logarithm in the finite fields GF (2 s), where s is a sufficiently large prime such that 2 s−1 is also a prime, for(More)
  • 1