| Peer-Reviewed

Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing

Received: 17 September 2015     Accepted: 18 September 2015     Published: 12 October 2015
Views:       Downloads:
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.

Published in Internet of Things and Cloud Computing (Volume 3, Issue 3)
DOI 10.11648/j.iotcc.s.2015030601.14
Page(s) 33-41
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2015. Published by Science Publishing Group

Keywords

Elliptic Curve, Cryptography, Signature, Scheme, Key Agreement

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] Http://en.wikipedia.org/wiki/Advanced_Encryption_Standard.
[14] Http://www.nsa.gov/business/programs/elliptic_curve.shtml.
[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.
Cite This Article
  • APA Style

    Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang. (2015). Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing. Internet of Things and Cloud Computing, 3(3), 33-41. https://doi.org/10.11648/j.iotcc.s.2015030601.14

    Copy | Download

    ACS Style

    Nguyen Thanh Long; Nguyen Duc Thuy; Pham Huy Hoang. Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing. Internet Things Cloud Comput. 2015, 3(3), 33-41. doi: 10.11648/j.iotcc.s.2015030601.14

    Copy | Download

    AMA Style

    Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang. Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing. Internet Things Cloud Comput. 2015;3(3):33-41. doi: 10.11648/j.iotcc.s.2015030601.14

    Copy | Download

  • @article{10.11648/j.iotcc.s.2015030601.14,
      author = {Nguyen Thanh Long and Nguyen Duc Thuy and Pham Huy Hoang},
      title = {Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing},
      journal = {Internet of Things and Cloud Computing},
      volume = {3},
      number = {3},
      pages = {33-41},
      doi = {10.11648/j.iotcc.s.2015030601.14},
      url = {https://doi.org/10.11648/j.iotcc.s.2015030601.14},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.iotcc.s.2015030601.14},
      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.},
     year = {2015}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Research on Innovating and Applying Cryptography Algorithms for Security Routing in Service Based Routing
    AU  - Nguyen Thanh Long
    AU  - Nguyen Duc Thuy
    AU  - Pham Huy Hoang
    Y1  - 2015/10/12
    PY  - 2015
    N1  - https://doi.org/10.11648/j.iotcc.s.2015030601.14
    DO  - 10.11648/j.iotcc.s.2015030601.14
    T2  - Internet of Things and Cloud Computing
    JF  - Internet of Things and Cloud Computing
    JO  - Internet of Things and Cloud Computing
    SP  - 33
    EP  - 41
    PB  - Science Publishing Group
    SN  - 2376-7731
    UR  - https://doi.org/10.11648/j.iotcc.s.2015030601.14
    AB  - 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.
    VL  - 3
    IS  - 3
    ER  - 

    Copy | Download

Author Information
  • Informatic Center of HaNoi Telecommunications, Hoan Kiem, HaNoi, VietNam

  • Post and Telecommunications Institute, Nghia Tan, Cau Giay, HaNoi, VietNam

  • Ha Noi University of Science Technology, HaNoi, VietNam

  • Sections