Results 201 to 210 of about 559 (211)
Some of the next articles are maybe not open access.
Indiscreet discrete logarithms
2017In 2013 and 2014 a revolution took place in the understanding of the discrete logarithm problem (DLP) in finite fields of small characteristic. Consequently, many cryptosystems based on cryptographic pairings were rendered completely insecure, which serves as a valuable reminder that long-studied so-called hard problems may turn out to be far easier ...
openaire +1 more source
Generic Hardness of the Multiple Discrete Logarithm Problem
Lecture Notes in Computer Science, 2015exaly
Discrete logarithm hash function that is collision free and one way
IEE Proceedings E: Computers and Digital Techniques, 1991exaly