Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) (2005)
Sept. 25, 2005 to Sept. 29, 2005
Bogdan Groza , "Politehnica" University of Timisoara
Dorina Petrica , "Politehnica" University of Timisoara
Authentication protocols have applications in many fields. The security of authentication protocols is commonly based on cryptographic primitives. Constructing secure authentication protocols is not an easy challenge and there is a large number of authentication protocols that prove to be insecure. Wulf et al. have proposed in  a protocol by which an entity can authenticate in a distributed system environment without using any shared secret. This paper will make a brief analysis of the proposed protocol and will show how it can be broken. The protocol will be broken by using multiplicative inverses of the integers from Z_n , where n is a prime number.
B. Groza and D. Petrica, "Cryptanalysis of an Authentication Protocol," Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)(SYNASC), Timisoara, Romania, 2005, pp. 147-153.