Papers by rajaram ramasamy
ijns.femto.com.tw
Yang-Wang-Chang proposed an improved timestamp associated password authentication scheme based on... more Yang-Wang-Chang proposed an improved timestamp associated password authentication scheme based on Yang-Shieh, who had earlier proposed timestamp-based remote authentication scheme using smart cards. In this paper, we propose an efficient ...
Int. J. Netw. Secur., 2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is appl... more Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost is based on how it works with minimum use of scarce resources like processor and memory We have implemented the determination of the multiplicative in-verse of a polynomial over GF(2(superscript p)) with minimum computational cost. The ”Extended Euclidean Algorithm” (EEA) has been demonstrated to work very well manually for integers and polynomials. However polynomial manipulation cannot be computerized directly. We have implemented the same by using simple bit wise shift and XOR operations. In small applications like smart cards, mo-bile devices and other small memory devices, this method works very well. To the best of our knowledge, the pro-posed algorithm seems to be the first, efficient and cost effective implementation of determining the multiplicative inverse of polynomials over GF(2(superscript p)) ...
Communications in Computer and Information Science, 2010
User authentication is a continual problem, particularly with mobile and handheld devices such as... more User authentication is a continual problem, particularly with mobile and handheld devices such as Personal Digital Assistants (PDAs), Smartcard, Laptops. User authentication is a difficult for every system providing safe access to precious, private information, or personalized services. User authentication is the primary line of defence for a handheld device that comes into the hands of an unauthorized individual. Password or Personal Identification Number (PIN) based authentication is the leading mechanism for verifying the identity of actual device users. Remote mutual authentication is the best solution for remote accessing in Wi-Fi environment. In this paper we propose a new remote mutual authentication scheme in wireless environment without maintaining the password table. This is based on ElGamal's. It provides high security and mutual authentication at a reasonable computational cost. Furthermore it restricts most of the current attacking mechanisms. It is simple and can be adopted in any kind of lightweight devices.
Password based remote authentication scheme using ECC for smart card
Proceedings of the 2011 International Conference on Communication, Computing & Security - ICCCS '11, 2011
... To add to the woes, the current Internet is vulnerable to various attacks such as denial of s... more ... To add to the woes, the current Internet is vulnerable to various attacks such as denial of service attack, forgery attack, forward secrecy attack, server ... YoonRyuYoo[22] citing Awasthi Lal [14] proposed a hash based authentication scheme based on the work of Chien et.al[11]. ...
Computer Standards & Interfaces, 2009
This paper proposes a novel scheme where the key k is generated as discrete logarithm of indices ... more This paper proposes a novel scheme where the key k is generated as discrete logarithm of indices involving prime modulus p and any base value q. This base value q is an element of Z p. The Discrete logarithm values are substituted for k in the encryption equation. During decryption the corresponding k's are used to recover the plaintext. The sender embeds the p, q values along with the encrypted message and transmits it. This obviates the need for sending the full-length key along with the encrypted message. The proposed method ensures higher security in the transmission. The strength of the method lies in the difficulty of guessing p, q values, the entire key need not be transmitted and the full set of ASCII values of the Z 256 plane figure in the encryption process. The paper also discusses the difficulty of attempting brute force technique to discover p, q values. As an extension of this work, the authors are exploring the possibility of using the full set of UNICODE values instead of the restricted 8-bit ASCII set.
International Journal of Network Security, 2009
Elliptic Curve Cryptography provides a secure means of exchanging keys among communicating hosts ... more Elliptic Curve Cryptography provides a secure means of exchanging keys among communicating hosts using the Diffie Hellman Key Exchange algorithm. Encryption and Decryption of texts and messages have also been attempted. This paper presents the implementation of ECC by first transforming the message into an affine point on the EC, and then applying the knapsack algorithm on ECC encrypted message over the finite field GF(p). In ECC we normally start with an affine point called P m (x,y). This point lies on the elliptic curve. In this paper we have illustrated encryption/decryption involving the ASCII value of the characters constituting the message, and then subjecting it to the knapsack algorithm. We compare our proposed algorithm with RSA algorithm and show that our algorithm is better due to the high degree of sophistication and complexity involved. It is almost infeasible to attempt a brute force attack. Moreover only one parameter, namely the Knapsack vector ai alone needs to be kept secret. On the contrary in RSA, three parameters such as the modulus n, its factors p and q need to be kept secret.
This paper evolves an algorithm for encrypting and decrypting textual messages for transmission o... more This paper evolves an algorithm for encrypting and decrypting textual messages for transmission over an unsecured channel. The algorithm is based on the selection of a prime integer depending upon the size of the message. Then all its 'generators' or primitive roots are identified. The primitive roots are used for generating the elements for calculating the keys. Key generation follows a particular strategy, on a per-arranged manner. The message constituting the alphanumeric string of characters is permuted by 1-level railway fence. The cipher text is determined by XORing the ASCII decimal value of the message character with its corresponding key, expressed in ASCII decimal. Select bits of the cipher text, are flipped. The enciphered text is then transmitted to the receiver. The prime integer and the primitive roots needed for key generation are transmitted to the receiver in a separate message. Upon receiving the cipher-text and the key generation generation parameters, the receiver reverses the whole sequence of operations to recover the plain-text. The algorithm scrambles the message during transmission through unsecured channels, and also safeguards data stored in the cloud. Applying 3 strategies for encryption/decryption is attempted for the first time, hence no comparison is attempted with prior works with regard to efficiency or versatility.
Uploads
Papers by rajaram ramasamy