Symmetric Key Image Encryption Scheme with Key Sequences Derived from Random Sequence of Cyclic Elliptic Curve Points

In this paper, cyclic elliptic curves of the form y2 + xy = x3 + ax2 + b, a, b ∈ GF(2m ) with order M is considered in the design of a Symmetric Key Image Encryption Scheme with Key Sequence derived from random sequence of cyclic elliptic Curve points. P with co-ordinates (xP , yP ) which satisfy the elliptic curve equation is called a point on elliptic curve. The order M is the total number of points (x,y) along with x = ∞, y = ∞ which satisfy the elliptic curve equation. Least integer N for which NP is equal to point at infinity O is called order of point P. Then P, 2P, . . . (N-1)P are distinct points on elliptic curve. In case of cyclic elliptic Curve there exists a point P having the same order N as elliptic curve order M. A finite field GF(p) (p≥ N) is considered. Random sequence {ki} of integers is generated using Linear Feedback Shift Register (LFSR) over GF(p) for maximum period. Such sequences are called maximal length sequences and their properties are well estab...

• Type: Journal
• Year: 2011
• Where: IJNSEC
• Authors: S. V. Sathyanarayana, M. Aswatha Kumar, K. N. Hari Bhat
• Keywords: Curve, Cyclic Elliptic Curve, Elliptic Curve, IJNSEC 2011