Sciweavers

189 search results - page 8 / 38
» Interpolation of Functions Related to the Integer Factoring ...
Sort
View
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 9 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
ICASSP
2009
IEEE
14 years 2 months ago
A PDE characterization of the intrinsic mode functions
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...
El-Hadji Samba Diop, R. Alexandre, Abdel-Ouahab Bo...
ER
2007
Springer
167views Database» more  ER 2007»
13 years 11 months ago
An Unified Dynamic Description Logic Model for Databases: Relational Data, Relational Operations and Queries
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
Guoshun Hao, Shilong Ma, Yuefei Sui, Jianghua Lv
CRYPTO
2004
Springer
127views Cryptology» more  CRYPTO 2004»
14 years 27 days ago
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
Dario Catalano, David Pointcheval, Thomas Pornin
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan