Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MARTIN ALBRECHT:
All reports by Author Martin Albrecht:

TR12-165 | 19th November 2012
Martin Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, Ludovic Perret

Polly Cracker, Revisited

We initiate the formal treatment of cryptographic constructions based on the hardness of computing remainders modulo an ideal in multivariate polynomial rings. Of particular interest to us is a class of schemes known as "Polly Cracker." We start by formalising and studying the relation between the ideal remainder problem and ... more >>>




ISSN 1433-8092 | Imprint