1. DSpace at MEDIU
  2. Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
  3. MIT Items
Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6813
Full metadata record
DC FieldValueLanguage
dc.creatorLaMacchia, Brian A.-
dc.date2004-10-20T19:57:53Z-
dc.date2004-10-20T19:57:53Z-
dc.date1991-06-01-
dc.date.accessioned2013-10-09T02:47:02Z-
dc.date.available2013-10-09T02:47:02Z-
dc.date.issued2013-10-09-
dc.identifierAITR-1283-
dc.identifierhttp://hdl.handle.net/1721.1/6813-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionThis thesis investigates a new approach to lattice basis reduction suggested by M. Seysen. Seysen's algorithm attempts to globally reduce a lattice basis, whereas the Lenstra, Lenstra, Lovasz (LLL) family of reduction algorithms concentrates on local reductions. We show that Seysen's algorithm is well suited for reducing certain classes of lattice bases, and often requires much less time in practice than the LLL algorithm. We also demonstrate how Seysen's algorithm for basis reduction may be applied to subset sum problems. Seysen's technique, used in combination with the LLL algorithm, and other heuristics, enables us to solve a much larger class of subset sum problems than was previously possible.-
dc.format110 p.-
dc.format18362928 bytes-
dc.format6467561 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAITR-1283-
dc.subjectsubset sum problems-
dc.subjectknapsack cryptosystems-
dc.subjectpublic keyscryptography-
dc.subjectinteger lattice-
dc.subjectSeysen's algorithm-
dc.subjectlattice basissreduction-
dc.titleBasis Reduction Algorithms and Subset Sum Problems-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.