Skip to main content
Erschienen in: The Journal of Supercomputing 11/2020

14.01.2020

Cryptosystem design based on Hermitian curves for IoT security

verfasst von: Omar A. Alzubi, Jafar A. Alzubi, Osama Dorgham, Mohammad Alsayyed

Erschienen in: The Journal of Supercomputing | Ausgabe 11/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The ultimate goal of modern cryptography is to protect the information resource and make it absolutely unbreakable and beyond compromise. However, throughout the history of cryptography, thousands of cryptosystems emerged and believed to be invincible and yet attackers were able to break and compromise their security. The main objective of this paper is to design a robust cryptosystem that will be suitable to be implemented in Internet of Things. The proposed cryptosystem is based on algebraic geometric curves, more specifically on Hermitian curves. The new cryptosystem design is called Hermitian-based cryptosystem (HBC). During the development of the HBC design, Kerckhoffs’s desideratum was the main guidance principle, which has been satisfied by choosing the Hermitian curves as the core of the proposed design. The proposed HBC inherits all the advantageous characteristics of Hermitian curve which are large number of points that satisfy the curve and high genus curves. The aforementioned characteristics play a crucial role in generating a large size encryption key for HBC and determine the block size of plaintext. Due to the fact that HBC used algebraic geometric codes over Hermitian curve, it has the ability to perform error correction in addition to data encryption. The error correction is another advantage of HBC compared with many existing cryptosystems such as McEliece cryptosystem. The number of errors that can be corrected by HBC is larger (high data rate) than other algebraic geometric codes such as elliptic and hyperelliptic curves. It also uses non-binary representation which increases its attack resistance. In this paper, the proposed HBC has been mathematically compared with elliptic curve cryptosystem. The results show that HBC has many advantages over the elliptic curves in terms of number of points and genus of the curve.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Paar C, Pelzl J (2009) Understanding cryptography: a textbook for students and practitioners, 1st edn. Springer, New YorkMATH Paar C, Pelzl J (2009) Understanding cryptography: a textbook for students and practitioners, 1st edn. Springer, New YorkMATH
4.
Zurück zum Zitat Chabaud F (1994) On the security of some cryptosystems based on error-correcting codes, pp 131–139 Chabaud F (1994) On the security of some cryptosystems based on error-correcting codes, pp 131–139
5.
Zurück zum Zitat Pointcheval D, Sanders O, Traoré J (2017) Cut down the tree to achieve constant complexity in divisible E-cash, pp 61–90 Pointcheval D, Sanders O, Traoré J (2017) Cut down the tree to achieve constant complexity in divisible E-cash, pp 61–90
6.
Zurück zum Zitat Dorgham O, Al-Rahamneh B, Almomani A, Khatatneh KF et al (2018) Enhancing the security of exchanging and storing DICOM medical images on the cloud. Int J Cloud Appl Comput (IJCAC) 8(1):154–172 Dorgham O, Al-Rahamneh B, Almomani A, Khatatneh KF et al (2018) Enhancing the security of exchanging and storing DICOM medical images on the cloud. Int J Cloud Appl Comput (IJCAC) 8(1):154–172
7.
Zurück zum Zitat Nadeem A, Javed MY (2005) A performance comparison of data encryption algorithms, pp 84–89 Nadeem A, Javed MY (2005) A performance comparison of data encryption algorithms, pp 84–89
9.
Zurück zum Zitat Tunstall M, Mukhopadhyay D, Ali S (2011) Differential fault analysis of the advanced encryption standard using a single fault. In: Ardagna CA, Zhou J (eds) Information security theory and practice. security and privacy of mobile devices in wireless communication. Springer, Berlin, pp 224–233 Tunstall M, Mukhopadhyay D, Ali S (2011) Differential fault analysis of the advanced encryption standard using a single fault. In: Ardagna CA, Zhou J (eds) Information security theory and practice. security and privacy of mobile devices in wireless communication. Springer, Berlin, pp 224–233
11.
Zurück zum Zitat Tsiounis Y, Yung M (1998) On the security of ElGamal based encryption. In: Imai H, Zheng Y (eds) Public key cryptography. Springer, Berlin, pp 117–134CrossRef Tsiounis Y, Yung M (1998) On the security of ElGamal based encryption. In: Imai H, Zheng Y (eds) Public key cryptography. Springer, Berlin, pp 117–134CrossRef
13.
Zurück zum Zitat Au S, Eubanks-Turner C, Everson J (2003) The McEliece cryptosystem Au S, Eubanks-Turner C, Everson J (2003) The McEliece cryptosystem
14.
Zurück zum Zitat Alzubi J, Alzubi O, Chen TM (2014) Forward error correction based on algebraic-geometric theory. Springer, New YorkCrossRef Alzubi J, Alzubi O, Chen TM (2014) Forward error correction based on algebraic-geometric theory. Springer, New YorkCrossRef
15.
Zurück zum Zitat Cohen H, Frey G, Avanzi R et al (2012) Handbook of elliptic and hyperelliptic curve cryptography, 2nd edn. Chapman & Hall/CRC, Boca RatonMATH Cohen H, Frey G, Avanzi R et al (2012) Handbook of elliptic and hyperelliptic curve cryptography, 2nd edn. Chapman & Hall/CRC, Boca RatonMATH
16.
Zurück zum Zitat Alzubi O, Chen T, Alzubi J, Rashaideh H, Al-Najdawi N (2016) Secure channel coding schemes based on algebraic-geometric codes over Hermitian curves. J Univ Comput Sci 22:552–566MathSciNet Alzubi O, Chen T, Alzubi J, Rashaideh H, Al-Najdawi N (2016) Secure channel coding schemes based on algebraic-geometric codes over Hermitian curves. J Univ Comput Sci 22:552–566MathSciNet
17.
Zurück zum Zitat Carrasco RA, Johnston M (2009) Non-binary error control coding for wireless communication and data storage. Wiley Publishing, New York Carrasco RA, Johnston M (2009) Non-binary error control coding for wireless communication and data storage. Wiley Publishing, New York
20.
Zurück zum Zitat Canteaut A, Sendrier N (1998) Cryptanalysis of the original McEliece cryptosystem. In: Ohta K, Pei D (eds) Advances in cryptology–ASIACRYPT’98. Springer, Berlin, pp 187–199 Canteaut A, Sendrier N (1998) Cryptanalysis of the original McEliece cryptosystem. In: Ohta K, Pei D (eds) Advances in cryptology–ASIACRYPT’98. Springer, Berlin, pp 187–199
21.
Zurück zum Zitat Szczechowiak P, Oliveira LB, Scott M, Collier M, NanoECC Dahab R (2008) Testing the limits of elliptic curve cryptography in sensor networks. In: Verdone R (ed) Wireless sensor networks. Springer, Berlin, pp 305–320CrossRef Szczechowiak P, Oliveira LB, Scott M, Collier M, NanoECC Dahab R (2008) Testing the limits of elliptic curve cryptography in sensor networks. In: Verdone R (ed) Wireless sensor networks. Springer, Berlin, pp 305–320CrossRef
22.
Zurück zum Zitat Liu A, Ning P (2008) TinyECC: a configurable library for elliptic curve cryptography in wireless sensor networks, pp 245–256 Liu A, Ning P (2008) TinyECC: a configurable library for elliptic curve cryptography in wireless sensor networks, pp 245–256
24.
Zurück zum Zitat Miller VS (2011) Computational aspects of elliptic curves and modular forms, pp 1–2 Miller VS (2011) Computational aspects of elliptic curves and modular forms, pp 1–2
27.
Zurück zum Zitat Liu Z, Huang X, Hu Z, Khan MK, Seo H, Zhou L (2017) On emerging family of elliptic curves to secure internet of things: ECC comes of age. IEEE Trans Dependable Secur Comput 14:237–248CrossRef Liu Z, Huang X, Hu Z, Khan MK, Seo H, Zhou L (2017) On emerging family of elliptic curves to secure internet of things: ECC comes of age. IEEE Trans Dependable Secur Comput 14:237–248CrossRef
29.
Zurück zum Zitat Perzynova K (2010) Hyperelliptic curves and their application in cryptography. PhD thesis. BRNO university of technology Perzynova K (2010) Hyperelliptic curves and their application in cryptography. PhD thesis. BRNO university of technology
30.
Zurück zum Zitat Vijayakumar P, Vijayalakshmi V, Zayaraz G (2014) Comparative study of hyperelliptic curve cryptosystem over prime field and its survey Vijayakumar P, Vijayalakshmi V, Zayaraz G (2014) Comparative study of hyperelliptic curve cryptosystem over prime field and its survey
31.
Zurück zum Zitat Sghaier A, Zghid M, Machhout M (2015) Proposed efficient arithmetic operations architectures for hyperelliptic curves cryptosystems (HECC), pp 1–5 Sghaier A, Zghid M, Machhout M (2015) Proposed efficient arithmetic operations architectures for hyperelliptic curves cryptosystems (HECC), pp 1–5
32.
Zurück zum Zitat Asif RA (2016) Efficient computation for hyper elliptic curve based cryptography. PhD thesis. University of Windsor Asif RA (2016) Efficient computation for hyper elliptic curve based cryptography. PhD thesis. University of Windsor
33.
Zurück zum Zitat Rajasekar V, Varadhaganapathy S, Sathya K, Premalatha J (2016) An efficient lightweight cryptographic scheme of signcryption based on hyperelliptic curve, pp 394–397 Rajasekar V, Varadhaganapathy S, Sathya K, Premalatha J (2016) An efficient lightweight cryptographic scheme of signcryption based on hyperelliptic curve, pp 394–397
34.
Zurück zum Zitat Calderini M, Faina G (2012) Generalized algebraic geometric codes from maximal curves. IEEE Trans Inf Theory 58(4):2386–2396MathSciNetCrossRef Calderini M, Faina G (2012) Generalized algebraic geometric codes from maximal curves. IEEE Trans Inf Theory 58(4):2386–2396MathSciNetCrossRef
35.
Zurück zum Zitat Johnston M (2005) Construction and performance of algebraic-geometric codes over AWGN and fading channels. IEE Proc Commun 15(29):713–722CrossRef Johnston M (2005) Construction and performance of algebraic-geometric codes over AWGN and fading channels. IEE Proc Commun 15(29):713–722CrossRef
36.
Zurück zum Zitat Jibril M, Tomlinson M, Ahmed MZ, Tjhai CJ (2009) Performance comparison between Hermitian codes and shortened non-binary BCH codes. In: 2009 IEEE International Conference on Microwaves, Communications, Antennas and Electronics Systems, pp 1–5 Jibril M, Tomlinson M, Ahmed MZ, Tjhai CJ (2009) Performance comparison between Hermitian codes and shortened non-binary BCH codes. In: 2009 IEEE International Conference on Microwaves, Communications, Antennas and Electronics Systems, pp 1–5
38.
Zurück zum Zitat Chen L (2013) Iterative soft-decision decoding of Hermitian codes. IEEE Trans Commun 61(1):33–42CrossRef Chen L (2013) Iterative soft-decision decoding of Hermitian codes. IEEE Trans Commun 61(1):33–42CrossRef
40.
Zurück zum Zitat ICEMIS ’15: Proceedings of the International Conference on Engineering & MIS 2015 (New York, NY, USA); ACM: 2015 ICEMIS ’15: Proceedings of the International Conference on Engineering & MIS 2015 (New York, NY, USA); ACM: 2015
Metadaten
Titel
Cryptosystem design based on Hermitian curves for IoT security
verfasst von
Omar A. Alzubi
Jafar A. Alzubi
Osama Dorgham
Mohammad Alsayyed
Publikationsdatum
14.01.2020
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 11/2020
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-020-03144-x

Weitere Artikel der Ausgabe 11/2020

The Journal of Supercomputing 11/2020 Zur Ausgabe