Loading...
Please wait, while we are loading the content...
Similar Documents
Discrete Logarithms
| Content Provider | Scilit |
|---|---|
| Author | Guillevic, Aurore Morain, François |
| Copyright Year | 2017 |
| Description | The Discrete Logarithm Problem (DLP) is one of the most used mathematical problems in asymmetric cryptography design, the other one being the integer factorization. It is intrinsically related to the Diffie-Hellman problem (DHP). DLP can be stated in various groups. It must be hard in well-chosen groups, so that secure-enough cryptosystems can be built. In this chapter, we present the DLP, the various cryptographic problems based on it, the commonly used groups, and the major algorithms available at the moment to compute discrete logarithms in such groups. We also list the groups that must be avoided for security reasons. Book Name: Guide to Pairing-Based Cryptography |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2014-0-42945-2&isbn=9781315370170&doi=10.1201/9781315370170-9&format=pdf |
| DOI | 10.1201/9781315370170-9 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2017-01-06 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Guide To Pairing-based Cryptography Cryptography Cryptosystems Mathematical Integer |
| Content Type | Text |
| Resource Type | Chapter |
