𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the jump number on semi-orders is polynomial

✍ Scribed by A. von Arnim; C. de la Higuera

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
870 KB
Volume
51
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial bound on the number of coma
A polynomial bound on the number of comaximal localizations needed in order to make free a projective module
✍ Gema M. Diaz–Toca; Henri Lombardi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 203 KB

Let A be a commutative ring and M be a projective module of rank k with n generators. Let h = nk. Standard computations show that M becomes free after localizations in n k comaximal elements (see Theorem 5). When the base ring A contains a field with at least hk + 1 non-zero distinct elements we con

Computing the order of points on an elli
Computing the order of points on an elliptic curve modulo N is as difficult as factoring N
✍ S. MartΓ­n; P. Morillo; J.L. Villar πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 292 KB

## Communicated by J. Lagarias Abstract--Given a square-free integer N, the group of points on an elliptic curve over the ring ZN is defined in the natural way. We prove that computing the order of points on elliptic curves over ZN is as difficult as factoring N, in the sense of randomly polynomia