Gnanajeyaraman Rajaram

Publications

• Performance and Analysis of Prioritization Security for Input-Queued Packet Switches

  Gnanajeyaraman Rajaram

  International Conference on Nanoelectronics; 01/2011

  assigned a separate queue for each class. We focus on the possibility of assuring QoS of multimedia traffic in such switches by implementing traffic prioritization at the input port where each input-queue has been modified to provide a separate buffer for each of the service classes. We select appro... [more] assigned a separate queue for each class. We focus on the possibility of assuring QoS of multimedia traffic in such switches by implementing traffic prioritization at the input port where each input-queue has been modified to provide a separate buffer for each of the service classes. We select appropriate models for each of three types of traffic: video, voice, and data. Then, we propose an efficient dynamic scheduling strategy by implementing multimedia traffic prioritization at the input port of input-queued packet switches. Simulation-based comparisons show that while the static priority scheme is beneficial for highest priority class at the expense of the others, the dynamic prioritization serves fairly well all the classes in terms of delay and loss requirements.

  Download

• Chaos Function Based - Secure Deniable Authentication Protocol

  Gnanajeyaraman Rajaram

  International Journal of Computer Applications in Engineering Sciences (IJCAES) (An International, Multidisciplinary, Quarterly Published Journal). 01/2011; Volume I:32-36.

  Deniability is defined as a privacy property which enables protocol principals to deny their involvement after they had taken part in a particular protocol run. This paper demonstrates that Yoon & Yoo’s scheme is insecure to a Key-Compromise Impersonation (KCI) attack and Replay attack. Based on... [more] Deniability is defined as a privacy property which enables protocol principals to deny their involvement after they had taken part in a particular protocol run. This paper demonstrates that Yoon & Yoo’s scheme is insecure to a Key-Compromise Impersonation (KCI) attack and Replay attack. Based on this, propose an Enhanced Scheme which preserves the authenticity, deniability and resistance against the KCI attack ing Chaos function f(x) = 4 * x * (1-x) and Replay attacking Timestamp. This paper demonstrates that Yoon and Yoo’s scheme “Secure Deniable Authentication Protocol Based on ElGamal Cryptography” is sceptible to KCI attack and replay attack. To mitigate this security breach, propose an improved deniable authentication protocol based on Chaos Function and ElGamal Cryptography. proposed Deniable Authentication Protocol for Micro Payment and Macro Payment in E-Commerce applications.

• Detection and Classification of Network Intrusion Using ILACR

  Gnanajeyaraman Rajaram

  International Journal of Computing Technology and Information Security. 01/2011; Vol.1 , No.1,(ISSN: 2231-1998):pp.62-75.

  The frequent changes in network environments, managing and updating the rule- based system has become a very challenging task for the administrator. Usually, rule- based systems work to make sense of a huge amount of alerts generated by the intrusion detection systems (IDSs) every minute. Intrusion ... [more] The frequent changes in network environments, managing and updating the rule- based system has become a very challenging task for the administrator. Usually, rule- based systems work to make sense of a huge amount of alerts generated by the intrusion detection systems (IDSs) every minute. Intrusion detection faces a number of challenges; an intrusion detection system must reliably detect malicious activities in a network and must perform efficiently to cope with the large amount of network traffic. In this paper, we address these two issues of Accuracy and Efficiency using Conditional Random Fields and Integrated Layered Approach [ILACR]. We demonstrate that high attack detection accuracy can be achieved by using Conditional Random Fields and high efficiency by implementing the Integrated Layered Approach. Finally, we show that our system is robust and is able to handle noisy data without compromising performance.

• DISTRIBUTED ADHOC NETWORKS BASED ON SELF-PRUNING USING BROADCASTING ALGORITHMS

  Gnanajeyaraman Rajaram

  International Conference On Recent Advances In e-Communication and i-Technologies (REACT-10); 01/2010

  This paper presents two efficient broadcasting algorithms based on 1-hop neighbour information. In this paper, proposed a sender-based broadcasting algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O log n log ... [more] This paper presents two efficient broadcasting algorithms based on 1-hop neighbour information. In this paper, proposed a sender-based broadcasting algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O log n log nÞ, where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based broadcasting algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O Log n Þ. In Liu et al.’s algorithm nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. We propose a simple and highly efficient receiver-based broadcasting algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases.

  Download

• Security Algorithm for Cryptosystems chaotic map

  Gnanajeyaraman

  Global Journal of Computer Science and Technology, Vol 9, No 5 (2010). 01/2010; 9(5):51-54.

  In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudo-randomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos, or audio data. This paper prop... [more] In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudo-randomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos, or audio data. This paper propose a novel higher dimensional chaotic system for audio encryption, in which variables are treated as encryption keys in order to achieve secure transmission of audio signals. Since the highly sensitive to the initial condition of a system and to the variation of a parameter, and chaotic trajectory is so unpredictable. As a result, we obtain much higher security. The higher dimensional of the algorithm is used to enhance the key space and security of the algorithm. The security analysis of the algorithm is given. The experiments show that the algorithm has the characteristic of sensitive to initial condition, high key space; digital audio signal distribution uniformity and the algorithm will not break in chosen/known-plaintext attacks.

  Download

