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:
Main Author: | Loo, Jia Ein |
---|---|
Other Authors: | Tay Kian Boon |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/166054 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Analysis of algorithms to solve the discrete logarithm problem
by: Sim, Ernest Zi-En
Published: (2024) -
Development of discrete differential evolution algorithm for solving traffic light scheduling problem
by: Shu, Wei Hua
Published: (2022) -
ANALYSIS OF NEW COLLISION POLLARD RHO METHOD IN SOLVING ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM
by: Made Sukrawan, I -
A selective-discrete particle swarm optimization algorithm for solving a class of orienteering problems
by: GUNAWAN, Aldy, et al.
Published: (2017) -
Parallel discrete geodesic algorithms
by: Du, Jie
Published: (2020)