Skip to main content

2017 | OriginalPaper | Buchkapitel

Secure, Green Implementation of Modular Arithmetic Operations for IoT and Cloud Applications

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

search-config
loading …

Abstract

In this chapter, methods for securely performing the calculations required for fundamental modular arithmetic operations, namely multiplication and exponentiation using mobile, embedded, remote or distant computational resources, are proposed that offer the possibility for green information processing system development. These methods are targeted to the distributed paradigms of cloud computing resources and Internet of Things applications. They provide security by avoiding the disclosure to the cloud resource of either the data or the user secret key. Simultaneously, environmental effects of processing are minimized by the simplifications of the operations and by transferring demanding calculations to energy efficient data centers. Hence the proposed methods are also shown to serve the green IT engineering paradigm. An algorithm for the software implementation of modular multiplication is proposed, which uses pre-computations with a constant modulus to reduce the computational load imposed upon the processor. The developed modular multiplication algorithm provides faster execution on low complexity hardware in comparison with the existing algorithms and is oriented towards the variable value of the modulus, especially with the software implementation on micro controllers and smart cards whose architectures include a small number of bits. The proposed technique for modular exponentiation is based on performing simple operations on the user computational resources, shifting the remaining complex operations to high performance, energy-efficient cloud resources and operates by separating the procedure for modular exponentiation in two components. Security is maintained by maintaining the purpose-specific secret key information exclusively in user resources. The details of the pre-calculation of the secret keys are described. Hence the procedure for transferring the most demanding part of the calculation to the cloud resources is given. It is therefore shown that a potential attacker receives no information by intercepting the data existing in the cloud. The overall process is illustrated by a simple numerical example. The use of the new algorithm in Information Society applications that demand security is investigated. Such applications include e-Government, e-Banking, e-Commerce etc. The algorithm is shown to be adequate both for the applications for which it was originally intended, as well as for applications that are much more demanding in the level of security they require, such as military applications.

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

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!

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"

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!

