Applicable Algebra in Engineering, Communication and Computing

, Volume 17, Issue 3, pp 267-283

First online:

Polly Two : A New Algebraic Polynomial-based Public-Key Scheme

  • Le Van LyAffiliated withBundesamt für Sicherheit in der Informationstechnik (BSI) Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Since Fellows and Koblitz introduced the generic combinatorially algebraic public-key cryptosystem Polly Cracker in 1993, the question whether there exist secure and efficient instances of Polly Cracker remains unsettled. Namely, many of these schemes succumb to the Linear-Algebra Attacks by D. Naccache et al. and Lenstra. In this paper I present a public-key cryptoscheme Polly Two that is efficient and in some way a modified Polly-Cracker instance, but comprises techniques defending the linear-algebra attacks.


Combinatorially algebraic public-key cryptoschemes Polly Cracker EnRoot Linear-Algebra attacks Sparse polynomials System of algebraic equations Elimination ideals