Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications

Details Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications

2007-11-12

arxiv.org/abs/0711.1856v2

Computer Science

Cryptography and Security

5 pages, 4 figures

Scientific paper

This note considers reciprocal of primes in binary representation and shows
that the conjecture that 0s exceed 1s in most cases continues to hold for
primes less one million. The conjecture has also been tested for ternary
representation with similar results. Some applications of this result to
cryptography are discussed.

Affiliated with

Also associated with

No associations

Rating

Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269643