Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 33,84
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Good. Shipping lable on the front of the cover from past owner.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 33,84
Cantidad disponible: 5 disponibles
Añadir al carritopaperback. Condición: Very Good.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 113,49
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 115,96
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 121,11
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 110,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Cambridge University Press 2021-12-02, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Chiron Media, Wallingford, Reino Unido
EUR 108,12
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 111,08
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 120,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 128,69
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 145,87
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 150,93
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 164,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Revaluation Books, Exeter, Reino Unido
EUR 152,73
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 400 pages. 9.06x5.94x0.87 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 142,30
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers will benefit from these leading experts' overviews of computational cryptography.
Idioma: Inglés
Publicado por Cambridge University Press, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 212,47
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 215,42
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 263 pages. 9.25x6.25x0.75 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 204,93
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Publicado por Cambridge University Press Okt 2017, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 185,25
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Peter L. Montgomery has made significant contributions to computational number theory, introducing many basic tools such as Montgomery multiplication, Montgomery simultaneous inversion, Montgomery curves, and the Montgomery ladder. This book features state-of-the-art research in computational number theory related to Montgomery's work and its impact on computational efficiency and cryptography. Topics cover a wide range of topics such as Montgomery multiplication for both hardware and software implementations; Montgomery curves and twisted Edwards curves as proposed in the latest standards for elliptic curve cryptography; and cryptographic pairings. This book provides a comprehensive overview of integer factorization techniques, including dedicated chapters on polynomial selection, the block Lanczos method, and the FFT extension for algebraic-group factorization algorithms. Graduate students and researchers in applied number theory and cryptography will benefit from this survey of Montgomery's work.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 115,83
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated LenstraLenstraLovasz lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards. This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers will benefit from these leading experts' overviews of computational cryptography. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Revaluation Books, Exeter, Reino Unido
EUR 113,13
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 400 pages. 9.06x5.94x0.87 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 116,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Majestic Books, Hounslow, Reino Unido
EUR 148,01
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: CitiRetail, Stevenage, Reino Unido
EUR 119,13
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated LenstraLenstraLovasz lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards. This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers will benefit from these leading experts' overviews of computational cryptography. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 164,64
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. Peter L. Montgomery has made significant contributions to computational number theory, introducing many basic tools such as Montgomery multiplication, Montgomery simultaneous inversion, Montgomery curves, and the Montgomery ladder. This book features state-of-the-art research in computational number theory related to Montgomery's work and its impact on computational efficiency and cryptography. Topics cover a wide range of topics such as Montgomery multiplication for both hardware and software implementations; Montgomery curves and twisted Edwards curves as proposed in the latest standards for elliptic curve cryptography; and cryptographic pairings. This book provides a comprehensive overview of integer factorization techniques, including dedicated chapters on polynomial selection, the block Lanczos method, and the FFT extension for algebraic-group factorization algorithms. Graduate students and researchers in applied number theory and cryptography will benefit from this survey of Montgomery's work. Written in honor of Peter L. Montgomery, this book surveys his many contributions to computational number theory and cryptography. For graduate students and researchers, it features state-of-the-art research by experts in the field focusing on the impact of Montgomery's ideas and algorithms on computational efficiency and cryptographic security. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 150,32
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Cambridge University Press, 2022
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: moluna, Greven, Alemania
EUR 114,84
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers w.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 168,33
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 263 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Cambridge University Press, 2017
ISBN 10: 1107109353 ISBN 13: 9781107109353
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 173,21
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108795935 ISBN 13: 9781108795937
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 163,76
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated LenstraLenstraLovasz lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards. This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers will benefit from these leading experts' overviews of computational cryptography. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.