Abstract

In this paper, Cyclic Elliptic Curves of the form y 2 + xy = x 3 + ax 2 + b,a,b ∈ GF(2 m ) with order M is considered. A finite field GF(p) (p ≥ N, where N is the order of point P) is considered. Random sequence {k i } of integers is generated using Linear Feedback Shift Register (LFSR) over GF(p) for maximum period. Every element in sequence {k i } is mapped to k i P which is a point on Cyclic Elliptic Curve with co-ordinates say (x i , y i ). The sequence {k i P} is a random sequence of elliptic curve points. From the sequence (x i , y i ) several binary and non-binary sequences are derived and their randomness properties are investigated. The results are discussed. It is found that these sequences pass FIPS-140, NIST tests and exhibit good Hamming Correlation properties. These sequences find applications in Stream Cipher Systems. Here, Cyclic Elliptic Curve over GF(28) is chosen for analysis.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.