Archive
Special Issues
Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing
Internet of Things and Cloud Computing
Volume 3, Issue 3, October 2015, Pages: 33-41
Received: Sep. 17, 2015; Accepted: Sep. 18, 2015; Published: Oct. 12, 2015
Authors
Nguyen Thanh Long, Informatic Center of HaNoi Telecommunications, Hoan Kiem, HaNoi, VietNam
Nguyen Duc Thuy, Post and Telecommunications Institute, Nghia Tan, Cau Giay, HaNoi, VietNam
Pham Huy Hoang, Ha Noi University of Science Technology, HaNoi, VietNam
Article Tools
Abstract
In Cryptography, there are two kinds of methods for encryption and decryption. They are symmetric cryptography and asymmetric cryptography. In symmetric cryptography, it uses a single key for encryption and decryption. In asymmetric cryptography, it uses both public key and private key for encryption and decryption. In MANET (mobile ad-hoc network) every node usually moves and has limited energy, so network link is not stable and has low bandwidth. Therefore it is very carefully to choose the cryptography for ad-hoc network or MANET. If the transaction is very important, for example online banking, can use an asymmetric algorithm. So Elliptic Curve Cryptography is right choice. For data and control traffic, the symmetric cryptography can be the good selection, especially stream ciphers are very comfortable. We use Elliptic Curve Cryptography (ECC) with its arithmetic operations on finite fields to build public - key cryptographic schemes consisting of: i) signature schemes; ii) encryption schemes; and iii) key agreement schemes. In key management, public key cryptography is used to distribute the secret keys used in other cryptographic algorithms (for example DES). For digital signatures, public key cryptography is used to authenticate the origin of data and protect the integrity of that data. Early public key systems are secure based on difficulty of factoring a large integer composed by two or more large prime integers. With Elliptic Curve based protocol, its security is based on assuming that is difficult to find the discrete logarithm of a random point on Elliptic Curve with respect to a publicly known base point. The size of EC determines the level of difficulty of the problem. If comparing to RSA, with the same level of security, RSA has to use larger public key, for example ECC of 256 bits public key is with the same level of security as 3072 bits public key RSA. To use RSA or Diffie-Hellman to protect 128-bit AES keys one should use 3072-bit parameters: three times the size in use throughout the Internet today. The equivalent key size for elliptic curves is only 256 bits.
Keywords
Elliptic Curve, Cryptography, Signature, Scheme, Key Agreement
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing, Internet of Things and Cloud Computing. Vol. 3, No. 3, 2015, pp. 33-41. doi: 10.11648/j.iotcc.s.2015030601.14
References
[1]
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Research on Innovating, Evaluating and Applying Multicast Routing Technique for Routing messages in Service-oriented Routing”, Springer, ISBN: 978-1-936968-65-7, Volume Number 109, 2012.
[2]
Arindam Sarkar, Department of Computer Science & Engineering, University of Kalyani, J. K. Mandal, Department of Computer Science & Engineering, University of Kalyani, “Secured Wireless Communication using Fuzzy Logic based High Speed Public-Key Cryptography (FLHSPKC)”.
[3]
Debdeep Mukhopadhyay, Dept of Computer Sc and Engg, IIT Madras, “Elliptic Curve Cryptography”.
[4]
Maya Mohan, S.Mary Saira Bhanu, Department of CSE, NSS College of Engineering, National Institute of Technology, “Secured and QoS based multicast routing in MANETs”, (IJCSIS) International Journal of Computer Science and Information Security, Vol. 8, No. 4, July 2010.
[5]
Http://en.wikipedia.org/wiki/Elliptic_Curve_Diffie%E2%80%93Hellman.
[6]
Http://en.wikipedia.org/wiki/NSA_Suite_B.
[7]
Http://en.wikipedia.org/wiki/MQV.
[8]
Http://en.wikipedia.org/wiki/Elliptic_curve_cryptography.
[9]
Http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.pdf.
[10]
Http://kakaroto.homelinux.net/2012/01/how-the-ecdsa-algorithm-works/.
[11]
Http://en.wikipedia.org/wiki/Digital_Signature_Algorithm.
[12]
Http://searchsecurity.techtarget.com/definition/elliptical-curve-cryptography.
[13]
[14]
[15]
W. Lou, W. Liu and Y. Fang, SPREAD: Enhancing data confidentiality in mobile ad hoc networks, in: IEEE INFOCOM 2004 (Hong Kong, China, Mar 2004).
[16]
https://en.wikipedia.org/wiki/Lagrange_polynomial.
PUBLICATION SERVICES