Analysis on Sieve of Eratosthenes algorithm and algorithms for solving the discrete logarithm problem
This paper explores 3 problems, the Sieve of Eratosthenes, Discrete Logarithm Problem (DLP) and Integer Factorization. Prime numbers are essential to all cryptographic systems today. The Sieve of Eratosthenes is an algorithm used to find prime numbers up to a given limit. Using the basic version of...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/166054 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |