Algebraic Geometry in Coding Theory and Cryptography by Harald Niederreiter

By Harald Niederreiter

This textbook equips graduate scholars and complicated undergraduates with the required theoretical instruments for using algebraic geometry to details conception, and it covers fundamental purposes in coding idea and cryptography. Harald Niederreiter and Chaoping Xing give you the first particular dialogue of the interaction among nonsingular projective curves and algebraic functionality fields over finite fields. This interaction is key to investigate within the box at the present time, but before no different textbook has featured whole proofs of it. Niederreiter and Xing disguise classical purposes like algebraic-geometry codes and elliptic-curve cryptosystems in addition to fabric now not taken care of via different books, together with function-field codes, electronic nets, code-based public-key cryptosystems, and frameproof codes. Combining a scientific improvement of concept with a huge number of real-world functions, this is often the main complete but available advent to the sector available.Introduces graduate scholars and complicated undergraduates to the principles of algebraic geometry for purposes to details conception offers the 1st special dialogue of the interaction among projective curves and algebraic functionality fields over finite fields comprises functions to coding idea and cryptography Covers the most recent advances in algebraic-geometry codes beneficial properties functions to cryptography no longer handled in different books

Show description

Read or Download Algebraic Geometry in Coding Theory and Cryptography PDF

Similar cryptography books

The Cryptoclub: Using Mathematics to Make and Break Secret Codes

Sign up for the Cryptokids as they follow simple arithmetic to make and holiday mystery codes. This ebook has many hands-on actions which were confirmed in either study rooms and casual settings. vintage coding equipment are mentioned, resembling Caesar, substitution, Vigenère, and multiplicative ciphers in addition to the trendy RSA.

Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007. Proceedings

This e-book constitutes the refereed lawsuits of the 4th thought of Cryptography convention, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised complete papers provided have been conscientiously reviewed and chosen from 118 submissions. The papers are equipped in topical sections on encryption, universally composable safety, arguments and 0 wisdom, notions of safety, obfuscation, mystery sharing and multiparty computation, signatures and watermarking, deepest approximation and black-box mark downs, and key institution.

Codes over Rings: Proceedings of the Cimpa Summer School, Ankara, Turkey, 18-29 August 2008 (Series on Coding Theory and Cryptology)

This is often the complaints quantity of the overseas Centre for natural and utilized arithmetic summer time tuition direction held in Ankara, Turkey, in August 2008. members comprise Greferath, Honold, Landgev, Ling, Lopez, Nebe, Nechaev, A-zbudak, Sole, Wolfmann and wooden. the purpose is to offer a survey in primary parts and spotlight a few contemporary effects.

Additional resources for Algebraic Geometry in Coding Theory and Cryptography

Example text

A place P of F splits completely in the extension E/F if there are exactly [E : F ] places of E lying over P . 5) that if P splits completely in E/F , then e(Q|P ) = f (Q|P ) = 1 for each place Q of E lying over P . Given a place P of F , does there exist a place of E lying over it? There is an elegant argument in Ribenboim [105, Chapter 4, Theorem 1], which uses Zorn’s lemma and shows that any valuation of a field can be extended to any algebraic extension of the field. Explicit constructions of extended valuations can be found in Ribenboim [105, Chapter 4] and Weiss [129, Chapter 2].

Proof. Let P contain the point P . Without loss of generality, we may assume that the first coordinate of P is not zero. 3. 13. For positive integers m and r, an Fq -closed point of degree m splits into m Fq r -closed points of degree 1 if and only if m divides r. 1, we distinguish between affine and projective algebraic sets. We start with a discussion of affine algebraic sets. Let k[X] := k[x1 , . . , xn ] and k[X] := k[x1 , . . , xn ] be the polynomial rings over k and k, respectively, in the variables x1 , .

Pr }) is strictly bigger than the ideal I ({P1 , . . , Pr }). Choose an element fj from I ({P1 , . . , Pj −1 , Pj +1 , . . , Pr }) \ I ({P1 , . . , Pr }) for j = 1, . . , r. A L G E B R A I C VA R I E T I E S 49 Then it is easy to verify that f1 , . . , fr are linearly independent in the coordinate ring k[V ] which can be viewed as a vector space over k. Hence, r ≤ dimk (k[V ]). This implies that V is a finite set if k[V ] has a finite k-dimension. Conversely, suppose that V = {P1 , .

Download PDF sample

Rated 4.07 of 5 – based on 17 votes