Sciweavers

76 search results - page 11 / 16
» A sieve algorithm for the shortest lattice vector problem
Sort
View
JC
2008
128views more  JC 2008»
13 years 7 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
JOC
2002
99views more  JOC 2002»
13 years 7 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
APIN
2004
107views more  APIN 2004»
13 years 7 months ago
Designing Polymer Blends Using Neural Networks, Genetic Algorithms, and Markov Chains
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
N. K. Roy, Walter D. Potter, D. P. Landau
IJACT
2008
158views more  IJACT 2008»
13 years 7 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
ASIACRYPT
2005
Springer
14 years 1 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern