## Cryptography and Computational Number TheoryKwok Yan Lam, Igor Shparlinski, Huaxiong Wang, Chaoping Xing The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in Singapore in November 1999. Its aim was to stimulate further research in information and computer security as well as the design and implementation of number theoretic cryptosystems and other related areas. Another achievement of the meeting was the collaboration of mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government. The present volume comprises a selection of refereed papers originating from this event, presenting either a survey of some area or original and new results. They concern many different aspects of the field such as theory, techniques, applications and practical experience. It provides a state-of-the-art report on some number theoretical issues of significance to cryptography. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

III | 3 |

IV | 11 |

V | 15 |

VI | 25 |

VII | 33 |

VIII | 43 |

IX | 59 |

X | 69 |

XVIII | 165 |

XIX | 187 |

XX | 203 |

XXI | 227 |

XXII | 257 |

XXIII | 269 |

XXIV | 287 |

XXV | 303 |

### Other editions - View all

Cryptography and Computational Number Theory Kwok Y. Lam,Igor Shparlinski,Huaxiong Wang,Chaoping Xing Limited preview - 2013 |

Cryptography and Computational Number Theory Kwok Y Lam,Igor Shparlinski,Huaxiong Wang No preview available - 2001 |

Cryptography and Computational Number Theory Kwok Y. Lam,Igor Shparlinski,Huaxiong Wang,Chaoping Xing No preview available - 2012 |

### Common terms and phrases

Advances in Cryptology algebraic algorithm applied bias biases byte coefficients Comp complexity Computer Science construction correlation attack Crypto cryptographic cryptosystems cyclotomic numbers cyclotomy defined definition denote digital signatures discrete logarithm E-mail address elements elliptic curve encryption example exponential fc)-threshold finite fields given hard core functions hash function IEEE integer interactive proof system irregularly clocked keystream known lattice Lecture Notes Lemma LFSR linear LNCS lower bound Math matrix method minimum randomness mod q modulo multiplicative Notes in Computer number of points Number Theory obtain one-way function oracle output pair parameters participants polynomially bounded prime number primitive primitive polynomial private key probabilistic probability problem properties protocol run prove pseudoprime pseudorandom public key quadratic secret key secret sharing secret sharing scheme Section sequence Shparlinski signature scheme significant bits Springer-Verlag stream ciphers subset Theorem uniform distribution values vector verifier visual cryptography