Abstract

Now a day’s every organization believes that the important asset in their organization is data. Secure data communication through network is needed as organizations tend to move data from one place to other place for business activities. In these situations variety of security mechanisms are needed to overcome security attacks. The range of security is based on diffusion of data and confusion. To achieve high security algorithms that are developed to protect data must be different in their structure. The use of special functions in the algorithms defines the strength of each algorithm. In this paper different types of pairing functions are discussed that has a unique nature of handling real numbers while processing. The pairing functions discussed have their own advantages and disadvantages which are also discussed in this work.

References

• B. Reddaiah, R Pradeep kumar Reddy, S. Hari Krishna “Enciphering using Bit–wise logical operators and paring function with text generated hidden key,” IJCA (0975-8887), Vol. 121, No. 8, July 2015: pp. 30-35.
• P. P Charles & P. L. Shari, “Security in Computing: 4th edition”, Prentice-Hall, Inc.,2008.
• S. Hebert, “A Brief History of Cryptography”, an article available at http://cybercrimes.net/aindex.html
• A. S. Tanenbaum, “Modern Operating Systems”, Prentice Hall, 2003.
• D. KHAN, “The Codebreakers”, Macmillan Publishing Company, New York, 1967.
• Behrouz A. Forouzan, Cryptography and Network Security, Special Indian Edition, TATA McGraw Hill.
• S. William, Cryptography and Network Security: Principles and Practice, 2nd edition, Prentice-Hall, Inc., 1999 pp 23-50
• http://planeta.terra.com.br/informatica/paulobarreto/pblounge.html
• E. Verheul, “Evidence than super singular elliptic curve cryptosystems,” Advances in Cryptology – Eurocrypt 2001, Lecture Notes in Computer Science 2045 (2001), pp.195-210.
• A. Joux, “A one-round protocol for tripartite Di_e-Hellman," Algorithm Number Theory Symposium { ANTS-IV, Lecture Notes on Computer Science 1838, Springer-Verlag (2000), pp. 385{394.
• D. Boneh, M. Franklin, “Identity-based encryption from Weil pairing,” Advances in cryptology – Crypto 2001, Lecture Notes on Computer Science 2139, Springer-Verlag (2001), pp. 213-229.
• D. Boneh, B. Lynn, h. Shacham, “Short signatures from the weil pairing,” Advances in cryptology – Asiacrypt 2001, Lecture Notes on Computer Science 2248, Springer-Verlag (2002), pp. 514-532.
• J. C. Cha, J. H. Cheon, “ An Identity-Based Signature from Gap Diffie-Hellman Groups,” Practice and Theory in Public Key Cryptography – PKC 2003, Lecture Notes on Computer Science 2567, Springer-Verlag (2003), pp. 18-30.
• F. He, “Efficient Identity Based Signature Schemes Based on Pairing,” Selected Areas in Cryptography – SAC 2002, Lecture Notes on Computer Science 2595, Springer-Verlag (2003), pp. 310-324.
• A. Joux, “ A one-round protocol for tripartite Diffie-Hellman,” Algorithm Number Theory Symposium – ANTS-IV, Lecture Notes on Computer Science 1838, Springer-Verlag (2000), pp. 385-394.
• M. Kim, H. Kim, K. Kim, “ A New Identification Scheme based on the Gap Diffie-Hellman Problem,” 2002 Symposium on Cryptography and Information security (SCIS2002), Shirahama, Japan, Jan. 29 – Feb. 1, 2003, vol. /2, pp. 349-352.
• K. G. Paterson, “ID-based signatures from pairings on elliptic curves,” Electronics Letters 38(18) (200), pp. 1025-1026.
• F. Zhang, R. Safavi-Naini, W. Susilo, “ID-Based Chameleon Hashes from Bilinear Pairings,” Cryptology ePrint Archive, Report 2003/208.
• F. Zhang, R. Safavi-Naini, W. Susilo, “An Efficient Signature Scheme from Bilinear Pairings and Its Applications,” Practice and Theory in Public Key Cryptography – PKC 2004, Singapore(SG), March 2004, Lecture Notes on Computer Science 2947, Springer-Verlag (2004), pp. 277-290.