Notice of Retraction Coupled Tree Parity Machines: Synchronized Secured Session Key based Encryption in Online Transaction

Arindam Sarkar, Joydeep Dey, Sunil Karforma, Anirban Bhowmik

Abstract


Notice of Retraction

-----------------------------------------------------------------------
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of APTIKOM's Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting ij.aptikom@gmail.com.

-----------------------------------------------------------------------

In this paper, tree parity synchronized session key validation followed by encryption has been proposed for online data communication. Tree Parity Machine transmitting systems at both ends accepted an identical input vector, generated an output bit, validated the weight vector and the networks were trained accordingly based on the output bit which was used to form a protected variable length secret key. Existence of a better degree of coupling between the two topological same tree parity machines has been reflected in this paper. Instead of sharing the entire weight vector, the proposed technique guided the partial transmission and validation of session key. A string of sub key has been derived from the synchronized session key for initial ciphering matrix. The plain text was encrypted through single columnar transposition ciphering at first round of encryption followed by successive cascaded XORing of TPM generated session key. If size of the final block of plain text was less than the size of the key then this block was treated unaltered. Recipient used identical generated session key for performing deciphering process for getting the plain text. Brute force attacks analysis has been implemented which determines a higher amount of time to decrypt by the intruders. Such long computational operations were not feasible by any of randomly selected fast networks at the intruders’ terminals.




DOI: https://doi.org/10.11591/APTIKOM.J.CSIT.133

Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 APTIKOM Journal on Computer Science and Information Technologies

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN: 2722-323X, e-ISSN: 2722-3221

CSIT Stats

 

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.