logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Computational Cryptography: Algorithmic Aspects of Cryptology by Joppe Bos, Martijn Stam ISBN 9781108795937, 9781108848428, 9781108847407, 1108795935

  • SKU: EBN-37259942
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

0.0

0 reviews
Instant download (eBook) Computational Cryptography: Algorithmic Aspects of Cryptology after payment.
Authors:Joppe Bos, Martijn Stam
Pages:402 pages.
Year:2022
Editon:1
Publisher:Cambridge University Press
Language:english
File Size:8.43 MB
Format:pdf
ISBNS:9781108795937, 9781108848428, 9781108847407, 1108795935
Categories: Ebooks

Product desciption

(Ebook) Computational Cryptography: Algorithmic Aspects of Cryptology by Joppe Bos, Martijn Stam ISBN 9781108795937, 9781108848428, 9781108847407, 1108795935

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 Lenstra–Lenstra–Lovász 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.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products