Cart (Loading....) | Create Account
Close category search window
 

Architectures for exponentiation over GD(2n) adopted for smartcard application

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

1 Author(s)
Arazi, B. ; Dept. of Electr. & Comput. Eng., Ben Gurion Univ., Beer Sheva, Israel

Two exponentiation circuits are proposed. Using the fact that squaring is a linear operation over GF(2n), a time-space tradeoff in smartcard-based circuitry is presented. It is shown how multiplication is performed by a single shift, based on replacing the public key αa ∈ GF(2n) by its minimal polynomial. Other considerations, related to structure regularity and the possible use of dynamic shift registers, are also treated

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 4 )

Date of Publication:

Apr 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.