Sciweavers

136 search results - page 10 / 28
» On the generation of multivariate polynomials which are hard...
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
14 years 7 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 10 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 8 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...
ANLP
2000
81views more  ANLP 2000»
13 years 9 months ago
Experimenting with the Interaction between Aggregation and Text Structuring
In natural language generation, different generation tasks often interact with each other in a complex way, which is hard to capture in the pipeline architecture described by Reit...
Hua Cheng
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 11 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith