Supersingular elliptic curve

About: Supersingular elliptic curve is a research topic. Over the lifetime, 3201 publications have been published within this topic receiving 86454 citations.

The Arithmetic of Elliptic Curves

Abstract: Algebraic Varieties.- Algebraic Curves.- The Geometry of Elliptic Curves.- The Formal Group of Elliptic Curves.- Elliptic Curves over Finite Fields.- Elliptic Curves over C.- Elliptic Curves over Local Fields.- Elliptic Curves over Global Fields.- Integral Points on Elliptic Curves.-Computing the Mordell Weil Group.- Appendix A: Elliptic Curves in Characteristics.-Appendix B: Group Cohomology (H0 and H1).

Advanced Topics in the Arithmetic of Elliptic Curves

Abstract: In The Arithmetic of Elliptic Curves, the author presented the basic theory culminating in two fundamental global results, the Mordell-Weil theorem on the finite generation of the group of rational points and Siegel's theorem on the finiteness of the set of integral points. This book continues the study of elliptic curves by presenting six important, but somewhat more specialized topics: I. Elliptic and modular functions for the full modular group. II. Elliptic curves with complex multiplication. III. Elliptic surfaces and specialization theorems. IV. Neron models, Kodaira-N ron classification of special fibres, Tate's algorithm, and Ogg's conductor-discriminant formula. V. Tate's theory of q-curves over p-adic fields. VI. Neron's theory of canonical local height functions.

Elliptic Curves in Cryptography

Abstract: In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems. Elliptic curves offer major advances on older systems such as increased speed, less memory and smaller key sizes. As digital signatures become more and more important in the commercial world the use of elliptic curve-based signatures will become all pervasive. This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems. Due to the advanced nature of the mathematics there is a high barrier to entry for individuals and companies to this technology. Hence this book will be invaluable not only to mathematicians wanting to see how pure mathematics can be applied but also to engineers and computer scientists wishing (or needing) to actually implement such systems.

Speeding the Pollard and elliptic curve methods of factorization

Abstract: Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module N and occasionally taking GCDs with N. These began with Pollard's p 1 and Monte Carlo methods. More recently, Williams published a p + 1 method, and Lenstra discovered an elliptic curve method (ECM). We present ways to speed all of these. One improvement uses two tables during the second phases of p ? 1 and ECM, looking for a match. Polynomial preconditioning lets us search a fixed table of size n with n/2 + o(n) multiplications. A parametrization of elliptic curves lets Step 1 of ECM compute the x-coordinate of nP from that of P in about 9.3 1og2 n multiplications for arbitrary P.

C1 + α local regularity of weak solutions of degenerate elliptic equations

Abstract: : It is demonstrated the local C(1 + Alpha) nature of weak solutions of elliptic equations of the type (1.1) in the introduction under the degeneracy (or singularity) assumptions (A sub 1)-(A sub 3).