scalar multiplication
Compact variable-base ECC scalar multiplication using Euclidean addition chains
... 2.2 About the random generation of Euclidean addition chains in GLV-like context. The idea of the random generation of chains is intro- duced in (Herbaut et al., 2010) when the base point P is fixed. The scope is ...
11
Randomizing scalar multiplication using exact covering systems of congruences
... In [6], Brumley and Tuveri presented a successful timing attack on an OpenSSL im- plementation of the signature phase of ECDSA, in particular a scalar multiplication [k]P , where nonce k is selected ...
16
On-the-Fly Multi-Base Recoding for ECC Scalar Multiplication without Pre-Computations
... ECC scalar multiplication in hardware without any ...The scalar recoding is performed on-the- fly and in parallel to curve-level operations without additional ...and scalar ...
11
Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve
... of scalar multiplication over an elliptic ...the scalar into two parts for E(F p ) or three parts for E(F 2 m ) and perform in parallel the scalar multiplication with each part of the ...
9
New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic
... point multiplication on curves E(F 2 m ). The method of Montgomery for scalar multiplication is very regular : the same set of field operations are performed at each iteration of the main ...point ...
27
Euclidean addition chains scalar multiplication on curves with efficient endomorphism
... EAC scalar multiplication algorithm performs well as com- pared to the classical GLV algorithm (only 3% slower) and can even be faster (2%) in the context where k and P both ...
19
Branch Prediction Attack on Blinded Scalar Multiplication
... the scalar multiplication computation on the Montgomery ...performing scalar mul- tiplication on Curve25519 is to use homogeneous projec- tive ...the scalar multiplication imple- ...
17
RNS Modular Multiplication through Reduced Base Extensions
... Z 2 1 and (Y 1 + Z 1 ) 2 (lines 2, 4 and 10 respectively in Tab. III). We selected 2 common curve level patterns: 2DBL+mADD and TPL+2DBL+mADD for scalar multiplication. The top sub-figure shows that ...
7
Charge Screening in Classical Scalar Electrodynamics
... The value of the external charge for which partially screened solutions, with charge Q &Z, start having a lower energy than the pure Coulomb solution is indeed given by Z =Zp Q Z„, w[r] ...
3
Self-acceleration in scalar-bimetric theories
... describe scalar-bimetric theories where the dynamics of the Universe are governed by two separate metrics, each with an Einstein-Hilbert ...with scalar-dependent coefficients. The scalar field, ...
28
Conformal transformations with multiple scalar fields
... Goldstone scalar fields remain explicit [ 21 ...real scalar fields (the Higgs scalar plus three Goldstone scalars), each of which is nonminimally coupled to the Ricci curvature ...the scalar ...
9
Parallel Implementation of Interval Matrix Multiplication
... matrix multiplication have been proposed, which correspond to various trade-offs between accuracy and efficiency, including some efficient ones proposed by Rump in ...
17
Balanced dense polynomial multiplication on multi-cores
... tension, has several motivations. First, under our assumption of 1-D FFT black-box (which may be a serial program) this trick creates concurrent execution for FFT-based univariate multiplication. Secondly, when ...
10
Mesure de Mahler et courbes elliptiques avec multiplication complexe
... that R(𝜎(𝑥)) = R(𝑥) for every 𝜎 ∈ 𝐺 𝜅 ; • we write R : Q[𝐸(Q) tors ] → Q for the Q-linear extension of R : 𝐸(Q) tors → Q, and we observe that it descends to a Q-linear map R : Q[𝐺 Q \𝐸 (Q) tors ] → Q. Finally, let us ...
25
Modules de Swan et courbes elliptiques à multiplication complexe
... liptique à multiplication complexe par On suppose que E est définie sur une extension L de Il et qu’elle a pa,rtout bonne réduction. Soient 9R un idéal de 0/( et G le groupe des points de 9R division de E. Par ...
9
Représentations galoisiennes diédrales et formes à multiplication complexe
... où σ : D 3 → GL 2 (Z) est l’unique représentation irréductible de degré 2 du groupe D 3 (voir [15, §3.4]) et où la dernière flèche est l’application de réduction modulo 23. On explicite à présent la forme à ...
21
Multiplication in Finite Fields and Elliptic Curves
... polynomial multiplication in F p [T ] since the multiplication by the considered root unity is really ...for multiplication in F 2 n ...to multiplication modulo a NAOP [1] and field ...
67
Secure Strassen-Winograd Matrix Multiplication with MapReduce
... Matrix multiplication, Strassen-Winograd algorithm, MapReduce, Security Abstract: Matrix multiplication is a mathematical brick for solving many real life ...Matrix Multiplication with ...
13
RN-codes : algorithmes d'addition, de multiplication et d'élévation au carré
... Unité de recherche INRIA Rhône-Alpes 655, avenue de l’Europe - 38334 Montbonnot Saint-Ismier France Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des Vignes 4, rue J[r] ...
21
L'ENSEIGNEMENT DE LA MULTIPLICATION DES DÉCIMAUX EN SIXIÈME. ÉTUDE DE PRATIQUES ORDINAIRES
... Une recherche qui porte sur le travail des professeurs nécessite d'observer des classes En demandant à des collègues de nous ouvrir leur porte, nous avons constaté d'abord des réticences[r] ...
519