Polly Two : A New Algebraic Polynomial-based Public-Key Scheme |
| |
Authors: | Le Van Ly |
| |
Affiliation: | (1) Bundesamt für Sicherheit in der Informationstechnik (BSI), Godesberger Allee 185–189, 53175 Bonn, Germany |
| |
Abstract: | 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. |
| |
Keywords: | Combinatorially algebraic public-key cryptoschemes Polly Cracker EnRoot Linear-Algebra attacks Sparse polynomials System of algebraic equations Elimination ideals |
本文献已被 SpringerLink 等数据库收录! |