• Diagonalization Matrix Method of Solving the First Basic Problem of Hidden Markov Model in Speech Recognition System

  Gnanajeyaraman

  Tibicus- Annals. Computer Science Series Tome 8, Fasc. 1. 01/2010; 8(1):17-26.

  This paper proposes a computationally efficient method of solving evaluation problem of Hidden Markov Model (HMM) with a given set of discrete observation symbols, number of states and probability distribution matrices. The observation probability for a given HMM model is evaluated using an approach... [more] This paper proposes a computationally efficient method of solving evaluation problem of Hidden Markov Model (HMM) with a given set of discrete observation symbols, number of states and probability distribution matrices. The observation probability for a given HMM model is evaluated using an approach in which the probability evaluation is reduced to the problem of evaluating the product of matrices with different powers and formed out of state transition probabilities and observation probabilities. Finding powers of a matrix is done by using the computationally efficient diagonalization method thereby reducing the overall computational effort for evaluating the Evaluation problem of HMM.The proposed method is compared with the existing direct method. It is found that evaluating matrix power by diagnolisation method is more suitable than that of the direct, method.

  Download

• Chaotic Image and Audio Encryption Design Using Higher Dimensional Chaotic Map and Tompkins-Paige Algorithm

  Gnanajeyaraman

  Inventi rapid journals. 01/2010; 1(2):1-12.

  The proposed encryption system includes two major parts, chaotic pixels permutation and chaotic pixels substitution. A logistic map is used to generate a bit sequence, which is used to generate pseudorandom numbers in Tompkins-Paige algorithm, in 2D permutation phase. Pixel substitution phase includ... [more] The proposed encryption system includes two major parts, chaotic pixels permutation and chaotic pixels substitution. A logistic map is used to generate a bit sequence, which is used to generate pseudorandom numbers in Tompkins-Paige algorithm, in 2D permutation phase. Pixel substitution phase includes two process, the tent pseudorandom image [TPRI] generator and modulo addition operation. All parts of the proposed chaotic encryption system and Tompkins-Paige algorithms are simulated. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos or audio data. Since the highly sensitive to the initial condition of a system and to the variation of a parameter, and chaotic trajectory is so unpredictable. The higher dimensional of the algorithm is used to enhance the key space and security of the algorithm. The experiments show that the algorithm has the characteristic of sensitive to initial condition, high key space; digital audio signal distribution uniformity and the algorithm will not break in chosen/known-plaintext attacks and the key space of our proposed method is large enough to protect the system against any Brute-force and statistical attacks.

  Download

• SCALABILITY OF HIGH PERFORMANCE IPSEC APPLICATIONS WITH MULTI-CORE PROCESSORS

  Gnanajeyaraman Rajaram

  INTERNATIONAL JOURNAL OF EMERGING TECHNOLOGIES AND APPLICATIONS IN ENGINEERING, TECHNOLOGY AND SCIENCES (IJ-ETA-ETS). 01/2010; Volume 3 : Issue 1(ISSN: 0974-3588):473.

• ANALYSIS OF CHAOTIC-CHEBYSHEV POLYNOMIALS USING ON PUBLIC KEY CRYPTOSYSTEMS

  Gnanajeyaraman

  GESJ- Computer Sciences and Telecommunications Journal. 01/2009; 6(ISSN: 1512-1232):116-123.

  Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption bas... [more] Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials.We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data. We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature. The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.

  Download

• Audio encryption using higher dimensional chaotic map

  Gnanajeyaraman

  International Journal of Recent Trends in Engineering. 01/2009; 1(ISSN 1797-9617):103-107.

  In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudorandomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos or audio data. This paper propos... [more] In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudorandomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos or audio data. This paper propose a novel higher dimensional chaotic system for audio encryption, in which variables are treated as encryption keys in order to achieve secure transmission of audio signals. Since the highly sensitive to the initial condition of a system and to the variation of a parameter, and chaotic trajectory is so unpredictable. As a result we obtain much higher security. The higher dimensional of the algorithm is used to enhance the key space and security of the algorithm. The security analysis of the algorithm is given. The experiments show that the algorithm has the characteristic of sensitive to initial condition, high key space; digital audio signal distribution uniformity and the algorithm will not break in chosen/known-plaintext attacks.

  Download

• Public key cryptosystems based on chaotic-Chebyshev polynomials

  Gnanajeyaraman

  ieee. 01/2009; IAMA 2009(978-1-4244-4710-7):1-5.

  Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption bas... [more] Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials . We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data . We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature . The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.

  Download

• PERFORMANCE IPSEC APPLICATIONS WITH MULTI-CORE PROCESSORS

  Gnanajeyaraman Rajaram

  Internation Journal of Engineering Research and Industrial Applications. 01/2009; Vol.1 , No.1,(ISSN 0973-9424).

• Public Key Cryptosystems Based on Audio Chaotic-Chebyshev Polynomials

  Gnanajeyaraman

  Journal of Engineering and Technology Research. 01/2009; 1(ISSN 2006-9790):122-128.

  Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption bas... [more] Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials by Alfred et al. (1996). We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data by Diffe and Hellman (1976). We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature by Xiao et al. (2007). The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.

  Download

• Encryption using higher dimensional chaotic map

  Gnanajeyaraman Rajaram

  International Journal of Engineering. 01/2009; Vol.1 , No.1,(ISSN 1025-2495):24-30.

  In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudorandomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos or audio data. This paper propos... [more] In Chaotic the properties of sensitivity to initial conditions, control parameters and pseudorandomness chaotic maps have been widely used in data encryption recently. The chaotic based cryptosystems are suitable for large-scale data encryption such as images, videos or audio data. This paper propose a novel higher dimensional chaotic system for audio encryption, in which variables are treated as encryption keys in order to achieve secure transmission of audio signals. Since the highly sensitive to the initial condition of a system and to the variation of a parameter, and chaotic trajectory is so unpredictable. As a result we obtain much higher security. The higher dimensional of the algorithm is used to enhance the key space and security of the algorithm. The security analysis of the algorithm is given. The experiments show that the algorithm has the characteristic of sensitive to initial condition, high key space; digital audio signal distribution uniformity and the algorithm will not break in chosen/knownplaintext attacks.