Title :
Discrete logarithm hash function that is collision free and one way
Author_Institution :
Dept. of Comput. Sci., Birbeck Coll., London, UK
fDate :
11/1/1991 12:00:00 AM
Abstract :
For suitable composite modulus n and suitable base a, the discrete logarithm hash function x to ax mod n is collision free and one way if factoring n is hard. Further results on the relation between the discrete logarithm problem and factoring are given. Some complexity theory issues are considered.
Keywords :
computational complexity; cryptography; number theory; complexity theory; discrete logarithm; hash function;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings E
