Sciweavers

24 search results - page 3 / 5
» On solving sparse algebraic equations over finite fields
Sort
View
RC
2002
96views more  RC 2002»
13 years 6 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
EUROCRYPT
2006
Springer
13 years 10 months ago
QUAD: A Practical Stream Cipher with Provable Security
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n <...
Côme Berbain, Henri Gilbert, Jacques Patarin
NIPS
2008
13 years 7 months ago
Accelerating Bayesian Inference over Nonlinear Differential Equations with Gaussian Processes
Identification and comparison of nonlinear dynamical system models using noisy and sparse experimental data is a vital task in many fields, however current methods are computation...
Ben Calderhead, Mark Girolami, Neil D. Lawrence
EUROCRYPT
2012
Springer
11 years 8 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 10 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski