Results 1 
2 of
2
A stamped blind signature scheme based on elliptic curve discrete logarithm problem
 International Journal of Network Security
, 2012
"... Abstract Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collisionresistant cryptographic hash functions. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract Here we present a stamped blind digital signature scheme which is based on elliptic curve discrete logarithm problem and collisionresistant cryptographic hash functions.
On Using Mersenne Primes in Designing Cryptoschemes
"... Abstract The paper proposes justification of using Mersenne primes in the following cryptoschemes: commutative and publickey encryption algorithms and zeroknowledge protocol. The cryptoschemes are based on computational difficulty of finding discrete logarithm in the finite fields GF (2 s ), where ..."
Abstract
 Add to MetaCart
Abstract The paper proposes justification of using Mersenne primes in the following cryptoschemes: commutative and publickey encryption algorithms and zeroknowledge 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.