A Novel Approach for Enciphering Data based ECC using Catalan Numbers

Amounas, Fatima; Kinani, El Hasan El; Hajar, Moha

doi:10.11591/ijins.v2i4.3447

Cited by 6 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A novel EC encryption algorithm based on an integer sequence of the Catalan numbers was proposed by F. Amounas et al [7]. The spiral matrix concept was also used for scrambling the message and this data was encrypted.…”

Section: Related Workmentioning

confidence: 99%

4216 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Retrieval Number: A1622109119/2019©BEIESP DOI: 10.35940/ijeat.A1622.109119 Journal Website: www.ijeat.org El Gamal Encryption using Lucas, Elliptic Curve and SRZ Model

K*,

Begam

2019

IJEAT

View full text Add to dashboard Cite

In cryptography, the security is depending on the way in which it produces different ciphertexts for the same plaintext so that the eavesdropper is not able to recover the plaintext from the ciphertext. Though, several block cipher modes viz., CBC, CFB and OFB exist, they take more time for producing different ciphertext blocks for the same plaintext block. To avoid this, an encoding is performed at the plaintext level. There are several encoding schemes like ASCII, Magic Square, and Magic Rectangle based encoding exist in the literature. But, in this paper, a novel encoding technique based on Elliptic Curve, Lucas number, Spiral Clockwise Rotation and Zigzag transformations called ECLUSRZ has been proposed. As, the original form of plaintext is completely altered using this proposed encoding scheme, the eavesdropper may not easily recover the plaintext from the ciphertext. Once, the encoding is performed , the encoded numeral called intermediate plaintext is then used for any one of the public key cryptosystems like ElGamal and the security level produced by ElGamal encryption with ASCII based and the proposed ECLUSRZ based encoding is analyzed.

show abstract

Section: Related Workmentioning

confidence: 99%

4216 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Retrieval Number: A1622109119/2019©BEIESP DOI: 10.35940/ijeat.A1622.109119 Journal Website: www.ijeat.org El Gamal Encryption using Lucas, Elliptic Curve and SRZ Model

K*,

Begam

2019

IJEAT

View full text Add to dashboard Cite

show abstract

“…Paper [7] proposes cryptographic algorithms based on integer sequences of Catalan numbers as new methods of encryption. In the proposed encryption method, by using Catalan numbers, a large random number "n" is set as a secret key for encryption text in one file.…”

Section: Related Workmentioning

confidence: 99%

“…The Code for encryption process based on movement through LatticePath: (1) Splits the message (a file) on n-bit segments (fits to the basis of the n key); (2) The cycle for inclusion of the file segments starting from 0th up to the last segment; (3) In each segment, the reading of the elements is performed, from the first up to the last element in the segment; (4) Minimizing the position of the bits in the segment; (5) The cycle for reading the bits in the key; (6) if it is bit 1 then movement to the right follows (increasing the number of the free characters, and reducing the number of steps to the end point); (7) if it is bit 0 then movement to the up follows (takes character, which means that it increases the number of engaged characters and reduces the number of free ones); ( 8) at the end, when all the segments of the message are completed, the complete ciphertext is printed. From the aforementioned process, we can identify two basic rules of movement:…”

Section: Application Of Catalan Numbers and The Lattice Path Combinat...mentioning

confidence: 99%

Application of Catalan Numbers and the Lattice Path Combinatorial Problem in Cryptography

Saračević¹,

Adamović²,

Biševac³

2018

ACTA POLYTECH HUNG

View full text Add to dashboard Cite

This paper analyzes the properties of Catalan numbers and their relation to the Lattice Path combinatorial problem in cryptography. Specifically, analyzes the application of the appropriate combinatorial problem based on Catalan-key in encryption and decryption of files and plaintext. Accordingly, we use Catalan numbers for generating keys and within the experimental part we have applied the NIST (National Institute of Standards and Technology) statistical battery of tests for assessing the quality of generated keys was applied. A total of 12 quality assurance tests for Catalan-key were applied. A Java application is presented which allows the encryption and decryption of plaintext based on the generated Catalan-key and combinatorial problem of movement in integer network orLattice Path. Experimental study yields the comparison of results in text encryption speed for combinatorial encryption methods (such as: Ballot Problem, Stack permutations and Balanced Parentheses) in comparison with Lattice Path method (in Java programming language).

show abstract