Search

AbstractAn algorithm is newly developed for keyed hash functions using Landau-Ramanujan constant. It is tested well for message authentication and digital signatures. The security analysis on this algorithm is compared with [1] and then the algorithm passes validation tests.

AbstractPrimitive polynomials are essential for designing LFSRs for stream ciphers. This paper proposes a new methodology of testing if a given polynomial over GF(2n) is primitive or not. This method can be extended to any higher degree nof a polynomial and is fast and efficient.

In this paper, two ECDSA (Elliptic Curve Digital Signature Algorithm) protocols are newly proposed for authentication. Each protocol describes the process of key generation, signature generation and signature verification. Two protocols described here are based on quadratic residue method and subgroup method. Both are used for authentication purpose. In each set up, complexities are involved in the process of signature generation and verification. Further, each one is different from DSA protocol.