On Waring's Problem in GF[p]
In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compellProjCo and addellProjCo are unary and binary operations of a point over the elliptic curve.
This survey deals with pluri-periodic harmonic functions on lattices with values in a field of positive characteristic. We mention, as a motivation, the game “Lights Out” following the work of Sutner [20], Goldwasser- Klostermeyer-Ware [5], Barua-Ramakrishnan-Sarkar [2, 19], Hunzikel-Machiavello-Park [12] e.a.; see also [22, 23] for a more detailed account. Our approach uses harmonic analysis and algebraic geometry over a field of positive characteristic.
Soit un entier pair. On considère un code BCH binaire de longueur et de distance prescrite avec . Le poids d’un mot non nul du dual de peut s’exprimer en fonction d’une somme exponentielle. Nous montrerons que cette somme n’atteint pas la borne de Weil et nous proposerons une amélioration de celle-ci. En conséquence, nous obtiendrons une amélioration de la borne de Carlitz-Uchiyama sur le poids des mots du dual de .