Coding Theory and Cryptology
The 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. Collects the expanded lecture notes of the tutorials as part of the program.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
access control algebraic function field applications authentication schemes authorization binary bits Boolean function certificate clone codeword coding theory coefficients consider construct correlation attack cryptography Cryptology cryptosystem decoding defined Definition denote Diffie-Hellman discrete logarithm distance distribution divisor domain elements elliptic curve encoding rule encryption entitlement example excluded users exists exponent 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 LFSRC LILI-II linear code LNCS lower bound mapping matrix method modulo Montgomery multiplicative nonlinear object parameters parity-check plaintext points policy management polynomial prime number principal privilege attributes probability problem Proof public key quadratic quadratic sieve quantum code quantum error random number result runtime secret key Section server Springer-Verlag stream ciphers subset Theorem valid vector Z/mZ Z/nZ