Secure sharing of random bits over the Internet

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 3 figures. A single typo was corrected at the end of the manuscript: (K0/d)!-> K0!/d

Scientific paper

Although one-time pad encrypted files can be sent through Internet channels, the need for renewing shared secret keys have made this method unpractical. This work presents a scheme to turn practical the fast sharing of random keys over arbitrary Internet channels. Starting with a shared secret key sequence of length K_0 the users end up with a secure new sequence K >> K_0. Using these sequences for posteriori message encryption the legitimate users have absolute security control without the need for third parties. Additionally, the security level does not depend on the unproven difficulty of factoring numbers in primes. In the proposed scheme a fast optical random source generates random bits and noise for key renewals. The transmitted signals are recorded signals that carries both the random binary signals to be exchanged and physical noise that cannot be eliminated by the attacker. These signals allow amplification over the Internet network without degrading security. The proposed system is also secure against a-posteriori known-plaintext attack on the key. Information-theoretic analysis is presented and bounds for secure operation are quantitatively determined.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Secure sharing of random bits over the Internet 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 Secure sharing of random bits over the Internet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure sharing of random bits over the Internet will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-669566

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.