Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors introduce VSH-DL, a design based on exponentiation in DLP-based groups. In this article we explore a variant of VSH-DL that is based on cycloto...

This paper introduces mainly the concept of public key cryptosystem, whose security is based on double generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on double generalized discrete logarithm problem, provides more security because of double computation comparing with th...

How to design a blind signature based on the discrete logarithm for untraceability is still a field in need of cultivation. In this article, we shall propose a new blind signature based on the discrete logarithm problem.

Generally digital signature algorithms are based on a single hard problem like prime factorization problem, discrete logarithm problem, elliptic curve problem. If one finds solution of this single hard problem then these digital signature algorithms will no longer be secured and due to large computational power, this may be possible in future. There are many other algorithms which are based on ...