Discrete logarithm hash function that is collision free and one way

1 January 1991

journal article
Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques

Vol. 138 (6) , 407-410
https://doi.org/10.1049/ip-e.1991.0056

Abstract

For suitable composite modulus n and suitable base a, the discrete logarithm hash function x → a^x 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

HASH FUNCTION
DISCRETE LOGARITHM
COMPLEXITY THEORY

This publication has 0 references indexed in Scilit: