Analysis of hash functions for digital signature schemes.

详细信息   

• 作者：Dorta Gonzalez ; Maria Isabel.
• 学历：Doctor
• 年：1999
• 导师：Gil, Pino Caballero
• 毕业院校：Universidad de La Laguna
• 专业：Computer Science.
• ISBN：9780496080649
• CBH：3148050
• Country：Spain
• 语种：English
• FileSize：9595163
• Pages：168

文摘

The security of unkeyed hash functions and some digital signature schemes is considered. There are some possible attacks against different kinds of hash functions, depending on the information available to the enemy, the final objective and the attacked property. Attacks based on a set of known used signatures are studied. Concretely, the birthday attack is a general method against authentication schemes, even if hash function is applied to encrypted data or is evaluated under the control of a private key. The birthday attack, which can be launched against any hashing scheme, compares two groups of hash values, which are fraudulent variations and no fraudulent variations on the message, until finding a pair of messages (x, x') with the same hash value being each one in a group. The exact success probabilities in the birthday attack on hash functions are calculated and analysed.;The unsuccessful efforts of many researchers who spent their time trying to design practical hash schemes suggest that we should work on some guidelines principles for the design of hash functions, instead of proposing just another function which temporarily would seen secure. Some fundamental requirement are developed in this memory, which should be verified in the design of secure hash schemes.