Abstract

This paper starts with a brief introduction of the different coordinate systems prevailing in cryptography, aims in developing security measures which could save atleast some amount of time in the execution processes. For this purpose the sextic curve and the probability symmetric curve are considered. Simulation exercises are carried out for both and it is proved that in both the cases the time taken for encryption and decryption is slightly lesser than that for RSA and ECC. On the whole this study brings out the new system for encryption and decryption with higher level of secrecy and lesser amount of time.

References

• Neal Koblitz. 2007. The uneasy relationship between Mathematics and Cryptography. Notes of the AMS, 54(8):972-979.
• William Stallings. 2004. Cryptography and Network Security Principles and Practices. 3rd ed. Pearson Education.
• Junfeng Fan, Kazuo Sakiyama, Ingrid Verbauwhede. 2008. Elliptic curve cryptography on embedded multi-core systems. Journal of Design Automation for Embedded Systems, 123-134.
• Kanniah, Samsudin. 2007. Multi-threading elliptic curve cryptosystems. Proceedings of Telecommunications and Malaysia International conference on communications, 134-139.
• Lee, Wong. 2004. A random number generator based elliptic curve operations. Computers and Mathematics with Applications, 47:217-226.
• Menezes. 1993. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers.
• Nel Koblitz, Algred Menezes, Scott Vanstone. 2000. The state of elliptic curve cryptography. Journal of Designs Codes and Cryptography, 19:173-193.
• Atay et al. 2006. Computational cost analysis of elliptic curve arithmetic. Proceedings of international conference on Hybrid Information Technology, 1:578-582.
• Liu Wen-Yuan et al. 2007. A proxy blind signature scheme based on elliptic curve with proxy revocation. Proceedings of the international conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed computing, 1:99-104.
• Nassar, Watheq El-Kharashi, Mahmoud Shousha. 2007. An FPGA-based architecture of ECC point multiplication. Proceedings of the 2nd international design and test workshop, 237-238.
• Puttmann et al. 2008. Hardware Accelerators for Elliptic Curve Cryptography. Advances in Radio Science, 6:259-264.
• Vivek Kapoor, Vivek Sonny Abraham, Ramesh Singh. 2008. Elliptic Curve Cryptography. ACM Ubiquity, 9:1-8.
• http://en. wikipedia. org/wiki/List_of_curves.
• Sam Emmanuel, C. Suyambulingom. 2011. Safety Measures Using Sextic Curve Cryptography. International Journal on Computer Science and Engineering, 3(2):800-806.
• Berkhoff, Lane. 2008. A Survey of Modern Algebra. USA:AKP Classics.
• Nel Koblitz. 1984. A Course in Number Theory and Cryptography. New York:Springer Verlag.
• Howon Kim et al. 2008. Hyper elliptic Crypto-coprocessor over affine and projective coordinates. ETRI Journal, 30(3):365-376.
• Jarvinen, Tommiska, Skytta. 2004. A scalable architecture for elliptic curve point multiplication. Proceedings of IEEE international conference on Field-Programmable Technology, 303-306.
• Sam Emmanuel, Suyambulingom. 2011. Safety Measures Using Probability Symmetric Curve Cryptography. International Journal of Computer Applications, 31(11): 42-48.
• Leonardo B. Oliveira et al. 2011. TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications, 34:485–493.
• Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert. 2011. Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems. IEEE Transactions on computers, 60(2):254-265.