Autorenfreundlich Bücher kaufen?!
Beschreibung
The Discrete Logarithm Problem (DLP) plays an important role in the field of cryptography, and it has been a subject of in-depth research among cryptographers and mathematicians in recent times because of its computational difficulty. This work provides a short survey of the DLP and the Baby-step Giant-step (BSGS) method for solving this problem. In this paper, the BSGS method was implemented to verify and analyse its computational complexity using the C programming language and General Multiple Precision Arithmetic Library (GNU MP). Furthermore, the computation time was calculated for instances of up to 45-bit size.
Daniel Shank's Baby-Step-Giant Step Algorithm
Details
| Verlag | AV Akademikerverlag |
| Ersterscheinung | 03. September 2018 |
| Maße | 22 cm x 15 cm x 0.4 cm |
| Gewicht | 96 Gramm |
| Format | Softcover |
| ISBN-13 | 9786202216807 |
| Seiten | 52 |
Schlagwörter
Bekannt durch
