Algebraic curves and cryptography
Author(s)
Bibliographic Information
Algebraic curves and cryptography
(Fields Institute communications, v. 58)
American Mathematical Society, c2010
Available at 21 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
MUR||23||1200019997495
Note
Includes bibliographical references (p. 129-132) and index
Description and Table of Contents
Description
It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian groups and that algebraic geometry provides a supply of such groups through Abelian varieties over finite fields. Of special interest are the Abelian varieties that are Jacobians of algebraic curves. All of the articles in this volume are centered on the theme of point counting and explicit arithmetic on the Jacobians of curves over finite fields. The topics covered include Schoof's $\ell$-adic point counting algorithm, the $p$-adic algorithms of Kedlaya and Denef-Vercauteren, explicit arithmetic on the Jacobians of $C_{ab}$ curves and zeta functions. This volume is based on seminars on algebraic curves and cryptography held at the GANITA Lab of the University of Toronto during 2001-2008. The articles are mostly suitable for independent study by graduate students who wish to enter the field, both in terms of introducing basic material as well as guiding them in the literature. The literature in cryptography seems to be growing at an exponential rate. For a new entrant into the subject, navigating through this ocean can seem quite daunting. In this volume, the reader is steered toward a discussion of a few key ideas of the subject, together with some brief guidance for further reading. It is hoped that this approach may render the subject more approachable. Titles in this series are co-published with the Fields Institute for Research in Mathematical Sciences (Toronto, Ontario, Canada).|It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian groups and that algebraic geometry provides a supply of such groups through Abelian varieties over finite fields. Of special interest are the Abelian varieties that are Jacobians of algebraic curves. All of the articles in this volume are centered on the theme of point counting and explicit arithmetic on the Jacobians of curves over finite fields. The topics covered include Schoof's $\ell$-adic point counting algorithm, the $p$-adic algorithms of Kedlaya and Denef-Vercauteren, explicit arithmetic on the Jacobians of $C_{ab}$ curves and zeta functions. This volume is based on seminars on algebraic curves and cryptography held at the GANITA Lab of the University of Toronto during 2001-2008. The articles are mostly suitable for independent study by graduate students who wish to enter the field, both in terms of introducing basic material as well as guiding them in the literature. The literature in cryptography seems to be growing at an exponential rate. For a new entrant into the subject, navigating through this ocean can seem quite daunting. In this volume, the reader is steered toward a discussion of a few key ideas of the subject, together with some brief guidance for further reading. It is hoped that this approach may render the subject more approachable. Titles in this series are co-published with the Fields Institute for Research in Mathematical Sciences (Toronto, Ontario, Canada).
by "Nielsen BookData"