Abstract
A parallel fully homomorphic encryption for rational numbers is developed in this paper. Parallelism of processing is achieved by using methods of modular arithmetic. Encryption is constructed by mapping the field of rational numbers onto a vector space. Two operations, namely addition and multiplication, are defined. Addition and multiplication tables are constructed, which ensures that a vector space is closed under these mathematical operations. We show the implementation of protected recursive computations in rings of the form \(Z_M\), \(M = m_1 m_2 \ldots m_k\). We give a criterion of effective use of encryption for the numerical solution of the Cauchy problem. It is proved that the efficiency of encryption increases with increasing volumes and accuracy of computations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_9
Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850–867. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_49
Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505–524. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_29
Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868–886. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_50
Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? (2011). https://doi.org/10.1145/2046660.2046682, http://eprint.iacr.org/2011/405
Krendelev, S.F.: The soviet supercomputer K-340 and secret calculating. Ruscrypto 2015. http://www.ruscrypto.ru/resource/summary/rc2015/02_krendelev.pdf
Malashevich, B.M.: Unknown modular supercomputers. http://www.computer-museum.ru/books/archiv/sokcon11.pdf
Akushsky, I.J., Yuditsky, D.I.: Arithmetic in residual classes. Soviet radio (1968)
Vishnevskiy, A.K., Krendelev, S.F.: Homomorphic encryption in the ring rational numbers. Ruscrypto 2017. http://www.ruscrypto.ru/resource/summary/rc2017/02_vishnevskiy_krendelev.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Vishnevsky, A.K., Krendelev, S.F. (2018). Fully Homomorphic Encryption for Parallel Implementation of Approximate Methods for Solving Differential Equations. In: Sokolinsky, L., Zymbler, M. (eds) Parallel Computational Technologies. PCT 2018. Communications in Computer and Information Science, vol 910. Springer, Cham. https://doi.org/10.1007/978-3-319-99673-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-99673-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99672-1
Online ISBN: 978-3-319-99673-8
eBook Packages: Computer ScienceComputer Science (R0)