Efficient decryption algorithms for extension field cancellation type encryption schemes

Yacheng Wang, Yasuhiko Ikematsu, Dung Hoang Duong, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present], which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present] are also provided.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings
EditorsWilly Susilo, Guomin Yang
PublisherSpringer Verlag
Pages487-501
Number of pages15
ISBN (Print)9783319936376
DOIs
Publication statusPublished - Jan 1 2018
Event23rd Australasian Conference on Information Security and Privacy, ACISP 2018 - Wollongong, Australia
Duration: Jul 11 2018Jul 13 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10946 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other23rd Australasian Conference on Information Security and Privacy, ACISP 2018
CountryAustralia
CityWollongong
Period7/11/187/13/18

Fingerprint

Field extension
Cancellation
Encryption
Cryptography
Efficient Algorithms
Public key
Speedup

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Wang, Y., Ikematsu, Y., Duong, D. H., & Takagi, T. (2018). Efficient decryption algorithms for extension field cancellation type encryption schemes. In W. Susilo, & G. Yang (Eds.), Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings (pp. 487-501). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10946 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_28

Efficient decryption algorithms for extension field cancellation type encryption schemes. / Wang, Yacheng; Ikematsu, Yasuhiko; Duong, Dung Hoang; Takagi, Tsuyoshi.

Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. ed. / Willy Susilo; Guomin Yang. Springer Verlag, 2018. p. 487-501 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10946 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, Y, Ikematsu, Y, Duong, DH & Takagi, T 2018, Efficient decryption algorithms for extension field cancellation type encryption schemes. in W Susilo & G Yang (eds), Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10946 LNCS, Springer Verlag, pp. 487-501, 23rd Australasian Conference on Information Security and Privacy, ACISP 2018, Wollongong, Australia, 7/11/18. https://doi.org/10.1007/978-3-319-93638-3_28
Wang Y, Ikematsu Y, Duong DH, Takagi T. Efficient decryption algorithms for extension field cancellation type encryption schemes. In Susilo W, Yang G, editors, Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. Springer Verlag. 2018. p. 487-501. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-93638-3_28
Wang, Yacheng ; Ikematsu, Yasuhiko ; Duong, Dung Hoang ; Takagi, Tsuyoshi. / Efficient decryption algorithms for extension field cancellation type encryption schemes. Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. editor / Willy Susilo ; Guomin Yang. Springer Verlag, 2018. pp. 487-501 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0445452f0a134173acc0223ec95bd692,
title = "Efficient decryption algorithms for extension field cancellation type encryption schemes",
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 [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present], which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present] are also provided.",
author = "Yacheng Wang and Yasuhiko Ikematsu and Duong, {Dung Hoang} and Tsuyoshi Takagi",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-93638-3_28",
language = "English",
isbn = "9783319936376",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "487--501",
editor = "Willy Susilo and Guomin Yang",
booktitle = "Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Efficient decryption algorithms for extension field cancellation type encryption schemes

AU - Wang, Yacheng

AU - Ikematsu, Yasuhiko

AU - Duong, Dung Hoang

AU - Takagi, Tsuyoshi

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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 [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present], which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present] are also provided.

AB - 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 [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present], which manages to avoid all redundant computation involved in the original decryption algorithms, and theoretically speed up the decryption process of [Formula Present] and [Formula Present] 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 [Formula Present] and [Formula Present] are also provided.

UR - http://www.scopus.com/inward/record.url?scp=85049806525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85049806525&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-93638-3_28

DO - 10.1007/978-3-319-93638-3_28

M3 - Conference contribution

AN - SCOPUS:85049806525

SN - 9783319936376

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 487

EP - 501

BT - Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings

A2 - Susilo, Willy

A2 - Yang, Guomin

PB - Springer Verlag

ER -