A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
暂无分享,去创建一个
[1] Ronitt Rubinfeld,et al. Learning Polynomials with Queries: The Highly Noisy Case , 2000, SIAM J. Discret. Math..
[2] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[3] 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).
[4] Jacques Patarin,et al. Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms - Extended Version - , 1996 .
[5] Anne Canteaut,et al. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .
[6] F. Chabaud,et al. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511 , 1995 .
[7] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[8] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[9] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[10] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[11] Louis Granboulan,et al. Short Signatures in the Random Oracle Model , 2002, ASIACRYPT.