Solving approximate SVP in an Ideal Lattice using a cluster

Member of
FAU Graduate Student Research
Contributors
Khadka, Bal K.
Magliveras, Spyros S.
Publisher
Florida Atlantic University
Date Issued
2014
EDTF Date Created
2014
Description
The shortest vector problem SVP is de ned as follows: For a given basis B of an integral
lattice L fi nd a vector v in L whose length is minimal. Here we present the result of our
experiments based on a hill climbing algorithm using a computer cluster and a number of parallel
executions of a standard basis reduction technique, such as LLL, to successfully reduce an initial
basis of L. We begin by reducing ideal lattices of relatively small dimension and progressively
reduce ideal lattices of higher dimension, beating several earlier published solutions to the
approximate SVP problem.
Note

The Fifth Annual Graduate Research Day was organized by Florida Atlantic University’s Graduate Student Association. Graduate students from FAU Colleges present abstracts of original research and posters in a competition for monetary prizes, awards, and recognition

Language
English
Type
Text
Genre
abstract
Form
application/pdf
Extent
1 p.
Identifier
FA00005827
Additional Information
The Fifth Annual Graduate Research Day was organized by Florida Atlantic University’s Graduate Student Association. Graduate students from FAU Colleges present abstracts of original research and posters in a competition for monetary prizes, awards, and recognition
FAU Student Research Digital Collection
Date Backup
2014
Date Created Backup
2014
Date Text
2014
Date Created (EDTF)
2014
Date Issued (EDTF)
2014
Extension


FAU

IID
FA00005827
Organizations
Attributed name: Graduate College
Person Preferred Name

Khadka, Bal K.
Physical Description

application/pdf
1 p.
PURL
http://purl.flvc.org/fau/fd/FA00005827
Related Item


Florida Atlantic University Digital Library Collections

Title Plain
Solving approximate SVP in an Ideal Lattice using a cluster
URL
http://purl.flvc.org/fau/fd/FA00005827
Use and Reproduction
Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Origin Information

2014
2014
Florida Atlantic University

Boca Raton, Fla.

Physical Location
Florida Atlantic University Libraries
Place

Boca Raton, Fla.
Sub Location
Digital Library
Title
Solving approximate SVP in an Ideal Lattice using a cluster
Other Title Info

Solving approximate SVP in an Ideal Lattice using a cluster