Describes in detail an algorithm based on modular symbols for computing modular elliptic curves. Also describes various algorithms for studying the arithmetic of elliptic curves.
Elliptic Curves Signature Schemes Zero Knowledge ProofsWe introduce in this paper the algorithmic aspect of elliptic curves together with their applications. We also recall one of the promising application in the field of zero knowledge proofs with concrete implementations....
For a description of how most of the data here was computed, see the ANTS 7 Proceedings athttp://www.math.tu-berlin.de/~kant/ants/proceedings.html. For a description of the algorithms used, see the book Algorithms for Modular Elliptic Curves, published by CUP in 1992 (second edition 1997...
22 Meta-Analytic Inference for the COVID-19 Infection Fatality Rate 51:23 Modular forms and their role in counting combinatorial and topological objects 58:25 The Geometric Structure of Possible Singularities for the Navier-Stokes and Eule 48:05 Wasserstein gradient flows for machine learning 1:02...
We propose three DNA-based algorithms - parallel subtractor, parallel comparator and parallel modular arithmetic - that formally verify our designed molecu... WL Chang,M Guo,MS Ho - IEEE 被引量: 220发表: 2004年 Using the L--curve for determining optimal regularization parameters The ''L--curv...
Summation polynomial algorithms for elliptic curves in characteristic two. International Conference in Cryptology in India, Springer International Publishing:409-427, , December 2014.Galbraith S.D., Gebregiyorgis S.W.: Summation polynomial algorithms for elliptic curves in character- istic two. In: ...
In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by K. Pek...
Our Public key algorithm is bijective and can be used for encryption as well as for signatures.Rajesh P SinghA. Saikia... RP Singh,A Saikia,BK Sarma 被引量: 0发表: 2009年 加载更多研究点推荐 Ecient Algorithms Computing Modular Exponentiation Computing 0...
erelliptic curves dened by the equation y x x d over a eld F p n of o dd characteristic p They fall into two dierent classes for d a quadratic residue or nonresidue mo dulo p resp ectively Note that the genus of the curve is p which is related to the characteristic The curves ...
Our results demonstrate that laddering implementations can be competitive with window-based methods by obtaining a new speed record for laddering implementations of elliptic curves on high-end Intel processors.doi:10.1007/978-3-319-71501-8_5Diego F. Aranha...