# Worst-case complexity, average-case complexity and lattice problems.

Documenta Mathematica (1998)

- page 421-428
- ISSN: 1431-0643

## Access Full Article

top## How to cite

topAjtai, Miklós. "Worst-case complexity, average-case complexity and lattice problems.." Documenta Mathematica (1998): 421-428. <http://eudml.org/doc/227634>.

@article{Ajtai1998,

author = {Ajtai, Miklós},

journal = {Documenta Mathematica},

keywords = {lattice; worst-case; average-case; complexity; basis; shortest vector; public-key cryptosystem},

language = {eng},

pages = {421-428},

publisher = {Universiät Bielefeld, Fakultät für Mathematik},

title = {Worst-case complexity, average-case complexity and lattice problems.},

url = {http://eudml.org/doc/227634},

year = {1998},

}

TY - JOUR

AU - Ajtai, Miklós

TI - Worst-case complexity, average-case complexity and lattice problems.

JO - Documenta Mathematica

PY - 1998

PB - Universiät Bielefeld, Fakultät für Mathematik

SP - 421

EP - 428

LA - eng

KW - lattice; worst-case; average-case; complexity; basis; shortest vector; public-key cryptosystem

UR - http://eudml.org/doc/227634

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.