A Robust Cryptographic System using Neighborhood-Generated Keys

Download Full Text
Samuel King Opoku
Published Date:
September 05, 2012
Volume 2, Issue 5
1 - 9

cryptography, des, aes, sha, coding scheme, key management, privacy, security.
Samuel King Opoku, "A Robust Cryptographic System using Neighborhood-Generated Keys". International Journal of Research in Computer Science, 2 (5): pp. 1-9, September 2012. doi:10.7815/ijorcs.25.2012.041 Other Formats


The ability to hide information from unauthorized individuals has been a prevalent issue over the years. Countless algorithms such as DES, AES and SHA have been developed. These algorithms depend on varying key length and key management strategies to encrypt and decrypt messages. The size of the encrypted message is so large that it therefore consumes and wastes valuable storage space when implemented in organizations that store and handle large volumes of small data. The ability to share the generated keys securely also poses a problem. This paper proposes a robust cryptographic algorithm which generates its keys from the surroundings and already-designed coding schemes. The proposed system conserves storage space and processing power. The algorithm is implemented and tested using PHP and MySQL DBMS.

  1. Khalid Haseeb, Muhammad Arshad, Shoukat Ali, Shazia Yasin “ Secure E-commerce Protocol”, International Journal of Computer Science and Security(IJCSS), Vol. 5 No. 1, April 2011, pp: 742-751
  2. Cheraghchi M., Didier F., Shokrollahi A., "Invertible Extractors and Wiretap Protocols", IEEE Transactions on Information Theory, Volume:58, Issue:2, 2012, pp:1254-1274. doi:10.1109/TIT.2011.2170660.
  3. Jikai T., Chuankun W., "A Provable Authenticated Certificateless Group Key Agreement With Constant Rounds", Journal of Communications and Networks, Volume:14, Issue:1, 2012, pp:104-110
  4. Zhao S., Aggarwal A., Frost R., Bai X., "A Survey of Applications of Identity-Based Cryptography in Mobile Ad-Hoc Networks", IEEE Communications Surveys & Tutorials, Volume:14, Issue:2, 2012, pp:380-400. doi:10.1109/SURV.2011.020211.00045
  5. Shyamalendu Kandar, Arnab Maiti, Bibhas Chandra Dhara, “Visual Cryptography Scheme for Color Image Using Random Number with Enveloping by Digital Watermarking”, International Journal of Computer Science Issues, Vol 8, Issue 3, No. 1, 2011, pp:543-549
  6. Kamlesh Gupta, Sanjay Silakari, “ECC over RSA for Asymmetric Encryption: A Review”, International Journal of Computer Science Issues, Vol 8, Issue 3, No. 2, May 2012, pp: 370-375
  7. Nicanfar H., Leung V.C.M, "EIBC: Enhanced Identity-Based Cryptography, a Conceptual Design", IEEE International Systems Conference (SysCon), 2012, pp:1-7. doi:10.1109/SysCon.2012.6189541
  8. Y. Fang, X. Zhu, and Y. Zhang, “Securing Resource-Constrained Ad hoc Networks,” Wireless Communication, Vol. 16, No. 2, 2009, pp: 24–29,
  9. Y. Zhang, W. Liu, W. Lou, and Y. Fang, “Securing Mobile Ad hoc Networks with Certificateless Public Keys,” IEEE Transaction on Dependable Security and Computation, Vol. 3, No. 4, 2006, pp: 386–399. doi:10.1109/TDSC.2006.58
  10. Shazia Yasin, Khalid Haseeb, Rashid Jalal Qureshi, "Cryptography Based E-Commerce Security: A Review", International Journal of Computer Science Issues, Vol 9, Issue 2, No. 1, March 2012, pp: 132-137
  11. Sanjay Jahdav, Viddhulata Mohite, “A Data Hiding Technique Based on Length of English Text Using DES and Attacks”, International Journal of Research in Computer Science, Volume 2, Issue 4, 2012, pp: 23-29
  12. Shiguo Lian, Jinsheng Sun, Zhiquan Wang, “A block cipher based on a suitable use of the chaotic standard map”, Solitons and Fractals, Vol. 26, 2005, pp:117–129. doi:10.1016/j.chaos.2004.11.096
  13. Kulis, B. and Darrell, T. Learning to hash with binary reconstructive embeddings. In NIPS 22, 2010
  14. Landwehr C., Boneh D., Mitchell J. C., Bellovin S. M., Landau S., Lesk M. E., "Privacy and Cybersecurity: The Next 100 Years", IEEE Proceedings, Volume:100, Issue: Special Centennial Issue, 2012, pp:1659-1673. doi:10.1109/JPROC.2012.2189794
  15. Ritter T., "Linear Cryptanalysis: A Literature Survey" Available: www.ciphersbyritter.com/RES/LINANA.HTM
  16. Schaefer E., "Linear Cryptanalysis of Block Ciphers", Available: http://math.scu.edu/~eschaefe/linear.pdf
  17. Bar-El H., "Introduction to Side Channel Attacks", Discretix Technologies Ltd. Available: www.discretix.com/PDF/Introduction%20to%Side%20Channel%20Attacks.pdf
  18. Chong H.K.,"Improved Differential Fault Analysis on AES Key Schedule", IEEE Transactions on Information Forensics and Security, Volume:7, Issue:1, Part:1, 2012, pp:41-50
  19. Chandrasekeran J., “A Chaos Based Approach for Improving Non Linearity in the S-Box Design of Symmetric Key Cryptosystem”, Part 2, Springer, 2011
  20. Maghanathan N., (2011), “Advances in Networks and Communications”, First International Conference on Computer Science and Information Technology, (CCSIT 2011), 2nd- 4th January, Bangalore, India.
  21. Hemme L., “A differential fault attack against early rounds of (Triple-) DES,” 6th Int. Workshop Cryptographic Hardware and Embedded Systems, Vol. 3156, 2004, pp. 254–267
  22. Biham E., Granboulan L., Nguyen P.Q., “Impossible fault analysis of RC4 and differential fault analysis of RC4,” in Proc. Fast Software Encryption: 12th Int. Workshop, vol. 3557, 2005, pp. 359–367
  23. C. H. Kim, “Differential fault analysis against AES-192 and AES-256 with minimal faults,” 7th Int. Workshop Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE Computer Society, 2010, pp. 3–9. doi:10.1109/FDTC.2010.10

  • Singh, Lalit, and R. K. Bharti. "Comparison among different Cryptographic Algorithms using Neighborhood-Generated Keys." International Journal of Computer Applications 73.5 (2013): 40-43.
  • Singh, Er Vishal, and Er Ashish Kumar Saxena. "A Survey: QoS of MANET through cryptography and routing protocol enhancement."