New stream ciphers based on elliptic curve point multiplication

Computer Communications

Volumn 32, Issue 1, 2009, Pages 25-33

  Deepthi, P P ^a   Sathidevi, P S ^a  

^a NATIONAL INSTITUTE OF TECHNOLOGY CALICUT   (India)

Author keywords

Elliptic curve; Point multiplication; Pseudorandom bit sequence generator; Stream cipher

Indexed keywords

MONOLITHIC MICROWAVE INTEGRATED CIRCUITS; OPTICAL DEVICES;

CRYPTOSYSTEMS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHIES; ELLIPTIC CURVE POINT MULTIPLICATIONS; ELLIPTIC CURVES; INFRA STRUCTURES; KEY EXCHANGES; NEW ALGORITHMS; POINT MULTIPLICATION; PSEUDORANDOM BIT SEQUENCE GENERATOR; PSEUDORANDOM BIT SEQUENCES; STREAM CIPHER; STREAM CIPHERS;

CRYPTOGRAPHY;

EID: 57349175668     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2008.09.002     Document Type: Article

References (21)

1. Blum M., and Micali S. How to Generate Cryptographically Strong Sequences of Pseudo-random Bits. SIAM Journal on Computing 13 4 (1984) 850-864
2. G. Gong, T.A. Berson, D.R. Stinson, Elliptic curve pseudorandom sequence generators, Technical Report, University of Waterloo, December 1998.
3. Lap-piu Lee, Kwok-wo Wong, Elliptic curve random number generation, in: Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology, TENCON 2001, vol. 1, 2001, pp. 239-241.
4. Elaine Barker, John Kelsey, Recommendation for random number generation using deterministic random bit generators, Special Publication 800-90, National Institute of Standards and Technology, December 2005.
5. Burton S. Kaliski, A pseudo-random bit generator based on elliptic logarithms, in: A.M. Odlyzko (Ed.), Advances in Cryptology CRYPTO '86, LNCS, vol. 263, 1986, pp. 84-103.
6. Berry Schoenmakers, Andrey Sidorenko, Cryptanalysis of the dual elliptic curvepseudorandom generator, Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, May 2006.
7. Lange T., and Shparlinski I.E. Certain exponential sums and random walks on elliptic curves. Canadian Journal of Mathematics 57 (2005) 338-350
8. Shparlinski I.E. On the Naor-Reingold pseudo-random function from elliptic curves. Applicable Algebra in Engineering, Communication and Computing 11 (2000) 27-34
9. m), GLVLSI'04, April 26-28, 2004, Boston, MA, USA.
10. Koc C.K., and Sunar B. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Transactions on Computer 47 (1998) 353-356
11. m). IEEE Transactions on Computers 38 10 (1989) 1383-1386
12. Henry Cohen, Gerhard Frey, Handbook of Elliptic and Hyper Elliptic Curve Cryptography, Taylor and Francis Group, 2006.
13. Menezes A.J. Elliptic Curve Public Key Cryptosystems (1993), Kluwer Academic Publishers
14. Bruce Schneier, Applied Cryptography, Second Edition: Protocols, Algorithms, and Source Code in C, Wiley Computer Publishing, John Wiley & Sons, 1996.
15. Oded Goldreich, Foundations of Cryptography Basic Tools, Cambridge University Press, 2001.
16. A Statistical Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, NIST Special Publication 800-22, May 15, 2001.
17. O. Goldreich, H. Krawczyk, M. Luby, On the existence of pseudorandom generators, in: IEEE Symposium on the Foundations of Computer Science, 29th SFCS, 1988, pp. 12-24.
18. Levin L.A. One-way function and pseudorandom generators. Combinatorica 7 4 (1987) 357-363
19. Stallings W. Cryptography and Network Security. third ed. (2003), Pearson Education Inc.
20. Menezes A.J., van Oorschot P., and Vanstone S. Handbook of Applied Cryptography (1996), CRC Press
21. Menezes A.J. Applications of Finite Fields (1993), Kluwer Academic Publishers, Boston, MA, USA