Cryptanalysis of two sparse polynomial based public key cryptosystems

DOI10.1007/3-540-44586-2_11MaRDI QIDQ2724591zbMATH OpenFDO

Authors Robert H. Deng, Rainer Steinwandt, Hongjun Wu, Willi Geiselmann, Claus Peter Schnorr, Feng Bao

Publication date 16 July 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44586-2_11

zbMATH Keywords

cryptanalysispublic key encryption schemesparse polynomials

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A public key cryptosystem based on sparse polynomials
• Towards faster cryptosystem. II
• scientific article; zbMATH DE number 1925556
• Public Key Cryptography – PKC 2004
• scientific article; zbMATH DE number 4081459

Cited in

(5)

• Polly Two: a new algebraic polynomial-based public-key scheme
• Towards faster cryptosystem. II
• scientific article; zbMATH DE number 5009213 (Why is no real title available?)
• A public key cryptosystem based on sparse polynomials
• Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice

Describes a project that uses

Uses Software

• NTRU

This page was built for publication: Cryptanalysis of two sparse polynomial based public key cryptosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724591)