Show simple item record

dc.contributor.authorSchneider, Michael
dc.contributor.authorBuchmann, Johannes
dc.contributor.editorFreiling, Felix C.
dc.date.accessioned2019-01-17T13:26:53Z
dc.date.available2019-01-17T13:26:53Z
dc.date.issued2010
dc.identifier.isbn978-3-88579-264-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/19786
dc.description.abstractWe present experimental results using lattice reduction algorithms. We choose the BKZ algorithm, that is the algorithm considered the strongest one in this area in practice. It is an important task to analyze the practical behaviour of lattice reduction algorithms, as the theoretical predictions are far from being practical. Our work helps choosing the right parameters for lattice reduction in practice. The experiments in this paper go beyond the results of Gama and Nguyen in their Eurocrypt 2008 paper. We give evidence of some facts stated in their work, concerning the runtime and the output quality of lattice reduction algorithms.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSicherheit 2010. Sicherheit, Schutz und Zuverlässigkeit
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-170
dc.subjectlattice reduction
dc.subjectLLL
dc.subjectBKZ
dc.subjecthermite-SVP
dc.titleExtended lattice reduction experiments using the BKZ algorithmen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages241-251
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBerlin
mci.conference.date5.-7. Oktober 2010


Files in this item

Thumbnail

Show simple item record