Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
暂无分享,去创建一个
[1] Jean-Sébastien Coron. Cryptanalysis of the Repaired Public-key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2003, IACR Cryptol. ePrint Arch..
[2] Daniel Augot,et al. A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2003, EUROCRYPT.
[3] Jean-Sébastien Coron. Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem , 2004, Public Key Cryptography.
[4] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[5] Daniel Augot,et al. Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003 , 2003, IACR Cryptol. ePrint Arch..
[6] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[7] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[8] Vasek Chvátal,et al. The tail of the hypergeometric distribution , 1979, Discret. Math..
[9] R. McEliece. The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes , 2003 .
[10] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[11] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.