Titlebook: Cryptography and Lattices; International Confer Joseph H. Silverman Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Latt

舊病復(fù)發(fā)

尾巴

978-3-540-42488-8Springer-Verlag Berlin Heidelberg 2001

Biomarker

coltish

somnambulism

Joseph H. SilvermanIncludes supplementary material:

煩憂

elucidate

Sinus-Node

0302-9743 Overview: Includes supplementary material: 978-3-540-42488-8978-3-540-44670-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

高度表

魯莽

Behavioral Hardware Description Languages,.. We give a proof that the shortest vector problem is NP-complete in the max-norm for .-dimensional lattices . where ?./. has . — 1 cycles. We also give experimental data that show that the LLL algorithm does not perform significantly better on lattices with a high number of cycles.