Share Email Print

Proceedings Paper

Providing variable levels of security in quantum cryptography
Author(s): Abhishek Parakh
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Quantum cryptography provides perfect secrecy if the key exchanged is used for one-time-pad encryption. However, this requires very long keys which are not practical in most scenarios. Further, the key exchange bit-rate for quantum key distribution is very low. Consequently, often quantum key distribution algorithms only exchange (128, 192 or 256 bit) AES keys and then AES is used for data encryption. While Grover's algorithm will force us to only use AES- 256 and does not pose a catastrophic failure to AES, AES does not provide provable security. In this paper, we discuss methods that provide provable security but at the same time the key lengths may be controlled to practical levels. Difficulty of breaking the cipher is directly proportional to the key length and depends on the specific algorithm employed. The key idea is that key lengths can be tweaked such that an acceptable and provable level of security is achieved and therefore the cipher is not reliant on any assumptions for security. The paper will discuss different ways of achieving the above goal.

Paper Details

Date Published: 18 September 2018
PDF: 8 pages
Proc. SPIE 10771, Quantum Communications and Quantum Imaging XVI, 107710R (18 September 2018); doi: 10.1117/12.2323204
Show Author Affiliations
Abhishek Parakh, Univ. of Nebraska at Omaha (United States)

Published in SPIE Proceedings Vol. 10771:
Quantum Communications and Quantum Imaging XVI
Ronald E. Meyers; Yanhua Shih; Keith S. Deacon, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?