Sciweavers

1449 search results - page 138 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
TIT
2010
160views Education» more  TIT 2010»
15 years 1 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon
ACL
2011
14 years 10 months ago
Jointly Learning to Extract and Compress
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...
Taylor Berg-Kirkpatrick, Dan Gillick, Dan Klein
IACR
2011
120views more  IACR 2011»
14 years 6 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
13 years 8 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 8 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko