Mapping private keys into one public key using binary matrices and masonic cipher: Caesar cipher as a case study

Abstract

Caesar cipher is a mono alphabetic cipher. It is also a type of substitution cipher in which each letter in the plaintext is "shifted" a certain number of places down the alphabet. However, Caesar cipher method did not last long because of its simplicity and lack of communication security. Therefore, we believe that strengthen the key mechanism should increase its complexity against the various cryptanalysis attacks. This paper proposes an enhanced Caesar cipher method through adopting two private keys that are tied to the character positions (i.e. odd and even) for encryption and/or decryption. The two private keys are mapped into one public key to be transferred to the recipient. At the end, the results show that the new cryptosystem is inevitable to cryptanalysis attack. And the cipher text is reduced in size and thus, memory space. The public key generation process is proven to be a one-way function utilizing binary matrices that are generated and shared between the two communicating parties.

Qubits based mutual authentication protocol

“…Encryption techniques have been popular since the time of Julius Caesar who introduced the Caesar's cipher. 21 Till recent times, the success of encryption techniques relied on using symmetric key encryption meaning that the participating entities must share the unique encryption/decryption key through a secure channel separately. 22 As internet proliferated, it was no longer a viable option to meet or communicate in advance over another secure channel.…”

Cryptography model based on the principles of the geometric Series

“…The creation of public keys has shown to be a one-way process that is based on a binary matrix that is created and exchanged by the two communication parties. [7] Abed, B. N. et. al.…”