We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize an extensive speedup in modular addition and subtraction routines and some small speedup in the modular multiplication routine with an arbitrary prime modulus p which...
Authentication protocols play important roles in network security. A variety of authentication protocols ranging from complex public-key cryptosystems to simple password-based authentication schemes have been proposed. However, currently there is no fully secure authentication scheme that can resist all known attacks. When a user authentication is performed over an insecure...
The Elliptic Curve Digital Signature Algorithm (ECDSA) is a public key cryptosystem used for creation and verification of digital signatures in electronic documents. In this thesis, we created a Java applet that provides the functionality of the ECDSA using all of the NIST elliptic curves over GF(p). This applet was...
In recent years, the elliptic curve cryptosystems (ECC) have received attention
due to their increased security with smaller key size which brings the advantage of less
storage area and less bandwidth. Elliptic curve cryptography provides a methodology
for obtaining high-speed, efficient, and scalable implementations of network security
protocols. In addition...
During the last few years we have seen formidable advances in digital and mobile
communication technologies such as cordless and cellular telephones, personal
communication systems, Internet connection expansion, etc. The vast majority
of digital information used in all these applications is stored and also processed
within a computer system, and...