Results

**1 - 5**of**5**### Article Improving Classical Authentication over a Quantum Channel

, 2012

"... entropy ..."

(Show Context)
### unknown title

"... Comentários sobre a segurança do protocolo hı́brido de autenticação quântica de mensagens clássicas ..."

Abstract
- Add to MetaCart

(Show Context)
Comentários sobre a segurança do protocolo hı́brido de autenticação quântica de mensagens clássicas

### Quantum Authentication of Classical Messages with Perfect Security

, 2008

"... In this work we have investigated how quantum resources can improve the security of protocol for authentication of classical messages, introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authenticat ..."

Abstract
- Add to MetaCart

(Show Context)
In this work we have investigated how quantum resources can improve the security of protocol for authentication of classical messages, introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We have started by showing that a BB84-type encoding of secret bits offers more security than the classicalXOR function introduced by Brassard. Furthermore, we established the conditions a general PRG must satisfy for our quantum-enhanced protocol to yield informationtheoretical security. Altogether, our proposal represents a twofold improvement: first it offers proven information-theoretical security under some assumptions on the PRG; secondly, these assumptions are weaker than the requirements for the PRG in Brassard’s protocol. Additionally, our proposal is also more practical in the sense that it requires a shorter key than the classical scheme by using the pseudorandom bits to choose the tag’s hash function. 1

### True Random Number Generators

"... Abstract Random numbers are needed in many areas: cryptography, Monte Carlo computation and simulation, industrial testing and labeling, hazard games, gam-bling, etc. Our assumption has been that random numbers cannot be computed; because digital computers operate deterministically, they cannot prod ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract Random numbers are needed in many areas: cryptography, Monte Carlo computation and simulation, industrial testing and labeling, hazard games, gam-bling, etc. Our assumption has been that random numbers cannot be computed; because digital computers operate deterministically, they cannot produce random numbers. Instead, random numbers are best obtained using physical (true) random number generators (TRNG), which operate by measuring a well-controlled and specially prepared physical process. Randomness of a TRNG can be precisely, scientifically characterized and measured. Especially valuable are the information-theoretic provable random number generators (RNGs), which, at the state of the art, seem to be possible only by exploiting randomness inherent to certain quantum systems. On the other hand, current industry standards dictate the use of RNGs based on free-running oscillators (FRO) whose randomness is derived from electronic noise present in logic circuits and which cannot be strictly proven as uniformly random, but offer easier technological realization. The FRO approach is currently used in 3rd- and 4th-generation FPGA and ASIC hardware, unsuitable for realization of quantum RNGs. In this chapter we compare weak and strong aspects of the two approaches. Finally, we discuss several examples where use of a true RNG is critical and show how it can significantly improve security of cryptographic systems, and discuss industrial and research challenges that prevent widespread use of TRNGs.