Birthday Attack on Cryptography Applications
| Author(s) | : | Keyur Patel, Digvijaysinh Mahida |
| Institution | : | Asst. Prof. Department of Information Technology, Sigma Institute of Engineering |
| Published In | : | Vol. 4, Issue 13 — January 2017 |
| Page No. | : | - |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
In many network communications it is crucial to be able to authenticate both the contents and the origin of a message.This paper will study in detail the problem known in probability theory as the Birthday Paradox (or the Birthday problem), as well asits implications and different related aspects we consider relevant. The Birthday attack makes use of what’s known as theBirthday paradox to try to attack cryptographic hash functions. Among other desirable properties of hash functions, an interestingone is that it should be collision-resistant, that is it should be difficult to find two messages with the same hash value. To find acollision the birthday attack is used, which shows that attacker may not need to examine too many messages before he finds acollision. The purpose of this paper is thus to give the reader a general overview of the general aspects and applications of theBirthday Paradox.
Keyur Patel, Digvijaysinh Mahida, “Birthday Attack on Cryptography Applications”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 13, pp. -, January 2017.
