Algebraic Curves and Cryptography

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).

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Similar books

• 

  Cryptography and Network Security: Principles and Practice

  By William Stallings

  In addition to the potential vulnerability of the various communications links,the various processors along the path are themselves subject to attack.An attack can take the form of attempts to modify the hardware or software,to gain ...

• 

  Algebraic Geometry Codes: Advanced Chapters

  By Michael Tsfasman, Serge Vlǎduţ, Dmitry Nogin

  p and for d one has the following Tsfasman–Serre-Sørensen bound: d > 0m - (rq”-1 +0m-2) F (q – T -- 1)4"-", which is an immediately corollary of the following fact. THEOREM 11.1.1. If P e Pro, \{0}, r < q+1, then the zero locus SP ={a e&nbsp;...

• 

  Rank Distance Bicodes and Their Generalization

  By W. B. Vasantha Kandasamy, Florentin Smarandache, N. Suresh Babu

  W. B. Vasantha Kandasamy, Florentin Smarandache, N. Suresh Babu, R.S. Selvaraj. Again, GF(2*) can be considered as a linear space of dimension 'N' over GF(2). Hence an element x e GF(2") has a representation as a N-tuple (oil, Ojo,&nbsp;...

• 

  Designing with Web Standards

  By Jeffrey Zeldman

  ... while you weren't looking , the result is what you see in Figure 16.10 . 16.10 The sidebar is filled at last . daily report glamorous classics about contact essentials pubs tour abc abc RAPPY COE stu WTRemix Go ! Toggle Externals .

• 

  高质量程序设计艺术

  By Diomidis Spinellis, 斯皮内利斯

  本书论述阅读与编写软件代码的方法,重点讨论软件代码的质量属性,包括了软件系统的可靠性、可移植性、可用性、互操作性、适应性、可信性以及可维护性等方面。

• 

  代码质量

  By Diomidis Spinellis

  本书重点讨论代码的非功能特性,深入讲述代码如何满足重要的非功能性需求,如可靠性、安全性、可移植性和可维护性,以及时间效率和空间效率。

• 

  信息研究论

  By 晓宾·卢

  东北师范大学图书出版基金项目

• 

  信息论与编码

  By 陈新, 陈运, 周亮

  本书系统介绍和论述了信息的基本概念;信息论的起源, 发展及研究内容;香农信息论的三个基本概念;信源熵, 信道容量和信息率失真函数, 以及与这三个概念相对应的三个编码定理 ...

• 

  信息论与编码

  By 陈新, 陈运, 周亮

  高等学校电子信息科学与工程专业教材

• 

  Cryptography and Network Security: Principles and Practice

  By William Stallings

  Blocks are labeled .The last block my be null or may contain from 1 to 127 bits.In other words, the input to the XTS-AES algorithm consists of 128-bit blocks and possibly a final partial block. m P 0 , P1, Á , Pm For encryption and&nbsp;...