9780792376880 - complexity of lattice problems: a cryptographic perspective: 671 (the springer international series in engineering and computer science, 671) de micciancio, daniele; goldwasser, s.; goldwasser, shafi (14 resultados)
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: Books From California, Simi Valley, CA, Estados Unidos de AmericaBooks From California
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Excelente
EUR 174,40
Envío por EUR 4,39Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: Fine.
- Más imágenes
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 238,06
Envío por EUR 2,32Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de AmericaBennettBooksLtd
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 251,08
Envío por EUR 6,11Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
hardcover. Condición: New. In shrink wrap. Looks like an interesting title.
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 247,66
Envío por EUR 17,53Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 252,27
Envío por EUR 14,00Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Más imágenes
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 281,16
Envío por EUR 2,32Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Más imágenes
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 280,07
Envío por EUR 17,53Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Más imágenes
Idioma: Inglés
Editorial: Kluwer Academic Publishers, US, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 302,94
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Hardback. Condición: New. 2002 ed. Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has attracted the attention of great mathematicians over the…last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.
- Más imágenes
Idioma: Inglés
Editorial: Springer US, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 250,30
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Gebunden. Condición: New.
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa blanda
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 285,56
Envío por EUR 75,98Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Paperback. Condición: New. 2002nd.
- Más imágenes
Idioma: Inglés
Editorial: Springer, Humana, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 310,11
Envío por EUR 62,61Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has attracted the atten…tion of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.
Idioma: Inglés
Editorial: Springer, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 240,46
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Más imágenes
Idioma: Inglés
Editorial: Springer, Humana Mär 2002, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 299,59
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has att…racted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems. 234 pp. Englisch.
- Más imágenes
Idioma: Inglés
Editorial: Springer, Humana Mär 2002, 2002
Serie: Libro 119 de 260 - The Springer International Series in Engineering and Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 299,59
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has attract…ed the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 234 pp. Englisch.
