Randomness in Cryptography
Randomness in Cryptography :
- System designers are typically more concerned with the power consumption and bit generation speed, than with the actual randomness of the bits generated
- cryptographic systems, the quality of the random numbers used directly determines the security strength of the system.
- the quality of the random number generator directly influences how difficult it is to attack the system
- modern cryptographic algorithms and protocols are designed around a well-known principle by Kerckhoff, which roughly translates into the statement that "The security of the system must depend solely on the key material, and not on the design of the system."
- This means that all modern security algorithms and protocols have their ‘cryptographic strength’ expressed in the number of (key) bits that an attacker needs to guess before he can break the system1 . This expression of strength implicitly assumes that the attacker has no knowledge of the bits of the original key used. The ‘effective strength’ of an algorithm is diminished when better attacks against it are found a
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment