설명
First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, 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 i
책 세부 정보
형식
킨들
페이지
330 페이지
언어
영어
출판됨
8월 12, 2011
출판사
Milliken
ISBN-10
6613311502
ISBN-13
9786613311504