By Topic

Common-multiplicand multiplication and its applications to public key cryptography

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
$31 $31
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

1 Author(s)

Efficient computations of (X+Y i mod i=1, 2, . . ., t; t>or=2), which is called the common-multiplicand multiplication problem, are considered. An algorithm is proposed for this problem and it is very useful for the exponentiation computations of public key cryptography.<>

Published in:

Electronics Letters  (Volume:29 ,  Issue: 17 )