Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem

DOI10.1007/978-3-642-34129-8_5MaRDI QIDQ4913723zbMATH OpenOpenAlexFDO

Authors Jun Xu, Lei Hu, Siwei Sun

Publication date 8 April 2013

Published in Information and Communications Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34129-8_5

zbMATH Keywords

Combinatorial CryptosystemImplicit Polynomial RecoveryLatticeLLL AlgorithmPublic Key Cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public Key Cryptography – PKC 2004
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
• Cryptanalysis of a combinatorial public key cryptosystem
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
• scientific article; zbMATH DE number 2085200
• Cryptanalysis of two combinatorial public key cryptosystems
• Coding and Cryptography
• scientific article; zbMATH DE number 2009958
• scientific article; zbMATH DE number 426148

Cited in

(4)

• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
• Recovering short secret keys of RLCE in polynomial time
• Cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem
• Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice

This page was built for publication: Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem

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