Coding Theory And CryptologyThe inaugural research program of the Institute for Mathematical Sciences at the National University of Singapore took place from July to December 2001 and was devoted to coding theory and cryptology. As part of the program, tutorials for graduate students and junior researchers were given by world-renowned scholars. These tutorials covered fundamental aspects of coding theory and cryptology and were designed to prepare for original research in these areas. The present volume collects the expanded lecture notes of these tutorials. The topics range from mathematical areas such as computational number theory, exponential sums and algebraic function fields through coding-theory subjects such as extremal problems, quantum error-correcting codes and algebraic-geometry codes to cryptologic subjects such as stream ciphers, public-key infrastructures, key management, authentication schemes and distributed system security. |
Contents
| 1 | |
Analysis and Design Issues for Synchronous Stream Ciphers | 49 |
Quantum ErrorCorrecting Codes | 91 |
Public Key Infrastructures | 143 |
Computational Methods in Public Key Cryptology | 175 |
Detecting and Revoking Compromised Keys | 239 |
Algebraic Function Fields Over Finite Fields | 259 |
Authentication Schemes | 283 |
Exponential Sums in Coding Theory Cryptology and Algorithms | 323 |
Principles and Practice | 385 |
Introduction to Algebraic Geometry Codes | 435 |
Other editions - View all
Coding Theory and Cryptology National University of Singapore. Institute for Mathematical Sciences No preview available - 2002 |
Common terms and phrases
access control algebraic function field applications authentication schemes authorization binary bits Boolean function certificate clone codeword coding theory consider construct correlation attack cryptography Cryptology cryptosystems decoding defined Definition denote discrete logarithm distance distribution divisor domain elements elliptic curve encoding rule encryption entitlement example excluded users exponential sums factor field sieve finite field given group key Hamming Hamming bound I. E. Shparlinski IEEE Trans integer irreducible polynomial keystream Lecture Notes Lemma Lenstra LFSR LILI-II linear code LNCS lower bound Math matrix method modulo Montgomery multiplicative nonlinear number field object parameters parity-check plaintext policy management polynomial prime number principal privilege attributes problem Proof public key quadratic quadratic sieve quantum code random number result runtime secret key Section server sieve Springer-Verlag stream ciphers subset Theorem valid vector Z/nZ