97 citations · 315 across the 31 of their papers we have counts for
1 paper · 1 filter
Martin Schaffer, Stefan Rass
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. S…