Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IJNSEC

2011

2011

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 inﬁnity 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 ﬁnite ﬁeld 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...

Added |
14 May 2011 |

Updated |
14 May 2011 |

Type |
Journal |

Year |
2011 |

Where |
IJNSEC |

Authors |
S. V. Sathyanarayana, M. Aswatha Kumar, K. N. Hari Bhat |

Comments (0)