Abstract
This paper proposes how to accomplish encryption and decryption in conic curves cryptosystem over finite field GF(\(2^n\)) using tile self-assembly. Two parameters in ciphertext could be obtained by two separate models of point-multiplication, one of which changes the seed configuration with inputs to adapt the demands. The decryption process is fulfilled by a new designed tile assembly model containing three sub-models that respectively perform the operation of point-multiplication, the operation of negative point and the operation of point-addition. Assembly time complexity of the model to decrypt is \(\varTheta (n^3)\) and the space complexity is \( \varTheta (n^6)\).
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
Similar content being viewed by others
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Amarioarei, A., et al.: One dimensional DNA tiles self assembly model simulation. Int. J. Unconv. Comput. 13 (2018)
Barua, R., Das, S.: Finite field arithmetic using self-assembly of DNA tilings. In: Proceeding of the 2003 Congress on Evolutionary Computation (CEC 2003), vol. 4, pp. 2529–2536. IEEE (2003)
Cai, Y.Q., Lei, Z., Jin, Y.Y.: A public-key cryptosystem based on conic curve in finite field GF(2 n). Acta Electronica Sinica 34(8), 1464–1468 (2006)
Cheng, Z.: Computation of multiplicative inversion and division in GF(2(n)) by self-assembly of DNA tiles. J. Comput. Theor. Nanosci. 9(3), 336–346 (2012)
Gehani, A., LaBean, T., Reif, J.: DNA-based cryptography. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 167–188. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-24635-0_12
Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography, pp. 96–97. Springer, Heidelberg (2004)
Li, Y.: A tile assembly model to calculate point-multiplication on conic curves over finite field GF(\(2^n\)). In: Proceeding of 18th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2020), Exeter, UK. IEEE, December 2020 (in press)
Li, Y., Xiao, L.: Arithmetic computation using self-assembly of DNA tiles: point-addition on conic curves over finite field GF(\(2^n\)). In: Proceeding of 25th International Conference on Parallel and Distributed Systems (IPCADS 2019), Tianjin, China, pp. 888–895. IEEE, December 2019
Li, Y., Xiao, L., Hu, Y., Liang, A., Tian, L.: Parallel algorithms for cryptosystem on conic curves over finite field fp. In: Proceedings of 2010 9th International Conference on Grid and Cooperative Computing (GCC), pp. 163–167. IEEE (2010)
Lin, S., Wang, B., Li, Z.: Digital multisignature on the generalized conic curve over Zn. Comput. Secur. 28(1–2), 100–104 (2009)
Pan, L., Song, B., Nagar, A.K., Subramanian, K.: Language generating alphabetic flat splicing P systems. Theoret. Comput. Sci. 724, 28–34 (2018)
Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (2005)
Rakheja, P.: Integrating DNA computing in international data encryption algorithm (IDEA). Int. J. Comput. Appl. 26(3), 1–6 (2011)
Tanaka, K., Okamoto, A., Saito, I.: Public-key system using DNA as a one-way function for key distribution. Biosystems 81(1), 25–29 (2005)
Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: some theory and experiments. DNA Based Comput. II II(44), 191–213 (1998)
Yuriy, B.: Nondeterministic polynomial time factoring in the tile assembly model. Theor. Comput. Sci. 395(1), 3–23 (2008)
Zhang, C., Zhu, W., Zhou, Q.: The algorithms of weightening based on DNA sticker model. In: Zhou, Q., Miao, Q., Wang, H., Xie, W., Wang, Y., Lu, Z. (eds.) ICPCSEE 2018. CCIS, vol. 902, pp. 250–262. Springer, Singapore (2018). https://doi.org/10.1007/978-981-13-2206-8_22
Zkaynak, F., Yavuz, S.: Analysis and improvement of a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system. Nonlinear Dyn. 78(2), 1311–1320 (2014)
Acknowledgment
This study is sponsored by the National Natural Science Foundation of China under Grant No. 61702523 and the Fundamental Research Funds for the Central Universities under Grant No. 2020JKF303.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, Y. (2021). Encryption and Decryption in Conic Curves Cryptosystem Over Finite Field \(GF(2^n)\) Using Tile Self-assembly. In: Ning, L., Chau, V., Lau, F. (eds) Parallel Architectures, Algorithms and Programming. PAAP 2020. Communications in Computer and Information Science, vol 1362. Springer, Singapore. https://doi.org/10.1007/978-981-16-0010-4_14
Download citation
DOI: https://doi.org/10.1007/978-981-16-0010-4_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-0009-8
Online ISBN: 978-981-16-0010-4
eBook Packages: Computer ScienceComputer Science (R0)