Skip to main content
placeholder image

Reducing the key size of the SRP encryption scheme

Journal Article


Abstract


  • Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed in [8] a new multivariate encryption scheme called SRP, which is very efficient and resists all known attacks against multivariate schemes. However, the key sizes of the scheme are quite large. In this paper we propose a new strategy to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.

UOW Authors


  •   Duong, Dung Hoang.
  •   Petzoldt, Albrecht (external author)
  •   Takagi, Tsuyoshi (external author)

Publication Date


  • 2016

Geographic Focus


Citation


  • Duong, D. Hoang., Petzoldt, A. & Takagi, T. (2016). Reducing the key size of the SRP encryption scheme. Lecture Notes in Computer Science, 9723 427-434. Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II

Scopus Eid


  • 2-s2.0-84978795808

Ro Metadata Url


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

Number Of Pages


  • 7

Start Page


  • 427

End Page


  • 434

Volume


  • 9723

Place Of Publication


  • Germany

Abstract


  • Multivariate Public Key Cryptography (MPKC) is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed in [8] a new multivariate encryption scheme called SRP, which is very efficient and resists all known attacks against multivariate schemes. However, the key sizes of the scheme are quite large. In this paper we propose a new strategy to reduce the key size of the SRP scheme, which enables us to reduce the size of the public key by up to 54%. Furthermore, we can use the additional structure in the public key polynomials to speed up the encryption process of the scheme by up to 50%. We show by experiments that our modifications do not weaken the security of the scheme.

UOW Authors


  •   Duong, Dung Hoang.
  •   Petzoldt, Albrecht (external author)
  •   Takagi, Tsuyoshi (external author)

Publication Date


  • 2016

Geographic Focus


Citation


  • Duong, D. Hoang., Petzoldt, A. & Takagi, T. (2016). Reducing the key size of the SRP encryption scheme. Lecture Notes in Computer Science, 9723 427-434. Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II

Scopus Eid


  • 2-s2.0-84978795808

Ro Metadata Url


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

Number Of Pages


  • 7

Start Page


  • 427

End Page


  • 434

Volume


  • 9723

Place Of Publication


  • Germany