Addepalli V. N. Krishna

Here in this model, a new mechanism is used for Public Key Cryptography. A generator matrix is used to generate a field with a large prime number. The generator matrix, prime number and quaternary vector are used as global variables. The Generator Matrix is powered by a private key to generate Public Key. Since the model is based on Discrete Logarithm Problem, which is Hard problem, the proposed algorithm supports the features like Authenticity of users, Security & Confidentiality of data transmitted. Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 72 bit lengths to provide sufficient strengths against crypto analysis.

In this work, a cubic spline curve is considered for Asymmetric mode encrypting data. A Cubicspline curve is used to generate a set of points under initial known boundary conditions. This set of points is considered as generator points. Given the field, known the generator points, considering for some time and space steps and for a considered private key, Public key will be generated based on Discrete Logarithm problem. Thus for a set of public and private keys, data can be transmitted securely with features like Authenticity of users, Security & Confidentiality of data transmitted. Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 120 bit lengths to provide sufficient strengths against cryptoanalysis.

In this work, a novel mechanism is considered for Asymmetric mode encrypting data. A generator matrix is used to generate a field with a large prime number. The generator matrix, prime number and ternary vector are used as global variables. Those global variables are used to calculate public key and sub keys. Using the Global Variables and Private key, a Digital signature algorithm is proposed which supports the feature like Authenticity of users. The mechanism can also be used in Homomorphic Encryption where computations to be carried out on cipher text and generate an encrypted result which, when decrypted, matches the result of operations performed on the plaintext.

Elliptic Curve Cryptography provides a secure means of Data Transfer among participating parties at low computing over head. In the implementation of ECC, the message is transformed into an affine point on the EC and this affine point is added to product of Random number and the public key of the recipient. In the present work the output of ECC algorithm is provided with probabilistic features which makes the algorithm free from Chosen cipher text attack. Thus by having key lengths of even less than 160 bits, the present algorithm provides sufficient strength against crypto analysis and whose performance can be compared with standard algorithms like RSA.

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. In Ramasamy, Prabakar, Devi, and Suguna (2009) Rajaram Ramasamy, R. , Amutha Prabakar, M. , Indra Devi, M. and Suguna, M. 2009. Knapsack based ECC encryption and decryption. International Journal of Network Security, 9(3) November: 218–226. [Google Scholar] ,,the authors presented 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). The authors in their decryption process used elliptic curve discrete logarithm to get back the plain text. This may form a computationally infeasible problem if the values are large enough in generating the plain text. In Krishna (2011 Krishna, A.V.N. 2011. Probabilistic encryption based ECC mechanism. International Journal on Advancements in Technology(IJOAT), 2(2) January: 257–268. [Google Scholar] ), the author mapped the basin value randomly on the output of ECC to generate the cipher text. In the present work the output of ECC algorithm is iterated by the values which are randomly picked from the basin values to provide a probabilistic approach to the output which makes the algorithm free from the chosen cipher text attack. Thus by having key lengths of even much less than 160 bits, the present algorithm provides sufficient strength against crypto analysis and whose performance can be compared with standard algorithms such as RSA.

In this work a model is going to be used which develops data distributed over a identified value which is used as nonce (IV). The model considers an equilibrium equation which is a function of non linear relationships, time variant and nonce variant values and takes the feed back of earlier round as input to the present round. The process is repeated for different timings which are used as time stamps in the encryption mechanism. Thus this model generates a distributed sequence which is used as sub key. This model supports very important parameters in symmetric data encryption schemes like non linear relationships between different values used in the model, variable key length, timeliness of encryption mechanism and also acknowledgement between the participating parties. It also supports feed back mode which provides necessary strength against crypto analysis.

Encryption study basically deals with three levels of algorithms. The first algorithm deals with encryption mechanism, second deals with decryption Mechanism and the third discusses about the generation of keys and sub keys used in the encryption study. In the given study, a new algorithm is discussed. The algorithm executes a series of steps and generates a sequence. This sequence is being used as sub key to be mapped to plain text to generate cipher text. The strength of the encryption & Decryption process depends on the strength of sequence generated against crypto analysis.. In this part of work some statistical tests like Uniformity tests, Universal tests & Repetition tests are tried on the sequence generated to test the strength of it.