4 ms·
In public key cryptography ,we use ramanujan's theory about prime numbers to calculate large prime numbers.The fastest algorithm known is based on his work. h
by nodemaker 15y ago
In public key cryptography ,we use ramanujan's theory about
prime numbers to calculate large prime numbers.The fastest algorithm known is based on his work.
http://en.wikipedia.org/wiki/Ramanujan_prime http://en.wikipedia.org/wiki/Ramanujan_prime