Finding discrete logarithms with a set orbit distinguisher
We consider finding discrete logarithms in a group of prime order p when the help of an algorithm D that distinguishes certain subsets of from each other is available. If the complexity of D is a polynomial, say , then we can find discrete logarithms faster than square-root algorithms. We consider...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2012-06-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2012-0002 |