Skip to main content
placeholder image

Efficient decryption algorithms for extension field cancellation type encryption schemes

Journal Article


Abstract


  • Extension Field Cancellation (EFC) was proposed by Alan et al. at PQCrypto 2016 as a new trapdoor for constructing secure multivariate encryption cryptographic schemes. Along with this trapdoor, two schemes EFC−p and EFC−pt2 that apply this trapdoor and some modifiers were proposed. Though their security seems to be high enough, their decryption efficiency has room for improvement. In this paper, we introduce a new and more efficient decryption approach for EFC−p and EFC−pt2, which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of EFC−p and EFC−pt2 by around 3.4 and 8.5 times, respectively, under 128-bit security parameters with our new designed private keys for them. Meanwhile, our approach does not interfere with the public key, so the security remains the same. The implementation results of both decryption algorithms for EFC−p and EFC−pt2 are also provided.

UOW Authors


  •   Wang, Yacheng (external author)
  •   Ikematsu, Yasuhiko (external author)
  •   Duong, Dung Hoang.
  •   Takagi, Tsuyoshi (external author)

Publication Date


  • 2018

Geographic Focus


Citation


  • Wang, Y., Ikematsu, Y., Duong, D. Hoang. & Takagi, T. (2018). Efficient decryption algorithms for extension field cancellation type encryption schemes. Lecture Notes in Computer Science, 10946 LNCS 487-501. Information Security and Privacy 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings

Scopus Eid


  • 2-s2.0-85049806525

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1957

Number Of Pages


  • 14

Start Page


  • 487

End Page


  • 501

Volume


  • 10946 LNCS

Place Of Publication


  • Germany

Abstract


  • Extension Field Cancellation (EFC) was proposed by Alan et al. at PQCrypto 2016 as a new trapdoor for constructing secure multivariate encryption cryptographic schemes. Along with this trapdoor, two schemes EFC−p and EFC−pt2 that apply this trapdoor and some modifiers were proposed. Though their security seems to be high enough, their decryption efficiency has room for improvement. In this paper, we introduce a new and more efficient decryption approach for EFC−p and EFC−pt2, which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of EFC−p and EFC−pt2 by around 3.4 and 8.5 times, respectively, under 128-bit security parameters with our new designed private keys for them. Meanwhile, our approach does not interfere with the public key, so the security remains the same. The implementation results of both decryption algorithms for EFC−p and EFC−pt2 are also provided.

UOW Authors


  •   Wang, Yacheng (external author)
  •   Ikematsu, Yasuhiko (external author)
  •   Duong, Dung Hoang.
  •   Takagi, Tsuyoshi (external author)

Publication Date


  • 2018

Geographic Focus


Citation


  • Wang, Y., Ikematsu, Y., Duong, D. Hoang. & Takagi, T. (2018). Efficient decryption algorithms for extension field cancellation type encryption schemes. Lecture Notes in Computer Science, 10946 LNCS 487-501. Information Security and Privacy 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings

Scopus Eid


  • 2-s2.0-85049806525

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1957

Number Of Pages


  • 14

Start Page


  • 487

End Page


  • 501

Volume


  • 10946 LNCS

Place Of Publication


  • Germany