We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ONE-TIME PADS WITHOUT PRIOR ENCOUNTER.
- Authors
NAGY, NAYA; AKL, SELIM G.
- Abstract
Using one-time pads is the only cryptographic solution that really ensures the secrecy of a transmitted message. The communicating parties have to meet in advance to establish the value of any one-time pad. This means that the two parties have to meet regularly to renew the batch of one-time pads they share. By contrast, we show that after developing a secret reading mask using any quantum key distribution algorithm, the two parties can communicate indefinitely by encrypting each of their messages with a one-time pad. The value of the one-time pad is quantum encrypted and transmitted prior to the transmission of the message itself.
- Subjects
CRYPTOGRAPHY; DATA encryption; CRYPTOGRAMS; CIPHERS; PUZZLES
- Publication
Parallel Processing Letters, 2010, Vol 20, Issue 3, p263
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626410000211