Visible to the public Biblio

Filters: Keyword is Plain Text  [Clear All Filters]
2022-01-10
Padma, Bh, Chandravathi, D, Pratibha, Lanka.  2021.  Defense Against Frequency Analysis In Elliptic Curve Cryptography Using K-Means Clustering. 2021 International Conference on Computing, Communication, and Intelligent Systems (ICCCIS). :64–69.
Elliptic Curve Cryptography (ECC) is a revolution in asymmetric key cryptography which is based on the hardness of discrete logarithms. ECC offers lightweight encryption as it presents equal security for smaller keys, and reduces processing overhead. But asymmetric schemes are vulnerable to several cryptographic attacks such as plaintext attacks, known cipher text attacks etc. Frequency analysis is a type of cipher text attack which is a passive traffic analysis scenario, where an opponent studies the frequency or occurrence of single letter or groups of letters in a cipher text to predict the plain text part. Block cipher modes are not used in asymmetric key encryption because encrypting many blocks with an asymmetric scheme is literally slow and CBC propagates transmission errors. Therefore, in this research we present a new approach to defence against frequency analysis in ECC using K-Means clustering to defence against Frequency Analysis. In this proposed methodology, security of ECC against frequency analysis is achieved by clustering the points of the curve and selecting different cluster for encoding a text each time it is encrypted. This technique destroys the regularities in the cipher text and thereby guards against cipher text attacks.
2017-12-27
T, Baby H., R, Sujatha B..  2016.  Chaos based Combined Multiple Recursive KEY Generator for Crypto-Systems. 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT). :411–415.

With the ever increasing growth of internet usage, ensuring high security for information has gained great importance, due to the several threats in the communication channels. Hence there is continuous research towards finding a suitable approach to ensure high security for the information. In recent decades, cryptography is being used extensively for providing security on the Internet although primarily used in the military and diplomatic communities. One such approach is the application of Chaos theory in cryptosystems. In this work, we have proposed the usage of combined multiple recursive generator (CMRG) for KEY generation based on a chaotic function to generate different multiple keys. It is seen that negligible difference in parameters of chaotic function generates completely different keys as well as cipher text. The main motive for developing the chaos based cryptosystem is to attain encryption that provides high security at comparatively higher speed but with lower complexity and cost over the conventional encryption algorithms.

2017-02-14
H. K. Sharma, R. Tomar, J. C. Patni.  2015.  "HRJ_encryption: An ASCII code based encryption algorithm and its implementation". 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom). :1024-1027.

The transmission of data over a common transmission media revolute the world of information sharing from personal desktop to cloud computing. But the risk of the information theft has increased in the same ratio by the third party working on the same channel. The risk can be avoided using the suitable encryption algorithm. Using the best suited algorithm the transmitted data will be encrypted before placing it on the common channel. Using the public key or the private key the encrypted data can be decrypted by the authenticated user. It will avoid the risk of information theft by the unauthenticated user. In this work we have proposed an encryption algorithm which uses the ASCII code to encrypt the plain text. The common key will be used by sender or receiver to encrypt and decrypt the text for secure communication.