Sciweavers

32 search results - page 4 / 7
» Polynomial Interpolation of the Discrete Logarithm
Sort
View
ASIACRYPT
2004
Springer
14 years 23 days ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
FOCM
2011
90views more  FOCM 2011»
12 years 11 months ago
Hamiltonian Interpolation of Splitting Approximations for Nonlinear PDEs
We consider a wide class of semi linear Hamiltonian partial diļ¬€erential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...
Erwan Faou, Benoît Grebert
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 21 days ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent ļ¬nite ļ¬eld elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 7 months ago
Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier--Stokes Equations
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
Per-Olof Persson, Jaime Peraire
BMCBI
2010
233views more  BMCBI 2010»
13 years 7 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...