Modular Arithmetic Analyses for RSA Cryptosystem

Author

Chia-Long Wu ; Chen-Hao Hu

Author_Institution

Aviation Commun. Electron. Dept., Air Force Inst. of Technol., Kaohsiung, Taiwan

fYear

2014

fDate

10-12 June 2014

Firstpage

816

Lastpage

819

Abstract

In many consumer electronics computation problem, the modular exponentiation is a common operation for scrambling secret data and is used by several public-key cryptosystems, such as the RSA method. In this paper, an algorithm is proposed, which combines binary exponentiation method, the common-multiplicand multiplication (CMM) method, and the signed-digit recoding (SDR) method for fast modular exponentiation consumer electronics application.

Keywords

consumer electronics; digital arithmetic; public key cryptography; CMM; RSA cryptosystem; SDR method; binary exponentiation method; common multiplicand multiplication; consumer electronics computation problem; modular arithmetic analyses; modular exponentiation consumer electronics; public key cryptosystem; secret data scrambling; signed digit recoding; Algorithm design and analysis; Computational complexity; Computers; Coordinate measuring machines; Electrostatic discharges; Public key cryptography; Montgomery algorithm; cryptosystems; information security; multiplication technique; signed-digit recoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer, Consumer and Control (IS3C), 2014 International Symposium on

Conference_Location

Taichung

Type

conf

DOI

10.1109/IS3C.2014.216

Filename

6846008