A public key cryptosystem based on sparse polynomials

D Grant; K Krastev; D Lieman; Igor Shparlinski

doi:10.1007/978-3-642-57189-3

A public key cryptosystem based on sparse polynomials

D Grant^*, K Krastev, D Lieman, Igor Shparlinski

^*Corresponding author for this work

Macquarie University

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

Abstract

This paper introduces a new type of cryptosystem which is based on sparse polynomials over finite fields. We evaluate its theoretic characteristics and give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.

Original language	English
Title of host publication	Coding theory, cryptography and related areas
Editors	J Buchmann, T Hoholdt, H Stichtenoth, H TapiaRecillas
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	114-121
Number of pages	8
ISBN (Print)	3540662480
DOIs	https://doi.org/10.1007/978-3-642-57189-3
Publication status	Published - 2000
Event	International Conference on Coding Theory, Cryptography and Related Areas - GUANAJUATO, Mexico Duration: 20 Apr 1998 → 24 Apr 1998

Conference

Conference	International Conference on Coding Theory, Cryptography and Related Areas
Country/Territory	Mexico
City	GUANAJUATO
Period	20/04/98 → 24/04/98

Access to Document

10.1007/978-3-642-57189-3

Cite this

@inproceedings{e8dcb15c5c3346e19fa7a48c97cb6583,

title = "A public key cryptosystem based on sparse polynomials",

abstract = "This paper introduces a new type of cryptosystem which is based on sparse polynomials over finite fields. We evaluate its theoretic characteristics and give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.",

author = "D Grant and K Krastev and D Lieman and Igor Shparlinski",

year = "2000",

doi = "10.1007/978-3-642-57189-3",

language = "English",

isbn = "3540662480",

pages = "114--121",

editor = "J Buchmann and T Hoholdt and H Stichtenoth and H TapiaRecillas",

booktitle = "Coding theory, cryptography and related areas",

publisher = "Springer, Springer Nature",

address = "United States",

note = "International Conference on Coding Theory, Cryptography and Related Areas ; Conference date: 20-04-1998 Through 24-04-1998",

}

Grant, D, Krastev, K, Lieman, D & Shparlinski, I 2000, A public key cryptosystem based on sparse polynomials. in J Buchmann, T Hoholdt, H Stichtenoth & H TapiaRecillas (eds), Coding theory, cryptography and related areas. Springer, Springer Nature, Berlin, pp. 114-121, International Conference on Coding Theory, Cryptography and Related Areas, GUANAJUATO, Mexico, 20/04/98. https://doi.org/10.1007/978-3-642-57189-3

A public key cryptosystem based on sparse polynomials. / Grant, D; Krastev, K; Lieman, D et al.

Coding theory, cryptography and related areas. ed. / J Buchmann; T Hoholdt; H Stichtenoth; H TapiaRecillas. Berlin : Springer, Springer Nature, 2000. p. 114-121.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A public key cryptosystem based on sparse polynomials

AU - Grant, D

AU - Krastev, K

AU - Lieman, D

AU - Shparlinski, Igor

PY - 2000

Y1 - 2000

N2 - This paper introduces a new type of cryptosystem which is based on sparse polynomials over finite fields. We evaluate its theoretic characteristics and give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.

AB - This paper introduces a new type of cryptosystem which is based on sparse polynomials over finite fields. We evaluate its theoretic characteristics and give some security analysis. Some preliminary timings are presented as well, which compare quite favourably with published optimized RSA timings. We believe that similar ideas can be used in some other settings as well.

U2 - 10.1007/978-3-642-57189-3

DO - 10.1007/978-3-642-57189-3

M3 - Conference proceeding contribution

SN - 3540662480

SP - 114

EP - 121

BT - Coding theory, cryptography and related areas

A2 - Buchmann, J

A2 - Hoholdt, T

A2 - Stichtenoth, H

A2 - TapiaRecillas, H

PB - Springer, Springer Nature

CY - Berlin

T2 - International Conference on Coding Theory, Cryptography and Related Areas

Y2 - 20 April 1998 through 24 April 1998

ER -

A public key cryptosystem based on sparse polynomials

Abstract

Conference

Access to Document

Fingerprint

Cite this