Research Article
Pollard RHO Algorithm for Integer Factorization and Discrete Logarithm Problem
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 121 - Issue 18 |
| Published: July 2015 |
| Authors: Nagaratna Hegde, P.Deepthi |
10.5120/21639-4969
|
Nagaratna Hegde, P.Deepthi . Pollard RHO Algorithm for Integer Factorization and Discrete Logarithm Problem. International Journal of Computer Applications. 121, 18 (July 2015), 14-17. DOI=10.5120/21639-4969
@article{ 10.5120/21639-4969,
author = { Nagaratna Hegde,P.Deepthi },
title = { Pollard RHO Algorithm for Integer Factorization and Discrete Logarithm Problem },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 121 },
number = { 18 },
pages = { 14-17 },
doi = { 10.5120/21639-4969 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A Nagaratna Hegde
%A P.Deepthi
%T Pollard RHO Algorithm for Integer Factorization and Discrete Logarithm Problem%T
%J International Journal of Computer Applications
%V 121
%N 18
%P 14-17
%R 10.5120/21639-4969
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Security is must everywhere. We have to secure our data at all places like online banking, e-commerce etc. , Cryptography doesn't have to be so cryptic. AES, DES, RSA, ECC -- there are so many ways to encrypt our data. Example: company's protecting customer credit card information, securing remote user connections to our network or protecting our intellectual property from digital piracy, we're using encryption every day. In 1980s, there was only one real choice -- the Data Encryption Standard (DES). Today, we have a broad selection of stronger, faster and better-designed algorithms. Now, the problem is to sort out which algorithm to be used. Elliptic curve cryptography (ECC) is one of the most powerful but least understood types of cryptography in wide use today. An increasing number of websites make extensive use of ECC to secure everything from customers HTTPS connections to how they pass data between data centers. So, it's important for end users to understand the technology behind any security system in order to trust it.
References
- The Discrete Logarithm Problem. Available online: http://modular. math. washington. edu/edu/124/lectures/lecture8/html/node5. html
- G Wojtenko, "Statistical properties of ECC-point and its impact on ECDLP", https://eprint. iacr. org/2007/092. pdf
- Mandy Zandra Seet, "ELLIPTIC CURVE CRYPTOGRAPHY Improving the Pollard-Rho Algorithm", https://www. maths. unsw. edu. au/sites/default/files/mandyseetthesis. pdf
- Pollard's rho algorithm. Available online: http://en. wikipedia. org/wiki/Pollard_rho_algorithm
- Factoing Large Numbers, A Great Way to Spend a Birthday. Available online: http://www4. ncsu. edu/lrbosko/Publications/Rho. pdf
- Connelly Barnes "Integer Factorization Algorithms" http://www. connellybarnes. com/documents/factoring. pdf
- Pollard rho Factorization Method. Available online: http://mathworld. wolfram. com/PollardRhoFactorizationMethod. html
- Computational Number Theory and Algebra. Available online: http://people. mpi-inf. mpg. de/~csaha/lectures/lec18. pdf
- A Quick Tutorial on Pollard's Rho Algorithm. http://www. cs. colorado. edu/srirams/classes/doku. php/pollard_rho_tutorial
- ELLIPTIC CURVE CRYPTOGRAPHY (ECC) https://www. certicom. com/ecc
- Nick Sullivan, "A (relatively easy to understand) primer on elliptic curve cryptography", http://arstechnica. com/security/2013/10/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/
Index Terms
Keywords