✦ LIBER ✦

Square rooting is as difficult as multiplication

✍ Scribed by H. Alt

Book ID: 105514498
Publisher: Springer Vienna
Year: 1979
Tongue: English
Weight: 406 KB
Volume: 21
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02253055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Square Root as a Homomorphism

✍ William C. Waterhouse 📂 Article 📅 2012 🏛 Mathematical Association of America 🌐 English ⚖ 215 KB

Some uses of the square root method as a

Some uses of the square root method as a tool in multiple prediction

✍ Aart Hazewinkel 📂 Article 📅 1962 🏛 Springer 🌐 English ⚖ 379 KB

Multiplication by Square of Envelope as

Multiplication by Square of Envelope as Means of Improving Detection Below FM Threshold

✍ Roberts, J. 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 501 KB

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

Note on the squared multiple correlation

Note on the squared multiple correlation as a lower bound to communality

✍ Chester W. Harris 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 89 KB

Note on the squared multiple correlation

Note on the squared multiple correlation as a lower bound to communality

✍ David J. Jackson; Dan L. Tweed 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 158 KB