- 期刊
Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF(2(superscript n))
並列摘要
The use of elliptic curve cryptography (ECC) when used as a public-key cryptosystem for encryption is such that if one has a message to encrypt, then they attempt to map it to some point in the prime subgroup of the elliptic curve by systematically modifying the message in a deterministic manner. The applications typically used for ECC are the key-exchange, digital signature or a hybrid encryption systems (ECIES) all of which avoid this problem. In this paper we provide a deterministic method that guarantees that the map of a message to an elliptic curve point can be made without any modification. This paper provides a solution to the open problem posed in [7] concerning the creation of a deterministic method to map arbitrary message to an elliptic curve.
延伸閱讀
- Liu, S. G., Hu, Y. Y., & Wei, L. (2021). Elliptic Curve Scalar Multiplication Algorithm Based on Side Channel Atomic Block over GF(2^m). International Journal of Network Security, 23(6), 1005-1011. https://doi.org/10.6633/IJNS.202111_23(6).07
- Liu, S. G., Hu, Y. Y., & Wei, L. (2021). Elliptic Curve Scalar Multiplication Algorithm Based on Side Channel Atomic Block over GF(2^m). International Journal of Network Security, 23(4), 569-575. https://doi.org/10.6633/IJNS.202107_23(4).03
- Teng, L., & Li, H. (2018). A High-efficiency Discrete Logarithm-based Multi-proxy Blind Signature Scheme via Elliptic Curve and Bilinear Mapping. International Journal of Network Security, 20(6), 1200-1205. https://doi.org/10.6633/IJNS.201811_20(6).20
- Lin, T. C. (2009). Algorithms on Elliptic Curves over Fields of Characteristic Two with Non-Adjacent Forms. International Journal of Network Security, 9(2), 117-120. https://doi.org/10.6633/IJNS.200909.9(2).03
- Liu, S. G., Wang, R. R., Li, Y. Q., & Zhai, C. L. (2019). An Improved Ternary Montgomery Ladder Algorithm on Elliptic Curves over GF(3^m). International Journal of Network Security, 21(3), 384-391. https://doi.org/10.6633/IJNS.201905_21(3).04