We shortly review the Polly Cracker family of cryptosystems. Apparently all the cryptosystems of this family have not resisted even the simplest attacks, through more or less clever linear algebra, as predicted in \cite{barkee}. See \cite{polly} for an update. We review and extend these attacks, and show that the binomial ideals, and especially the lattice ideals, as skecthed in \cite{gb-issac}, might provide secure cryptosystems, also in comparison with other lattice cryptosystems recently proposed.

Block lattice polly cracker, theory and practice

CABOARA, MASSIMO;TRAVERSO, CARLO
2008

Abstract

We shortly review the Polly Cracker family of cryptosystems. Apparently all the cryptosystems of this family have not resisted even the simplest attacks, through more or less clever linear algebra, as predicted in \cite{barkee}. See \cite{polly} for an update. We review and extend these attacks, and show that the binomial ideals, and especially the lattice ideals, as skecthed in \cite{gb-issac}, might provide secure cryptosystems, also in comparison with other lattice cryptosystems recently proposed.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/200710
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact