• Modifications of the Rao-Nam cryptosystem. Efficient reduction on the Jacobian variety of Ricard 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. Ellipitc curves, pythagorean triples and applications. Exponential sums and stationary phase. 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.

Αντίτυπα