RO EN
Private Key Extension of Polly Cracker Cryptosystems
Authors: Nina Taslaman
In this paper it is suggested that security, and possibly efficiency, of any Polly Cracker-type cryptosystem could be increased by altering the premises regarding private- and public information.
– 0.27 Mb
Abstract
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon generalized to a Dröbner basis formulation. Since then a handful of improvements of this construction has been proposed.In this paper it is suggested that security, and possibly efficiency, of any Polly Cracker-type cryptosystem could be increased by altering the premises regarding private- and public information.
Nina Taslaman
E-mail:
E-mail:
Fulltext
– 0.27 Mb
Contents
- Introduction
- A New Attempt On The F5 Criterion
- Some Remarks on Blowing-Ups in a Computer Algebra System
- Computing one of Victor Moll's irresistible integrals with computer algebra
- An algebraic approach to a study of two-dimensional affine differential system
- A zero-dimensional approach to compute real radicals
- Grobner Bases for Nonlinear DAE Systems of Analog Circuits
- Private Key Extension of Polly Cracker Cryptosystems
- On the Cancellation Rule in the Homogenization
- Approaches to automated construction of graphical shells for computer algebra systems
- Congratulations
