Towards cryptanalysis of prime numbers
Natural numbers that defy decomposition into factors lower than themselves provide the basis for entrenching security in the public key encryption world. A variant algorithm of trial division of sieve of Eratosthenes, with its digits split into two unequal components and whose growth centered on dis...
Saved in:
Main Authors: | Yusuf, B.K., Mahmood, A.K., Sulaiman, S. |
---|---|
Format: | Conference or Workshop Item |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010402964&doi=10.1109%2fICCOINS.2016.7783294&partnerID=40&md5=9a5816f163eb089ae455d994441f37a6 http://eprints.utp.edu.my/30500/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Cryptanalysis on prime power RSA modulus of the form N=prq
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2016) -
Cryptanalysis of RSA
by: Alshaikhli, Imad Fakhri Taha, et al.
Published: (2011) -
Prime number patterns
by: Koh, Kristal , Mel Ling
Published: (2008) -
Generation of Large Prime Numbers From a Sequence of Previous Prime Numbers
Published: (2012) -
Cryptanalysis in cryptographic algorithm design
by: Z'aba, Muhammad Reza, et al.
Published: (2006)