Literatur
1.
Zurück zum Zitat Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Berlin (1995) Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Berlin (1995)
2.
Zurück zum Zitat Menezer, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997) Menezer, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
3.
Zurück zum Zitat Dhem, J.-F., Quisquater, J.-J.: Resent results on modular multiplications for smart cards. In: Proceedings of GARDIS 1998, LNCS-1820, pp. 350–366. Springer, Berlin (2000) Dhem, J.-F., Quisquater, J.-J.: Resent results on modular multiplications for smart cards. In: Proceedings of GARDIS 1998, LNCS-1820, pp. 350–366. Springer, Berlin (2000)
4.
Zurück zum Zitat Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Proceeding of Advances in Cryptology CRYPTO’93, LNCS-773, pp. 175–186. Springer, Berlin (1993) Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Proceeding of Advances in Cryptology CRYPTO’93, LNCS-773, pp. 175–186. Springer, Berlin (1993)
6.
Zurück zum Zitat Hasenplaugh, W., Gaubatz, G., Gopal, V.: Fast modular reduction. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 225–229 Hasenplaugh, W., Gaubatz, G., Gopal, V.: Fast modular reduction. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 225–229
7.
Zurück zum Zitat Chung, J., Hasan, M.A.: Montgomery reduction algorithm for modular multiplication using low-weight polynomial form integers. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 230–239 Chung, J., Hasan, M.A.: Montgomery reduction algorithm for modular multiplication using low-weight polynomial form integers. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 230–239
8.
Zurück zum Zitat Hars, L.: Long modular multiplication for cryptographic applications. In: Cryptographic Hardware and Embedded System—CHES’2004, LNCS-3156, pp. 45–61. Springer, Berlin (2004) Hars, L.: Long modular multiplication for cryptographic applications. In: Cryptographic Hardware and Embedded System—CHES’2004, LNCS-3156, pp. 45–61. Springer, Berlin (2004)
9.
Zurück zum Zitat Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21(2), 120–126 (1978)MathSciNetCrossRefMATH Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21(2), 120–126 (1978)MathSciNetCrossRefMATH
10.
Zurück zum Zitat Barrett, P.: Implementing the River Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A. (ed.) Advances in Cryptology—CRYPTO’86, Santa Barbara, California. Volume 263 of Lecture Notes in Computer Science, pp. 311–323. Springer, Berlin (1987) Barrett, P.: Implementing the River Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A. (ed.) Advances in Cryptology—CRYPTO’86, Santa Barbara, California. Volume 263 of Lecture Notes in Computer Science, pp. 311–323. Springer, Berlin (1987)
11.
Zurück zum Zitat Hong, S.M., Oh, S.Y., Yoon, H.: New modular multiplication algorithms for fast modular exponentiation. In: Proceeding of Advances in Cryptology Eurocrypt’96, LNCS-1070, pp. 166–177. Springer, Berlin (1996) Hong, S.M., Oh, S.Y., Yoon, H.: New modular multiplication algorithms for fast modular exponentiation. In: Proceeding of Advances in Cryptology Eurocrypt’96, LNCS-1070, pp. 166–177. Springer, Berlin (1996)
12.
Zurück zum Zitat Tang, P.T.P.: Modular multiplication using redundant digit division. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 217–224 Tang, P.T.P.: Modular multiplication using redundant digit division. In: 18th IEEE Symposium on Computer Arithmetic, ARITH’07, 25–27 June 2007, pp. 217–224
13.
Zurück zum Zitat Kaihara, M.E., Takagi, N.: Bipartite modular multiplication method. IEEE Trans. Comput. 57(2) (2008) Kaihara, M.E., Takagi, N.: Bipartite modular multiplication method. IEEE Trans. Comput. 57(2) (2008)
14.
Zurück zum Zitat Bardis, N.G., Drigas, A., Markovskyy, A.P., Vrettaros, I.: Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module, Communications in Computer and Information Science 111, Knowledge Management, Information Systems, E-Learning, and Sustainability Research, Third World Summit on the Knowledge Society, WSKS 2010 Corfu, Greece, September 2010 Proceedings, Part I, pp. 573–581. Springer, Berlin (2010). doi:10.1007/978-3-642-16324-1_58 Bardis, N.G., Drigas, A., Markovskyy, A.P., Vrettaros, I.: Accelerated Modular Multiplication Algorithm of Large Word Length Numbers with a Fixed Module, Communications in Computer and Information Science 111, Knowledge Management, Information Systems, E-Learning, and Sustainability Research, Third World Summit on the Knowledge Society, WSKS 2010 Corfu, Greece, September 2010 Proceedings, Part I, pp. 573–581. Springer, Berlin (2010). doi:10.​1007/​978-3-642-16324-1_​58
15.
Zurück zum Zitat Doukas, N., Drigas, A., Bardis, N.G., Karadimas, N.V.: Accessible secure information society applications via the use of optimised cryptographic calculations. J. Appl. Math. Bioinf. 3(4), 181–206 (2013). ISSN: 1792-6602, Scienpress Ltd. Doukas, N., Drigas, A., Bardis, N.G., Karadimas, N.V.: Accessible secure information society applications via the use of optimised cryptographic calculations. J. Appl. Math. Bioinf. 3(4), 181–206 (2013). ISSN: 1792-6602, Scienpress Ltd.
16.
Zurück zum Zitat Boroujerdi, N., Nazem, S.: Cloud computing: changing cogitation about computing. IJCSI Int. J. Comput. Sci. Issues 9(4), No. 3, 169–180 (2012) Boroujerdi, N., Nazem, S.: Cloud computing: changing cogitation about computing. IJCSI Int. J. Comput. Sci. Issues 9(4), No. 3, 169–180 (2012)
17.
Zurück zum Zitat Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New Algorithms for Secure Outsourcing of Modular Exponentiations. ESORICS 2012, LNCS 7459, pp. 541–556 (2012) Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New Algorithms for Secure Outsourcing of Modular Exponentiations. ESORICS 2012, LNCS 7459, pp. 541–556 (2012)
18.
Zurück zum Zitat Markovskyi, O.P., Bardis, N., Doukas, N., Kirilenko, S.: Secure modular exponentiation in cloud systems. In: Proceedings of the Congress on Information Technology, Computational and Experimental Physics (CITCEP 2015), 18–20 Dec 2015, Krakow, Poland, pp. 266–269 Markovskyi, O.P., Bardis, N., Doukas, N., Kirilenko, S.: Secure modular exponentiation in cloud systems. In: Proceedings of the Congress on Information Technology, Computational and Experimental Physics (CITCEP 2015), 18–20 Dec 2015, Krakow, Poland, pp. 266–269
19.
Zurück zum Zitat Kharchenko, V., Illiashenko, O.: Concepts of Green IT Engineering: taxonomy, principles and implementation. In: Kharchenko, V., Kondratenko, Y., Kacprzyk, J. (eds.) Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74, pp. 3–20. Springer International Publishing, Berlin (2017). doi:10.1007/978-3-319-44162-7_1 Kharchenko, V., Illiashenko, O.: Concepts of Green IT Engineering: taxonomy, principles and implementation. In: Kharchenko, V., Kondratenko, Y., Kacprzyk, J. (eds.) Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74, pp. 3–20. Springer International Publishing, Berlin (2017). doi:10.​1007/​978-3-319-44162-7_​1
20.
Zurück zum Zitat Kondratenko, Y.P., Korobko, O.V., Kozlov, O.V.: PLC-based systems for data acquisition and supervisory control of environment-friendly energy-saving technologies. In: Kharchenko, V., Kondratenko, Y., Kacprzyk, J. (eds.) Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74, pp. 247–267. Springer International Publishing, Berlin (2017). doi:10.1007/978-3-319-44162-7_13 Kondratenko, Y.P., Korobko, O.V., Kozlov, O.V.: PLC-based systems for data acquisition and supervisory control of environment-friendly energy-saving technologies. In: Kharchenko, V., Kondratenko, Y., Kacprzyk, J. (eds.) Green IT Engineering: Concepts, Models, Complex Systems Architectures, Studies in Systems, Decision and Control, vol. 74, pp. 247–267. Springer International Publishing, Berlin (2017). doi:10.​1007/​978-3-319-44162-7_​13
Metadaten
Titel
Secure, Green Implementation of Modular Arithmetic Operations for IoT and Cloud Applications
verfasst von
Nikolaos Bardis
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-55595-9_3

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.