The need for secure communication is as old as we can recall. The first cryptographic device used by the Spartans is dated circa 600 BC. Cryptography is the science of encoding a message, containing confidential information, so that only the recipient can read it. Over the years, various techniques have been developed to encode messages. One example is the famous ENIGMA cipher used during the Second World War and cracked by a team of researchers leaded by Alan Turing. The only encryption method providing unconditional security is the one-time-pad(OTP) proposed by Gilbert Vernam. Its implementation requires i) sender and receiver to share a common cryptographic key and ii) the key must be as long as the message itself. The OTP method is, unfortunately, hard to implement because of the difficulty in generating long keys and distribute them.

Nowadays, practical implementations of secure communication are based on public-key encryption techniques, which are based on the difficulty to solve special mathematical problems and therefore the decryption of encrypted data would take longer than the time the contained information is of value. The most famous implementation is the RSA (Rivest, Shamir, Adleman) crypto-system which uses the difficulty of decomposing a large number into its prime factors.

The advent of working quantum computers poses a serious threat to current encryption methods, e.g. the implementation of Shor algorithm could render RSA useless in a really short time. This has inevitably led us to look for alternative ways to encrypt data with a higher degree of security. Provable secure crypto-systems (e.g. OTP) rely on the sharing of a secret key between the sender and receiver to encrypt messages.

Quantum cryptography provides a way to share a secret key between two parties securely and to know that no one has intercepted it along the way. This is guaranteed by the no-cloning theorem, which formalize that arbitrary unknown quantum state cannot be perfectly copied. When it comes to quantum cryptography, it usually has to do with Alice (A) and Bob (B) whishing to exchange private information, while the eavesdropper Eve (E) is trying to steal the message without being discovered. The main goal of quantum cryptography is to provide a method to detect Eve’s activity.

In 1984 the seminal work of Bennett and Brassard (BB84) paved the way to practical implementation of Quantum Key Distribution (QKD), which has then been widely studied and improved over the years. The traditional implementation of the BB84 protocol requires Alice to use four non-orthogonal quantum states (e.g. different polarisations of a photon) randomly selected from two bases ({H,V}, {D,A}). A sufficiently long sequence (i.e. more than twice the amount of bits the resulting key should have) of these random states is sent on a quantum channel that Bob detects using one of the two bases in a random manner. Using the public channel, Bob and Alice compare the used bases without revealing the results, identify the coincident bases (sifting) and estimate the quantum bit error rate (QBER) of the detected values compared to the values sent by Alice. Owing to the non-cloning theorem, any operation performed by Eve along the quantum channel results in an increase of the QBER.

In general, QKD is combined with conventional encryption systems, such as AES, where the generated QKD key is used by Alice and Bob to generate temporary session key with AES, to encrypt their messages over Ethernet until it expires.

QRNG is a fundamental component of a QKD system. It exploits quantum physics principles to generate true unpredictable bits used for the secret keys, which are then transmitted according to the selected QKD protocol. Unpredictability means that knowing the generation principle and the state of the device in any point in time, you are still unable to predict anything about the next produced random number.

At Quside we have developed a QRNG product family, based on our proprietary photonic integrated chip (PIC) technology to reach scalable and affordable quantum-security today. Our solutions allow using standard electronic components and manufacturing processes which assure cost-effectiveness and industrial scaling-up. Moreover, its high speed (multiple Gb/s) and available sizes make it suitable for any market.

What is quantum key distribution technology?

Quantum key distribution (QKD) is a quantum primitive which enables two trusted users to produce and share keys to encrypt (decrypt) messages in a secure way. The communication method relies on the laws of quantum mechanics to bound the information exchanged between the users that a potential eavesdropper can access.

Is it useful?

Is quantum key distribution being used?

Since the seminal work of Bennett and Brassard, many experiment have been carried out on QKD[1]. Companies such as ID Quantique, Toshiba, QuintessenceLabs, MagiQ Technologies Inc., LuxQuanta are offering commercial QKD systems.

[1] Martin V, Martinez-Mateo J, Peev M. Quantum key distribution. In: Wiley encyclopedia of electrical and electronics engineering. New York: Wiley; 2017. p. 1–17

Is it useful?

Is quantum key distribution secure?

QKD offers information-theoretic security (ITS), meaning that the vulnerability of the generated key to attacks depends on the protocol implementation and does not require any assumptions on the resources available to an adversary. This property is fundamental to provide long-term security and to avoid harvest now, decrypt later attacks. Nevertheless, practical QKD implementationscan suffer from security vulnerabilities (side channel attacks) if deviate significantly from the ideal models.

Is it useful?

What is the difference between quantum cryptography and quantum key distribution?

Quantum cryptography is an approach that exploits the properties of quantum mechanics to perform cryptographic tasks. Quantum key distribution (QKD) is a part of quantum cryptography (probably the best known) as are other applications such as quantum random number generation, secure two- and multi-party computation and quantum computation[1].

[1] Broadbent, A., Schaffner, C. Quantum cryptography beyond quantum key distribution. Des. Codes Cryptogr. 78, 351–382 (2016)

Is it useful?

How do quantum keys work?

Quantum random number generators exploit quantum phenomena to produce random bits that form the keys used for cryptographic tasks such as encryption, authentication, signing and more. Quside QRNGs deliver high-quality, unpredictable random numbers with measurable entropy to ensure the strongest level of security for any application.

Is it useful?