Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

ARITH
2003
IEEE

78views Applied Computing» more ARITH 2003»

Worst Cases and Lattice Reduction

15 years 8 months ago

Worst Cases and Lattice Reduction

Download www.acsel-lab.com

Damien Stehlé, Vincent Lefèvre, Paul

Real-time Traffic

Applied Computing | ARITH 2003 |

claim paper

Related Content

» WorstCase to AverageCase Reductions Based on Gaussian Measures

» PublicKey Cryptosystems from the WorstCase Shortest Vector Problem

» Relativized Worlds without WorstCase to AverageCase Reductions for NP

» Concurrently Secure Identification Schemes Based on the WorstCase Hardness of Lattice Prob...

» Worst and averagecase complexity of LLL lattice reduction in MIMO wireless systems

» WorstCase to AverageCase Reductions Revisited

» On WorstCase to AverageCase Reductions for NP Problems

» Making NTRU as Secure as WorstCase Problems over Ideal Lattices

» Lattices that admit logarithmic worstcase to averagecase connection factors

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	ARITH
Authors	Damien Stehlé, Vincent Lefèvre, Paul Zimmermann

Comments (0)