Reducing the key size of the SRP encryption scheme

Dung Hoang Duong, Albrecht Petzoldt, Tsuyoshi Takagi

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

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings
EditorsJoseph K. Liu, Ron Steinfeld
PublisherSpringer Verlag
Number of pages8
ISBN (Print)9783319403663
Publication statusPublished - 2016
Event21st Australasian Conference on Information Security and Privacy, ACISP 2016 - Melbourne, Australia
Duration: Jul 4 2016Jul 6 2016

Publication series

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


Other21st Australasian Conference on Information Security and Privacy, ACISP 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Reducing the key size of the SRP encryption scheme'. Together they form a unique fingerprint.

Cite this