Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 257904, 16 pages
http://dx.doi.org/10.1155/2015/257904
Research Article

Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic Curves

Department of Electronics and Communication Engineering, National Institute of Technology, Calicut, Kerala 673 601, India

Received 1 April 2015; Revised 17 August 2015; Accepted 24 August 2015

Academic Editor: David Bigaud

Copyright © 2015 Jilna Payingat and Deepthi P. Pattathil. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Erol-Kantarci and H. T. Mouftah, “Wireless sensor networks for cost-efficient residential energy management in the smart grid,” IEEE Transactions on Smart Grid, vol. 2, no. 2, pp. 314–325, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Jimenez-Fernandez, P. De Toledo, and F. Del Pozo, “Usability and interoperability in wireless sensor networks for patient telemonitoring in chronic disease management,” IEEE Transactions on Biomedical Engineering, vol. 60, no. 12, pp. 3331–3339, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS '02), pp. 41–47, ACM, Washington, DC, USA, November 2002. View at Publisher · View at Google Scholar
  4. H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proceedings of the IEEE Symposium on Security and Privacy (SP '03), pp. 197–213, ACM, May 2003. View at Scopus
  5. D. Liu, P. Ning, and R. Li, “Establishing pairwise keys in distributed sensor networks,” ACM Transactions on Information and System Security, vol. 8, no. 1, pp. 41–77, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Nam, M. Kim, J. Paik, Y. Lee, and D. Won, “A provably-secure ECC-based authentication scheme for wireless sensor networks,” Sensors, vol. 14, no. 11, pp. 21023–21044, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. Y. Choi, D. Lee, J. Kim, J. Jung, J. Nam, and D. Won, “Security enhanced user authentication protocol for wireless sensor networks using elliptic curves cryptography,” Sensors, vol. 14, no. 6, pp. 10081–10106, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Kotzanikolaou, E. Magkos, D. Vergados, and M. Stefanidakis, “Secure and practical key establishment for distributed sensor networks,” Security and Communication Networks, vol. 2, no. 6, pp. 595–610, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Blum and S. Micali, “How to generate cryptographically strong sequences of pseudorandom bits,” SIAM Journal on Computing, vol. 13, no. 4, pp. 850–864, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. G. Gong, T. A. Berson, and D. R. Stinson, “Elliptic curve pseudorandom sequence generators,” in Selected Areas in Cryptography, pp. 34–48, Springer, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  11. I. E. Shparlinski, “On the naor–reingold pseudo-random function from elliptic curves,” Applicable Algebra in Engineering, Communication and Computing, vol. 11, no. 1, pp. 27–34, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. T. Lange and I. E. Shparlinski, “Certain exponential sums and random walks on elliptic curves,” Canadian Journal of Mathematics, vol. 57, no. 2, pp. 338–350, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  13. L.-P. Lee and K.-W. Wong, “A random number generator based on elliptic curve operations,” Computers & Mathematics with Applications, vol. 47, no. 2-3, pp. 217–226, 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. E. B. Barker and J. M. Kelsey, Recommendation for Random Number Generation Using Deterministic Random Bit Generators (Revised), US Department of Commerce, Technology Administration, National Institute of Standards and Technology, Computer Security Division, Information Technology Laboratory, 2007.
  15. P. P. Deepthi and P. S. Sathidevi, “New stream ciphers based on elliptic curve point multiplication,” Computer Communications, vol. 32, no. 1, pp. 25–33, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. K. Suwais and A. Samsudin, “ECSC-128: new stream cipher based on elliptic Curve discrete logarithm problem,” in Proceedings of the 1st International Conference on Security of Information and Networks (SIN '07), May 2007. View at Scopus
  17. S. M. C. Vigila and K. Muneeswaran, “Key generation based on elliptic curve over finite prime field,” International Journal of Electronic Security and Digital Forensics, vol. 4, no. 1, pp. 65–81, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. G. D. Sutter, J.-P. Deschamps, and J. L. Imana, “Efficient elliptic curve point multiplication using digit-serial binary field operations,” IEEE Transactions on Industrial Electronics, vol. 60, no. 1, pp. 217–225, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. N. Koblitz, A Course in Number Theory and Cryptography, vol. 114, Springer, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  20. A. A. Ciss and D. Sow, “On randomness extraction in elliptic curves,” in Progress in Cryptology—AFRICACRYPT 2011, pp. 290–297, Springer, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. D. Hankerson, S. Vanstone, and A. J. Menezes, Guide to Elliptic Curve Cryptography, Springer, New York, NY, USA, 2004. View at MathSciNet
  22. L. E. Bassham III, A. L. Rukhin, J. Soto et al., “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” Tech. Rep. SP 800-22, National Institute of Standards & Technology, Gaithersburg, Md, USA, 2010. View at Google Scholar
  23. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
  24. P. L'Ecuyer and R. Simard, “Testu01: a C library for empirical testing of random number generators,” ACM Transactions on Mathematical Software, vol. 33, no. 4, article 22, 2007. View at Google Scholar
  25. C. M. González, H. A. Larrondo, and O. A. Rosso, “Statistical complexity measure of pseudorandom bit generators,” Physica A: Statistical Mechanics and Its Applications, vol. 354, no. 1–4, pp. 281–300, 2005. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Hell, T. Johansson, A. Maximov, and W. Meier, “A stream cipher proposal: grain-128,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '06), pp. 1614–1618, July 2006. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Akhshani, A. Akhavan, S.-C. Lim, and Z. Hassan, “An image encryption scheme based on quantum logistic map,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, no. 12, pp. 4653–4661, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus