On Using Mersenne Primes in Designing Cryptoschemes
Moldovyan Alexander Andreevich, Moldovyan Nikolay Andreevich, Berezin Andrey Nickolaevich · International journal of network security · 2016
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 example s=1279, s=2203, and s=4253.