Coding Theory, Cryptography and Related Areas
Proceedings of an International Conference on Coding Theory, Cryptography and Related Areas, held in Guanajuato, Mexico, in April 1998
Published on 23. November 1999
Book
Paperback/Softback
VIII, 260 pages
978-3-540-66248-8 (ISBN)
Description
The contributions in this book are at the cutting edge of cryptography - a field of ever-increasing importance for business applications such as financial transactions via the internet. The authors are top researchers in this field.
More details
Edition
2000 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 260 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
411 gr
ISBN-13
978-3-540-66248-8 (9783540662488)
DOI
10.1007/978-3-642-57189-3
Schweitzer Classification
Content
Modifications of the Rao-Nam Cryptosystem.- Efficient Reduction on the Jacobian Variety of Picard Curves.- Continued Fractions in Hyperelliptic Function Fields.- Discrete Logarithms: Recent Progress.- One-weight Z4-linear Codes.- Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y2 = xp - x + 1 Over a Finite Field of Odd Characteristic p.- On Weierstrass Semigroups and One-point Algebraic Geometry Codes.- On the Undetected Error Probability of m-out-of-n Codes on the Binary Symmetric Channel.- Skew Pyramids of Function Fields Are Asymptotically Bad.- A Public Key Cryptosystem Based on Sparse Polynomials.- Higher Weights of Grassmann Codes.- Toric Surfaces and Error-correcting Codes.- Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets.- Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of n Inputs.- Zeta Functions of Curves over Finite Fields with Many Rational Points.- Codes on Drinfeld Modular Curves.- Elliptic Curves, Pythagorean Triples and Applications.- Exponential Sums and Stationary Phase (I).- Exponential Sums in Several Variables over Finite Fields.- Decoding Reed-Solomon Codes Beyond Half the Minimum Distance.- Reed-Muller Type Codes on the Veronese Variety over Finite Fields.- Cryptography Primitives Based on a Cellular Automaton.- Factoring the Semigroup Determinant of a Finite Commutative Chain Ring.