大葉大學圖書館 |

Computational cryptography[electronic resource] :algorithmic aspects of cryptology /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	005.824
書名/作者:	Computational cryptography : algorithmic aspects of cryptology // edited by Joppe W. Bos, NXP Semiconductors, Belgium, Martijn Stam, Simula UiB, Norway.
其他作者:	Bos, Joppe W.
出版者:	Cambridge : : Cambridge University Press,, 2021.
面頁冊數:	xii, 387 p. : : ill., digital ;; 24 cm.
附註:	Title from publisher's bibliographic system (viewed on 11 Nov 2021).
標題:	Cryptography.
ISBN:	9781108854207
ISBN:	9781108795937
摘要、提要註:	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-Lová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.
電子資源:	https://doi.org/10.1017/9781108854207

Computational cryptography[electronic resource] :algorithmic aspects of cryptology /
Computational cryptographyalgorithmic aspects of cryptology /[electronic resource] :edited by Joppe W. Bos, NXP Semiconductors, Belgium, Martijn Stam, Simula UiB, Norway. - Cambridge :Cambridge University Press,2021. - xii, 387 p. :ill., digital ;24 cm. - London Mathematical Society lecture note series ;469. - London Mathematical Society lecture note series ;402..

Title from publisher's bibliographic system (viewed on 11 Nov 2021).

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-Lová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.

ISBN: 9781108854207Subjects--Topical Terms:

381147
Cryptography.

LC Class. No.: QA268 / .C693 2021

Dewey Class. No.: 005.824

Computational cryptography[electronic resource] :algorithmic aspects of cryptology /
LDR:01916nmm a2200253 a 4500 001 539322
003 UkCbUP
005 20211112140652.0
006 m d
007 cr nn 008maaau
008 231121s2021 enk o 1 0 eng d
020 $a 9781108854207 $q (electronic bk.)
020 $a 9781108795937 $q (paperback)
035 $a CR9781108854207
040 $a UkCbUP $b eng $c UkCbUP $d GP
050 0 0 $a QA268 $b .C693 2021
082 0 0 $a 005.824 $2 23
090 $a QA268 $b .C738 2021
245 0 0 $a Computational cryptography $h [electronic resource] : $b algorithmic aspects of cryptology / $c edited by Joppe W. Bos, NXP Semiconductors, Belgium, Martijn Stam, Simula UiB, Norway.
260 $a Cambridge : $b Cambridge University Press, $c 2021.
300 $a xii, 387 p. : $b ill., digital ; $c 24 cm.
490 1 $a London Mathematical Society lecture note series ; $v 469
500 $a Title from publisher's bibliographic system (viewed on 11 Nov 2021).
520 $a 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-Lová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.
650 0 $a Cryptography. $3 381147
700 1 $a Bos, Joppe W. $3 767864
700 1 $a Stam, Martijn. $3 767865
830 0 $a London Mathematical Society lecture note series ; $v 402. $3 711187
856 4 0 $u https://doi.org/10.1017/9781108854207