Sciweavers

313 search results - page 1 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
91
Voted
CASC
2009
Springer
152views Mathematics» more  CASC 2009»
14 years 7 months ago
Solving Structured Polynomial Systems and Applications to Cryptology
Jean-Charles Faugère
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 1 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
EUROCRYPT
2000
Springer
15 years 1 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...
ASIACRYPT
2005
Springer
15 years 3 months ago
An Analysis of the XSL Algorithm
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...
Carlos Cid, Gaëtan Leurent