scholarly journals Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms

2019 ◽  
pp. 24-39
Author(s):  
Jérémie Detrey ◽  
Laurent Imbert
Keyword(s):  
Scalar Multiplication

Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials

2014 ◽  
Vol E97.A (1) ◽  
pp. 300-302 ◽  
Author(s):  
Naoki KANAYAMA ◽  
Yang LIU ◽  
Eiji OKAMOTO ◽  
Kazutaka SAITO ◽  
Tadanori TERUYA ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Scalar Multiplication ◽  
Division Polynomials ◽  
Elliptic Curve Scalar Multiplication

scholarly journals Dynamic Łukasiewicz logic and its application to immune system

2021 ◽  
Author(s):  
Antonio Di Nola ◽  
Revaz Grigolia ◽  
Nunu Mitskevich ◽  
Gaetano Vitale
Keyword(s):  
Immune System ◽  
Scalar Multiplication ◽  
Kripke Semantics ◽  
Łukasiewicz Logic ◽  
Lukasiewicz Logic ◽  
Regular Algebras

AbstractIt is introduced an immune dynamic n-valued Łukasiewicz logic $$ID{\L }_n$$ I D Ł n on the base of n-valued Łukasiewicz logic $${\L }_n$$ Ł n and corresponding to it immune dynamic $$MV_n$$ M V n -algebra ($$IDL_n$$ I D L n -algebra), $$1< n < \omega $$ 1 < n < ω , which are algebraic counterparts of the logic, that in turn represent two-sorted algebras $$(\mathcal {M}, \mathcal {R}, \Diamond )$$ ( M , R , ◊ ) that combine the varieties of $$MV_n$$ M V n -algebras $$\mathcal {M} = (M, \oplus , \odot , \sim , 0,1)$$ M = ( M , ⊕ , ⊙ , ∼ , 0 , 1 ) and regular algebras $$\mathcal {R} = (R,\cup , ;, ^*)$$ R = ( R , ∪ , ; , ∗ ) into a single finitely axiomatized variety resembling R-module with “scalar” multiplication $$\Diamond $$ ◊ . Kripke semantics is developed for immune dynamic Łukasiewicz logic $$ID{\L }_n$$ I D Ł n with application in immune system.

scholarly journals On Multi-Scalar Multiplication Algorithms for Register-Constrained Environments

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 605
Author(s):  
Da-Zhi Sun ◽  
Ji-Dong Zhong ◽  
Hong-De Zhang ◽  
Xiang-Yu Guo
Keyword(s):  
Electronic Devices ◽  
Additive Group ◽  
Fixed Number ◽  
Scalar Multiplication ◽  
Computation Cost ◽  
Public Key Cryptosystems ◽  
Adaptive Window ◽  
Computation Efficiency ◽  
Window Method ◽  
Constrained Environments

A basic but expensive operation in the implementations of several famous public-key cryptosystems is the computation of the multi-scalar multiplication in a certain finite additive group defined by an elliptic curve. We propose an adaptive window method for the multi-scalar multiplication, which aims to balance the computation cost and the memory cost under register-constrained environments. That is, our method can maximize the computation efficiency of multi-scalar multiplication according to any small, fixed number of registers provided by electronic devices. We further demonstrate that our method is efficient when five registers are available. Our method is further studied in detail in the case where it is combined with the non-adjacent form (NAF) representation and the joint sparse form (JSF) representation. One efficiency result is that our method with the proposed improved NAF n-bit representation on average requires 209n/432 point additions. To the best of our knowledge, this efficiency result is optimal compared with those of similar methods using five registers. Unlike the previous window methods, which store all possible values in the window, our method stores those with comparatively high probabilities to reduce the number of required registers.

MicroBlaze-Based Multiprocessor Embedded Cryptosystem on FPGA for Elliptic Curve Scalar Multiplication Over Fp

2019 ◽  
Vol 28 (03) ◽  
pp. 1950037 ◽  
Author(s):  
A. Bellemou ◽  
N. Benblidia ◽  
M. Anane ◽  
M. Issad
Keyword(s):  
Elliptic Curve ◽  
Scalar Multiplication ◽  
Security Level ◽  
Prime Field ◽  
Montgomery Modular Multiplication ◽  
Parallel Implementations ◽  
High Radix ◽  
System On Programmable Chip ◽  
Xilinx Fpga ◽  
Elliptic Curve Scalar Multiplication

In this paper, we present Microblaze-based parallel architectures of Elliptic Curve Scalar Multiplication (ECSM) computation for embedded Elliptic Curve Cryptosystem (ECC) on Xilinx FPGA. The proposed implementations support arbitrary Elliptic Curve (EC) forms defined over large prime field ([Formula: see text]) with different security-level sizes. ECSM is performed using Montgomery Power Ladder (MPL) algorithm in Chudnovsky projective coordinates system. At the low abstraction level, Montgomery Modular Multiplication (MMM) is considered as the critical operation. It is implemented within a hardware Accelerator MMM (AccMMM) core based on the modified high radix, [Formula: see text] MMM algorithm. The efficiency of our parallel implementations is achieved by the combination of the mixed SW/HW approach with Multi Processor System on Programmable Chip (MPSoPC) design. The integration of multi MicroBlaze processor in single architecture allows not only the flexibility of the overall system but also the exploitation of the parallelism in ECSM computation with several degrees. The Virtex-5 parallel implementations of 256-bit and 521-bis ECSM computations run at 100[Formula: see text]MHZ frequency and consume between 2,739 and 6,533 slices, 22 and 72 RAMs and between 16 and 48 DSP48E cores. For the considered security-level sizes, the delays to perform single ECSM are between 115[Formula: see text]ms and 14.72[Formula: see text]ms.

Sign in / Sign up

Export Citation Format

Share Document