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

Fault-based triangular basis multiplication over GF(2m) using bit-level parity prediction scheme

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

4 Author(s)
Jenn-Shyong Homg ; Nat. Kaohsiung First Univ., Tainan ; Chiou-Yng Lee ; I-Chang Jou ; Teh-Sheng Huang

Recently, many researchers have proved that cryp- tosystems can be easily broken by the fault based side-channel cryptanalysis. To fight against such fault based side-channel cryptanalysis, a bit-parallel triangular basis systolic multiplier with on-line error detection capability is then presented. The architecture is used by a bit-level parity prediction scheme to detect even-multiple and odd-multiple errors in triangular basis multiplication, and then saves about 77% space complexity as compared to traditional fault-based multipliers.

Published in:

TENCON 2007 - 2007 IEEE Region 10 Conference

Date of Conference:

Oct. 30 2007-Nov. 2 2007

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.