Sciweavers

116 search results - page 1 / 24
» Efficient and Secure Evaluation of Multivariate Polynomials ...
Sort
View
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 6 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
EUROCRYPT
2000
Springer
13 years 8 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
Nicolas Courtois, Alexander Klimov, Jacques Patari...
IACR
2011
126views more  IACR 2011»
12 years 4 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
JSC
2008
162views more  JSC 2008»
13 years 4 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 8 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...