Fast Point Multi- plication Algorithms for Binary Elliptic Curves with and without Precomputation. In Proceedings of SAC 2014, volume 8781 of LNCS, pages 324-344. Springer, 2014.Oliveira, T., Aranha, D.F., Lópe
We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can exploit faster and more uniform pseudomultiplication, before ...
This paper describes an algorithm for computing elliptic scalar multiplications on non-supersingular elliptic curves defined overGF(2m). The algorithm is an optimized version of a method described in [1], which is based on Montgomery’s method [8]. Our algorithm is easy to implement in both ha...
Elliptic curvesroot numbercomplex multiplicationquadratic twistsLetE/Fbe an elliptic curve defined over a number fieldF. Suppose thatEhas complex multiplication overF, i.e.EndF(E)is an imaginary quadratic field. With the aid of CM theory, we find elliptic curves whose quadratic twists have a ...
Second, we propose a new finite field multiplication algorithm. Third, we propose a particular polynomial squaring algorithm. We show that the proposed algorithms, when used together, accelerate the scalar multiplication on elliptic curves by two-fold....
Improvement of the Algorithm of Point Multiplication on Elliptic Curves over GF(2(superscript m)) GF(2(上标 m))域上椭圆曲线点积算法的一种改进 属类:行业术语-中文论文标题- Simulation and Analysis on Manual Multiplication Process of Lily Microbulbs Tissue Culture 百合小鳞球组织培养人工增殖作业之仿...
Check access to the full text by signing in through your organization. Access through your organization Section snippets Montgomery multiplication Modular multiplication is an important operation in ECC algorithm, an efficient and fast modular multiplication can easily speed up the overall elliptic curv...
In the last fifteen years the Iwasawa theory has been applied with remarkable success to elliptic curves with complex multiplication. A clear yet general exposition of this theory is presented in this book. Following a chapter on formal groups and local units, the p-adic L functions of Manin-...
Scalar multiplication is a very expensive operation in elliptic curve based cryptographic protocol. In this paper, we propose a modified simultaneous elliptic curve scalar multiplication algorithm using complementary recoding. The signed binary representation of an integer is obtained by simple arithmetic ope...
FranceAbstract.Inthispaperweaddresstheproblemofprotectingellipticcurvescalarmultiplicationimplementationsagainstside-channelanalysisbyusingtheatomicityprinciple.Firstofallwereexamineclassicalas-sumptionsmadebyscalarmultiplicationdesignersandwepointoutthatsomeofthemarenotrelevantinthecontextofembeddeddevices.Wethendescribethe...