Discrete Logarithm Cryptography
The security of many cryptographic schemes relies on the intractability of the discrete logarithm problem (DLP) in groups. The most commonly used groups to deploy such schemes are the multiplicative (sub)groups of finite fields and (hyper)elliptic curve groups over finite fields. The elements of the...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/5088 |