By Topic

An efficient inverse multiplier/divider architecture for cryptography systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Junhyung Um ; Dept. of EECS, Electron. & Telecommun. Res. Inst., South Korea ; Sangwoo Lee ; Youngsoo Park ; Sungik Jun
more authors

There is a vast market for cryptography, in which one of the major design concerns is to speed up the execution of encryption and decryption. It is known that the quality (in terms of speed and area) of the cryptography systems is determined by how the inversion/division operators are implemented efficiently. In this paper, we propose a new arithmetic computation architecture for Elliptic Curve Cryptography (ECC) system, which increases efficiency for inverse multiplier/divider. Specifically, we propose a new architectural design approach for inversion/division operators of ECC, which is suitable for portable embedded cryptography systems, by placing the minimization of circuit area as the primary design objective. From experiments using a set of benchmark design, it is shown that our approach is effective and efficient using less circuit area (20% for inverter/37% for divider) than that of the architecture produced by conventional methods.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003