Polly Cracker, Revisited

DOI10.1007/978-3-642-25385-0_10zbMath1227.94025OpenAlexW2168394333MaRDI QIDQ3102185

Jean-Charles Faugère, Pooya Farshim, Ludovic Perret, Martin R. Albrecht

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_10

zbMATH Keywords

Gröbner basesLWEPolly CrackerProvable securityPublic-key encryptionHomomorphic encryptionNoisy encoding

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (max. 100)

Polly cracker, revisited ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ Homomorphic encryption: a mathematical survey ⋮ On the complexity of the BKW algorithm on LWE ⋮ Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

Uses Software

• SageMath

This page was built for publication: Polly Cracker, Revisited