{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T18:04:19Z","timestamp":1770141859136,"version":"3.49.0"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008769","name":"Julius-Maximilians-Universit\u00e4t W\u00fcrzburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cloud computing has become increasingly popular due to its scalability, cost-effectiveness, and ability to handle large volumes of data. However, entrusting (sensitive) data to a third party raises concerns about data security and privacy. Homomorphic encryption is one solution that allows users to store and process data in a public cloud without the cloud provider having access to it. Currently, homomorphic encryption libraries only support addition and multiplication; other mathematical functions must be implemented by the user. To this end, we discuss and implement the division, exponential, square root, logarithm, minimum, and maximum function, using the CKKS cryptosystem of the OpenFHE library. To demonstrate that complex applications can be realized with this extended function set, we have used it to homomorphically realize the Box\u2013Cox transform, which is used in many real-world applications, e.g., time-series forecasts. Our results show how the number of iterations required to achieve a given accuracy varies depending on the function. In addition, the execution time for each function is independent of the input and is in the range of ten seconds on a reference machine. With this work, we provide users with insights on how to extend the original restricted function set of the CKKS cryptosystem of the OpenFHE library with basic mathematical functions.<\/jats:p>","DOI":"10.1007\/s10207-023-00781-0","type":"journal-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T14:02:13Z","timestamp":1701093733000},"page":"1149-1169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["De Bello Homomorphico: Investigation of the extensibility of the OpenFHE library with basic mathematical functions by means of common approaches using the example of the CKKS cryptosystem"],"prefix":"10.1007","volume":"23","author":[{"given":"Thomas","family":"Prantl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Horn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Engel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Iffl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Beierlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Krupitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Bauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mansi","family":"Sakarvadia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Foster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Kounev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"781_CR1","unstructured":"Park, J., Han, K., Lee, B.: Green cloud? An empirical analysis of cloud computing and energy efficiency. Manag. Sci. (2022)"},{"key":"781_CR2","unstructured":"Handelsblatt: Cloud-Computing in Deutschland: Statistik Zeigt Das Nutzungsprofil Deutscher Unternehmen. (2020). Handelsblatt. Online available under https:\/\/www.handelsblatt.com\/adv\/firmen\/cloud-computing-deutschland-statistik.html. Accessed on 22 Jan 2023"},{"issue":"11","key":"781_CR3","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L., et al.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"781_CR4","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"781_CR5","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2014ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part I 23, pp. 409\u2013437 (2017). Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"781_CR6","unstructured":"OpenFHE organization: OpenFHE. OpenFHE organization. Online available under https:\/\/www.openfhe.org\/. Accessed on 17 Jan 2023"},{"issue":"2","key":"781_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1111\/j.2517-6161.1964.tb00553.x","volume":"26","author":"GE Box","year":"1964","unstructured":"Box, G.E., Cox, D.R.: An analysis of transformations. J. R. Stat. Soc.: Ser. B (Methodol.) 26(2), 211\u2013243 (1964)","journal-title":"J. R. Stat. Soc.: Ser. B (Methodol.)"},{"key":"781_CR8","doi-asserted-by":"crossref","unstructured":"Bauer, A., Z\u00fcfle, M., Herbst, N., Kounev, S., Curtef, V.: Telescope: An automatic feature extraction and transformation approach for time series forecasting on a level-playing field. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1902\u20131905 (2020). IEEE","DOI":"10.1109\/ICDE48307.2020.00199"},{"key":"781_CR9","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, second edition edn. Chapman Hall, CRC Cryptography and Network Security. CRC Press, Boca Raton ; London ; New York (2015)"},{"issue":"3","key":"781_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53(3), 97\u2013105 (2010). https:\/\/doi.org\/10.1145\/1666420.1666444","journal-title":"Commun. ACM"},{"key":"781_CR11","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"781_CR12","doi-asserted-by":"crossref","unstructured":"Okada, H., Cid, C., Hidano, S., Kiyomoto, S.: Linear depth integer-wise homomorphic division. In: IFIP International Conference on Information Security Theory and Practice, pp. 91\u2013106 (2019). Springer","DOI":"10.1007\/978-3-030-20074-9_8"},{"key":"781_CR13","doi-asserted-by":"crossref","unstructured":"Babenko, M., Golimblevskaia, E.: Euclidean division method for the homomorphic scheme ckks. In: 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus), pp. 217\u2013220 (2021). IEEE","DOI":"10.1109\/ElConRus51938.2021.9396347"},{"key":"781_CR14","unstructured":"Cetin, G.S., Doroz, Y., Sunar, B., Martin, W.J.: Arithmetic using word-wise homomorphic encryption. Cryptology ePrint Archive (2015)"},{"issue":"2","key":"781_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1504\/IJACT.2014.062738","volume":"3","author":"T Veugen","year":"2014","unstructured":"Veugen, T.: Encrypted integer division and secure comparison. Int. J. Appl. Cryptogr. 3(2), 166\u2013180 (2014)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"781_CR16","doi-asserted-by":"crossref","unstructured":"Ugwuoke, C., Erkin, Z., Lagendijk, R.L.: Secure fixed-point division for homomorphically encrypted operands. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, pp. 1\u201310 (2018)","DOI":"10.1145\/3230833.3233272"},{"key":"781_CR17","doi-asserted-by":"crossref","unstructured":"Shortell, T., Shokoufandeh, A.: Secure signal processing using fully homomorphic encryption. In: International Conference on Advanced Concepts for Intelligent Vision Systems, pp. 93\u2013104 (2015). Springer","DOI":"10.1007\/978-3-319-25903-1_9"},{"key":"781_CR18","unstructured":"Rahulamathavan, Y.: Privacy-preserving similarity calculation of speaker features using fully homomorphic encryption. arXiv preprint arXiv:2202.07994 (2022)"},{"key":"781_CR19","unstructured":"Qu, H., Xu, G.: Improvements of homomorphic evaluation of inverse square root. Available at SSRN 4258571"},{"key":"781_CR20","doi-asserted-by":"crossref","unstructured":"Panda, S.: Principal component analysis using CKKS homomorphic scheme. In: International Symposium on Cyber Security Cryptography and Machine Learning, pp. 52\u201370 (2021). Springer","DOI":"10.1007\/978-3-030-78086-9_4"},{"key":"781_CR21","doi-asserted-by":"crossref","unstructured":"Panda, S.: Polynomial approximation of inverse sqrt function for fhe. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-07689-3_27"},{"key":"781_CR22","doi-asserted-by":"publisher","unstructured":"Gusani, S.: Efficient implementation of homomorphic encryption and its application. PhD thesis (2015). https:\/\/doi.org\/10.13140\/RG.2.2.14049.92007","DOI":"10.13140\/RG.2.2.14049.92007"},{"key":"781_CR23","doi-asserted-by":"crossref","unstructured":"Khanna, S., Rafferty, C.: Accelerating homomorphic encryption using approximate computing techniques. In: ICETE (2), pp. 380\u2013387 (2020)","DOI":"10.5220\/0009828803800387"},{"key":"781_CR24","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: International Conference on Selected Areas in Cryptography, pp. 347\u2013368 (2019). Springer","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"781_CR25","doi-asserted-by":"crossref","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 648\u2013677 (2021). Springer","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"781_CR26","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables vol. 55. US Government printing office, Washington, DC, 20402 (1964)"},{"key":"781_CR27","first-page":"758","volume":"2018","author":"C Boura","year":"2018","unstructured":"Boura, C., Gama, N., Georgieva, M.: Chimera: a unified framework for b\/fv, tfhe and heaan fully homomorphic encryption and predictions for deep learning. IACR Cryptol. ePrint Arch. 2018, 758 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"781_CR28","doi-asserted-by":"crossref","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Annual International Cryptology Conference, pp. 483\u2013512 (2018). Springer","DOI":"10.1007\/978-3-319-96878-0_17"},{"issue":"3","key":"781_CR29","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TSC.2017.2711018","volume":"13","author":"A Chatterjee","year":"2017","unstructured":"Chatterjee, A., Sengupta, I.: Sorting of fully homomorphic encrypted cloud data: can partitioning be effective? IEEE Trans. Serv. Comput. 13(3), 545\u2013558 (2017)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"781_CR30","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, M., Kim, M.: Search-and-compute on encrypted data. In: International Conference on Financial Cryptography and Data Security, pp. 142\u2013159 (2015). Springer","DOI":"10.1007\/978-3-662-48051-9_11"},{"key":"781_CR31","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster packed homomorphic operations and efficient circuit bootstrapping for tfhe. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 377\u2013408 (2017). Springer","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"781_CR32","doi-asserted-by":"crossref","unstructured":"Crawford, J.L., Gentry, C., Halevi, S., Platt, D., Shoup, V.: Doing real work with fhe: the case of logistic regression. In: Proceedings of the 6th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp. 1\u201312 (2018)","DOI":"10.1145\/3267973.3267974"},{"key":"781_CR33","doi-asserted-by":"crossref","unstructured":"Emmadi, N., Gauravaram, P., Narumanchi, H., Syed, H.: Updates on sorting of fully homomorphic encrypted data. In: 2015 International Conference on Cloud Computing Research and Innovation (ICCCRI), pp. 19\u201324 (2015). IEEE","DOI":"10.1109\/ICCCRI.2015.28"},{"key":"781_CR34","doi-asserted-by":"crossref","unstructured":"Kocabas, O., Soyata, T.: Utilizing homomorphic encryption to implement secure and private medical cloud computing. In: 2015 IEEE 8th International Conference on Cloud Computing, pp. 540\u2013547 (2015). IEEE","DOI":"10.1109\/CLOUD.2015.78"},{"key":"781_CR35","first-page":"329","volume":"16","author":"M Togan","year":"2015","unstructured":"Togan, M., Morogan, L., Plesca, C.: Comparison-based applications for fully homomorphic encrypted data. Proc. Roman. Acad.-Ser. A: Math. Phys. Tech. Sci. Inf. Sci. 16, 329 (2015)","journal-title":"Proc. Roman. Acad.-Ser. A: Math. Phys. Tech. Sci. Inf. Sci."},{"key":"781_CR36","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, D., Kim, D., Lee, H.H., Lee, K.: Numerical method for comparison on homomorphically encrypted numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 415\u2013445 (2019). Springer","DOI":"10.1007\/978-3-030-34621-8_15"},{"key":"781_CR37","doi-asserted-by":"publisher","first-page":"30039","DOI":"10.1109\/ACCESS.2022.3159694","volume":"10","author":"J-W Lee","year":"2022","unstructured":"Lee, J.-W., Kang, H., Lee, Y., Choi, W., Eom, J., Deryabin, M., Lee, E., Lee, J., Yoo, D., Kim, Y.-S., et al.: Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10, 30039\u201330054 (2022)","journal-title":"IEEE Access"},{"key":"781_CR38","doi-asserted-by":"crossref","unstructured":"Al\u00a0Badawi, A., Jin, C., Lin, J., Mun, C.F., Jie, S.J., Tan, B.H.M., Nan, X., Aung, K.M.M., Chandrasekhar, V.R.: Towards the alexnet moment for homomorphic encryption: HCNN, the first homomorphic CNN on encrypted data with gpus. IEEE Trans. Emerg. Top. Comput. 9(3), 1330\u20131343 (2020)","DOI":"10.1109\/TETC.2020.3014636"},{"key":"781_CR39","unstructured":"Xie, P., Bilenko, M., Finley, T., Gilad-Bachrach, R., Lauter, K., Naehrig, M.: Crypto-nets: neural networks over encrypted data. arXiv preprint arXiv:1412.6181 (2014)"},{"issue":"2","key":"781_CR40","first-page":"675","volume":"15","author":"R Bhat","year":"2023","unstructured":"Bhat, R., Sunitha, N.R., Iyengar, S.S.: A probabilistic public key encryption switching scheme for secure cloud storage. Int. J. Inf. Technol. 15(2), 675\u2013690 (2023)","journal-title":"Int. J. Inf. Technol."},{"issue":"8","key":"781_CR41","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/12.609274","volume":"46","author":"SF Obermann","year":"1997","unstructured":"Obermann, S.F., Flynn, M.J.: Division algorithms and implementations. IEEE Trans. Comput. 46(8), 833\u2013854 (1997)","journal-title":"IEEE Trans. Comput."},{"key":"781_CR42","unstructured":"Markstein, P.: Software division and square root using gold schmidt\u2019s algorithms. In: Proceedings of the 6th Conference on Real Numbers and Computers (RNC\u20196), vol. 123, pp. 146\u2013157 (2004)"},{"key":"781_CR43","unstructured":"Rodeheffer, T.: Software integer division. Technick\u00e1 Zpr\u00e1va MSR-TR-2008-141, Microsoft Research (2008)"},{"issue":"4","key":"781_CR44","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/279232.279237","volume":"23","author":"AH Karp","year":"1997","unstructured":"Karp, A.H., Markstein, P.: High-precision division and square root. ACM Trans. Math. Softw. 23(4), 561\u2013589 (1997)","journal-title":"ACM Trans. Math. Softw."},{"key":"781_CR45","unstructured":"codebrowser: E_expf.c Source Code [glibc\/sysdeps\/ieee754\/flt-32\/e_expf.c] - Codebrowser. (2022). codebrowser. Online available under https:\/\/codebrowser.dev\/glibc\/glibc\/sysdeps\/ieee754\/flt-32\/e_expf.c.html. Accessed on 09 Dec 2022"},{"issue":"4","key":"781_CR46","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1162\/089976699300016467","volume":"11","author":"NN Schraudolph","year":"1999","unstructured":"Schraudolph, N.N.: A fast, compact approximation of the exponential function. Neural Comput. 11(4), 853\u2013862 (1999)","journal-title":"Neural Comput."},{"key":"781_CR47","doi-asserted-by":"publisher","unstructured":"Mal\u00edk, P.: High throughput floating point exponential function implemented in fpga. In: 2015 IEEE Computer Society Annual Symposium on VLSI, pp. 97\u2013100 (2015). https:\/\/doi.org\/10.1109\/ISVLSI.2015.61","DOI":"10.1109\/ISVLSI.2015.61"},{"key":"781_CR48","doi-asserted-by":"publisher","unstructured":"Nilsson, P., Shaik, A.U.R., Gangarajaiah, R., Hertz, E.: Hardware implementation of the exponential function using Taylor series. In: 2014 NORCHIP, pp. 1\u20134 (2014). https:\/\/doi.org\/10.1109\/NORCHIP.2014.7004740","DOI":"10.1109\/NORCHIP.2014.7004740"},{"key":"781_CR49","doi-asserted-by":"publisher","unstructured":"Dinechin, F.d., Pasca, B.: Floating-point exponential functions for dsp-enabled fpgas. In: 2010 International Conference on Field-Programmable Technology, pp. 110\u2013117 (2010). https:\/\/doi.org\/10.1109\/FPT.2010.5681764","DOI":"10.1109\/FPT.2010.5681764"},{"key":"781_CR50","doi-asserted-by":"publisher","unstructured":"Zaninetti, L.: Pad\u00e9 approximant and minimax rational approximation in standard cosmology. Galaxies 4(1) (2016). https:\/\/doi.org\/10.3390\/galaxies4010004","DOI":"10.3390\/galaxies4010004"},{"key":"781_CR51","doi-asserted-by":"crossref","unstructured":"Bojdi, Z.K., Ahmadi-Asl, S., Aminataei, A.: A new extended pade approximation and its application. Adv. Numer. Anal. (2013)","DOI":"10.1155\/2013\/263467"},{"issue":"4","key":"781_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.62.044038","volume":"62","author":"A Gupta","year":"2000","unstructured":"Gupta, A., Gopakumar, A., Iyer, B.R., Iyer, S.: Pad\u00e9 approximants for truncated post-newtonian neutron star models. Phys. Rev. D 62(4), 044038 (2000)","journal-title":"Phys. Rev. D"},{"key":"781_CR53","unstructured":"Wolfram: Pad\u00e9 Approximant. (2022). Wolfram. Online available under https:\/\/mathworld.wolfram.com\/PadeApproximant.html, Accessed on 12 Dec 2022"},{"key":"781_CR54","unstructured":"codebrowser: E_sqrt.c Source Code [glibc\/sysdeps\/ieee754\/dbl-64\/e_sqrt.c] - Codebrowser. (2022). codebrowser. Online available under https:\/\/codebrowser.dev\/glibc\/glibc\/sysdeps\/ieee754\/dbl-64\/e_sqrt.c.html#__ieee754_sqrt, Accessed on 13 Dec 2022"},{"key":"781_CR55","unstructured":"Lawrence University: Newton\u2019s Method. (2011). Lawrence University. Online available under http:\/\/www2.lawrence.edu\/fast\/GREGGJ\/Math420\/Sections_2_3_to_2_5.pdf, Accessed on 15 Dec 2022"},{"key":"781_CR56","unstructured":"Steihaug, T., Rogers, D.: Approximating cube roots of integers, after heron\u2019s metrica iii. 20. arXiv preprint arXiv:1905.03547 (2019)"},{"key":"781_CR57","doi-asserted-by":"publisher","unstructured":"Kosheleva, O.: Babylonian method of computing the square root: justifications based on fuzzy techniques and on computational complexity. In: NAFIPS 2009\u20132009 Annual Meeting of the North American Fuzzy Information Processing Society, pp. 1\u20136 (2009). https:\/\/doi.org\/10.1109\/NAFIPS.2009.5156463","DOI":"10.1109\/NAFIPS.2009.5156463"},{"key":"781_CR58","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-34621-8_15","volume-title":"Advances in Cryptology - ASIACRYPT 2019","author":"JH Cheon","year":"2019","unstructured":"Cheon, J.H., Kim, D., Kim, D., Lee, H.H., Lee, K.: Numerical method for comparison on homomorphically encrypted numbers. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology - ASIACRYPT 2019, pp. 415\u2013445. Springer, Cham (2019)"},{"key":"781_CR59","doi-asserted-by":"crossref","unstructured":"Halley, E.: Methodus nova accurata & facilis inveniendi radices \u00e6qnationum quarumcumque generaliter, sine pravi\u00e6 reductione. Philos. Trans. R. Soc. Lond. 18(210), 136\u2013148 (1707)","DOI":"10.1098\/rstl.1694.0029"},{"key":"781_CR60","unstructured":"Muller, J.-M., Muller, J.-M.: Elementary Functions. Springer, Spring Street, New York, NY 100013 (2006)"},{"key":"781_CR61","unstructured":"Hart, J.F.: Computer Approximations. Krieger Publishing Co., Inc., 1725 Krieger Lane, Malabar, Florida, 32950 (1978)"},{"key":"781_CR62","unstructured":"codebrowser: E_log.c Source Code [glibc\/sysdeps\/ieee754\/dbl-64\/e_log.c] - Codebrowser. (2022). codebrowser. Online available under https:\/\/codebrowser.dev\/glibc\/glibc\/sysdeps\/ieee754\/dbl-64\/e_log.c.html. Accessed on 13 Dec 2022"},{"key":"781_CR63","doi-asserted-by":"crossref","unstructured":"Thompson, I.: NIST Handbook of Mathematical Functions, edited by Frank WJ Olver, Daniel W. Ronald F. Boisvert, Charles W. Clark. Taylor & Francis, Lozier (2011)","DOI":"10.1080\/00107514.2011.582161"},{"key":"781_CR64","unstructured":"Kornerup, P., Muller, J.-M.: Choosing starting values for Newton\u2013Raphson computation of reciprocals, square-roots and square-root reciprocals. PhD thesis, INRIA, LIP (2003)"},{"issue":"1","key":"781_CR65","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02239012","volume":"46","author":"P Montuschi","year":"1991","unstructured":"Montuschi, P., Mezzalama, M.: Optimal absolute error starting values for Newton\u2013Raphson calculation of square root. Computing 46(1), 67\u201386 (1991)","journal-title":"Computing"},{"issue":"1","key":"781_CR66","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/for.3980120104","volume":"12","author":"VM Guerrero","year":"1993","unstructured":"Guerrero, V.M.: Time-series analysis supported by power transformations. J. Forecast. 12(1), 37\u201348 (1993)","journal-title":"J. Forecast."},{"key":"781_CR67","unstructured":"DescTools: Automatic Selection of Box Cox Transformation Parameter. DescTools. Online available under https:\/\/search.r-project.org\/CRAN\/refmans\/DescTools\/html\/BoxCoxLambda.html. Accessed on 17 Jan 2023"},{"key":"781_CR68","unstructured":"Monash University, Clayton, Australia: Guerrero\u2019s Method for Box Cox Lambda Selection. Monash University, Clayton, Australia. Online available under https:\/\/github.com\/tidyverts\/feasts\/blob\/master\/R\/guerrero.R. Accessed on 21 March 2023"},{"key":"781_CR69","unstructured":"Rob J Hyndman: Nybirths.dat. Rob J Hyndman. Online available under https:\/\/robjhyndman.com\/tsdldata\/data\/nybirths.dat, Accessed on 21 March 2023"},{"key":"781_CR70","unstructured":"GeeksforGeeks: Python | Box\u2013Cox Transformation. (2022). GeeksforGeeks. Online available under https:\/\/www.geeksforgeeks.org\/box-cox-transformation-using-python\/. Accessed on 9 March 2023"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-023-00781-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-023-00781-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-023-00781-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,3]],"date-time":"2024-11-03T13:15:27Z","timestamp":1730639727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-023-00781-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["781"],"URL":"https:\/\/doi.org\/10.1007\/s10207-023-00781-0","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}