Muutke küpsiste eelistusi

Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project 1st ed. 2018 [Kõva köide]

Edited by , Edited by , Edited by , Edited by , Edited by , Edited by
  • Formaat: Hardback, 368 pages, kõrgus x laius: 235x155 mm, kaal: 887 g, 6 Illustrations, color; 17 Illustrations, black and white; VIII, 368 p. 23 illus., 6 illus. in color., 1 Hardback
  • Sari: Mathematics for Industry 29
  • Ilmumisaeg: 04-Aug-2017
  • Kirjastus: Springer Verlag, Singapore
  • ISBN-10: 9811050643
  • ISBN-13: 9789811050640
  • Kõva köide
  • Hind: 132,08 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 155,39 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 368 pages, kõrgus x laius: 235x155 mm, kaal: 887 g, 6 Illustrations, color; 17 Illustrations, black and white; VIII, 368 p. 23 illus., 6 illus. in color., 1 Hardback
  • Sari: Mathematics for Industry 29
  • Ilmumisaeg: 04-Aug-2017
  • Kirjastus: Springer Verlag, Singapore
  • ISBN-10: 9811050643
  • ISBN-13: 9789811050640
This book presents the mathematical background underlying security modeling in the context of next-generation cryptography. By introducing new mathematical results in order to strengthen information security, while simultaneously presenting fresh insights and developing the respective areas of mathematics, it is the first-ever book to focus on areas that have not yet been fully exploited for cryptographic applications such as representation theory and mathematical physics, among others.
 
Recent advances in cryptanalysis, brought about in particular by quantum computation and physical attacks on cryptographic devices, such as side-channel analysis or power analysis, have revealed the growing security risks for state-of-the-art cryptographic schemes. To address these risks, high-performance, next-generation cryptosystems must be studied, which requires the further development of the mathematical background of modern cryptography. More specifically, in order to avoid the security risks posed by adversaries with advanced attack capabilities, cryptosystems must be upgraded, which in turn relies on a wide range of mathematical theories.
 
This book is suitable for use in an advanced graduate course in mathematical cryptography, while also offering a valuable reference guide for experts.

Arvustused

The present volume is unique in that it focuses on cryptography's future. It wont come as a surprise to anyone in this field that the future is highly mathematical. this book is essentially a collection of research papers, and the prerequisites to understanding it are similar to that of a technical journal aimed at specialists. Summing Up: Recommended. Graduate students, researchers, faculty, and professionals. (C. Bauer, Choice, Vol. 55 (10), June, 2018) This engaging book looks at novel ideas that are worth exploring. I strongly recommend it for the intended audience: graduate students and researchers. Practitioners and libraries will also benefit from this book, which provides new perspectives. (S. V. Nagaraj, Computing Reviews, May, 2018)

Introduction to CREST Crypto-Math Project 1(16)
Tsuyoshi Takagi
Part I Mathematical Cryptography
Multivariate Public Key Cryptosystems
17(26)
Yasufumi Hashimoto
Code-Based Zero-Knowledge Protocols and Their Applications
43(20)
Kirill Morozov
Hash Functions Based on Ramanujan Graphs
63(18)
Hyungrok Jo
Pairings on Hyperelliptic Curves with Considering Recent Progress on the NFS Algorithms
81(16)
Masahiro Ishii
Efficient Algorithms for Isogeny Sequences and Their Cryptographic Applications
97(20)
Katsuyuki Takashima
Part II Mathematics Towards Cryptography
Spectral Degeneracies in the Asymmetric Quantum Rabi Model
117(22)
Cid Reyes-Bustos
Masato Wakayama
Spectra of Group-Subgroup Pair Graphs
139(20)
Kazufumi Kimoto
Ramanujan Cayley Graphs of the Generalized Quaternion Groups and the Hardy-Littlewood Conjecture
159(18)
Yoshinori Yamasaki
Uniform Random Number Generation and Secret Key Agreement for General Sources by Using Sparse Matrices
177(22)
Jun Muramatsu
Shigeki Miyake
Mathematical Approach for Recovering Secret Key from Its Noisy Version
199(22)
Noboru Kunihiro
Part III Lattices and Cryptography
Simple Analysis of Key Recovery Attack Against LWE
221(18)
Masaya Yasuda
A Mixed Integer Quadratic Formulation for the Shortest Vector Problem
239(18)
Keiji Kimura
Hayato Waki
On Analysis of Recovering Short Generator Problems via Upper and Lower Bounds of Dirichlet L.-Functions: Part 1
257(22)
Shingo Sugiyama
On Analysis of Recovering Short Generator Problems via Upper and Lower Bounds of Dirichlet L.-functions: Part 2
279(18)
Shinya Okumura
Recent Progress on Coppersmith's Lattice-Based Method: A Survey
297(18)
Yao Lu
Liqiang Peng
Noboru Kunihiro
Part IV Cryptographic Protocols
How to Strengthen the Security of Signature Schemes in the Leakage Models: A Survey
315(16)
Yuyu Wang
Keisuke Tanaka
Constructions for the IND-CCA1 Secure Fully Homomorphic Encryption
331(18)
Satoshi Yasuda
Fuyuki Kitagawa
Keisuke Tanaka
A Survey on Identity-Based Encryption from Lattices
349(18)
Goichiro Hanaoka
Shota Yamada
Index 367
Tsuyoshi Takagi

Professor, Kyushu University, Institute of Mathematics for Industry 

Masato Wakayama

Professor, Kyushu University, Institute of Mathematics for Industry 

Keisuke Tanaka

Associate Professor, Tokyo Institute of Technology, Department of Mathematical and Computing Sciences 

Noboru Kunihiro

Associate Professor, The University of Tokyo, Graduate School of Frontier Sciences 

Kazufumi Kimoto

Professor, University of the Ryukyus, Department of Mathematical Sciences

Dung Hoang Duong

Assistant Professor, Kyushu University, Institute of Mathematics for Industry