Lattice Basis Reduction | Agenda Bookshop Skip to content
A01=Murray R. Bremner
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
Author_Murray R. Bremner
automatic-update
Basis B1
Basis Vectors
Basis X1
Basis Y1
Category1=Non-Fiction
Category=PBCD
Category=PBH
Category=UMB
Category=UY
combination
Computer Algebra System
COP=United Kingdom
Delivery_Pre-order
Elementary Row Operations
eq_computing
eq_isMigrated=2
eq_non-fiction
Euclidean Algorithm
Gaussian Algorithm
GCD.
Greatest Common Divisor
HNF.
Integer Vectors
integral
Integral Linear Combination
Language_English
Lattice Basis
Lattice Basis Reduction
Lattice Vector
linear
lll
Maple Code
P2 Reduce
PA=Not yet available
polynomial
Price_€50 to €100
PS=Forthcoming
Reduction Parameter
Short Lattice Vectors
shortest
Shortest Vector
softlaunch
time
vector
Vector V1
vectors
WEAK PARTITION
Product Image

Lattice Basis Reduction

★★★★★
★★★★★

English

By (author): Murray R. Bremner

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial factorization, and matrix canonical forms.

See more
€69.99
A01=Murray R. BremnerAge Group_UncategorizedalgorithmAuthor_Murray R. Bremnerautomatic-updateBasis B1Basis VectorsBasis X1Basis Y1Category1=Non-FictionCategory=PBCDCategory=PBHCategory=UMBCategory=UYcombinationComputer Algebra SystemCOP=United KingdomDelivery_Pre-orderElementary Row Operationseq_computingeq_isMigrated=2eq_non-fictionEuclidean AlgorithmGaussian AlgorithmGCD.Greatest Common DivisorHNF.Integer VectorsintegralIntegral Linear CombinationLanguage_EnglishLattice BasisLattice Basis ReductionLattice VectorlinearlllMaple CodeP2 ReducePA=Not yet availablepolynomialPrice_€50 to €100PS=ForthcomingReduction ParameterShort Lattice VectorsshortestShortest VectorsoftlaunchtimevectorVector V1vectorsWEAK PARTITION

Will deliver when available. Publication date 14 Oct 2024

Product Details
  • Weight: 453g
  • Dimensions: 156 x 234mm
  • Publication Date: 14 Oct 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Language: English
  • ISBN13: 9781032921822

About Murray R. Bremner

Murray R. Bremner received a Bachelor of Science from the University of Saskatchewan in 1981, a Master of Computer Science from Concordia University in Montreal in 1984, and a Doctorate in Mathematics from Yale University in 1989. He spent one year as a Postdoctoral Fellow at the Mathematical Sciences Research Institute in Berkeley, and three years as an Assistant Professor in the Department of Mathematics at the University of Toronto. He returned to the Department of Mathematics and Statistics at the University of Saskatchewan in 1993 and was promoted to Professor in 2002. His research interests focus on the application of computational methods to problems in the theory of linear nonassociative algebras, and he has had more than 50 papers published or accepted by refereed journals in this area.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept