High radix implementation of Montgomery multipliers with CSA

Sassaw, Gashaw; Jimenez, Chloé; Valencia, M.

doi:10.1109/icm.2010.5696148

Cited by 17 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A blockwise implementation of the CIOS method of Montgomery multiplication is ideal for the purposes of this paper as it is amenable to the use of embedded multipliers in FPGAs to perform smaller multiplications. Some implementations of this algorithm are discussed in [6,37,48]. These implementations range from using a constant number of embedded multipliers to the case where the number of embedded multipliers scales linearly with the number of bits in the operands to perform large parallel multiplications.…”

Section: Return T 19: End Functionmentioning

confidence: 99%

Implementing homomorphic encryption based secure feedback control

Tran¹,

Farokhi

Cantoni

et al. 2020

Control Engineering Practice

View full text Add to dashboard Cite

This paper is about an encryption based approach to the secure implementation of feedback controllers for physical systems. Specifically, Paillier's homomorphic encryption is used to digitally implement a class of linear dynamic controllers, which includes the commonplace static gain and PID type feedback control laws as special cases. The developed implementation is amenable to Field Programmable Gate Array (FPGA) realization. Experimental results, including timing analysis and resource usage characteristics for different encryption key lengths, are presented for the realization of an inverted pendulum controller; as this is an unstable plant, the control is necessarily fast.

show abstract

Section: Return T 19: End Functionmentioning

confidence: 99%

Implementing homomorphic encryption based secure feedback control

Tran¹,

Farokhi

Cantoni

et al. 2020

Control Engineering Practice

View full text Add to dashboard Cite

show abstract

“…the FCS strategy [9], maintains the input and output operands A, B, and S in the carry-save format, denoted as (AS, AC), (BS, BC), and (SS, SC), respectively, to avoid the format conversion, leading to fewer clock cycles for completing a MM.…”

Section: International Journal For Research In Applied Science and Engimentioning

confidence: 99%

A Systolic Hardware Architecture of Montgomery Modular Multiplication for Public Key Cryptosystems

D¹

2017

IJRASET

View full text Add to dashboard Cite

The Montgomery modular multiplication is mostly used in the field public-key cryptosystems. This work presents how to relax the data dependency in conventional word-based algorithms to increase the possibility of reusing the current words of variables. With the greatly relaxed data dependency, i proposed a novel scheduling scheme to alleviate the number of memory access in the developed scalable micro architecture. Analytical results show that the memory bandwidth requirement of the proposed scalable architecture is almost 1=ðw _ 1Þ times that of conventional scalable architectures. The proposed one also retains a latency of exactly 1 cycle between the operations of the same words in 2 consecutive iterations of the Montgomery modular multiplication algorithm when employing enough processing elements. To Compared to the design with previous work, experimental results shows that the proposed one achieves an 55 percent reduction in power consumption with no degradation in throughput. The number of reduced memory access not only leads to lower power consumption, it also facilitates the design of scalable architectures for any precision of operands.

show abstract

“…Therefore, this modular multiplication algorithm is timeconsuming algorithm [11,17]. To further improve the performance of Montgomery modular multiplication algorithm, several computational techniques and hardware implementation have been proposed such as [7,9,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27 ]. One of the efficient modular multiplication algorithms is KPartition Montgomery Modular Multiplication (KPM3) algorithm [7].…”

Section: Preliminariesmentioning

confidence: 99%

“…Although hardware implementation of the binary Montgomery modular multiplication is simple, but it is time-consuming operation. To improve the performance of Montgomery modular multiplication algorithm and architecture, several hardware implementation method and computational techniques have been developed that can be categories into four groups: using high-radix technique [11][12][13][14][15][16][17], using systolic array architecture [18][19][20], using carry-save addition architecture [11,16,21,22,23], and using scalable architecture [9,12,24,25,26,27].…”

Section: Introductionmentioning

confidence: 99%