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

A new and efficient approach for high-speed and very compact realization of Secure Hash Algorithm

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

2 Author(s)
Shahmoradi, A. ; ECE Dept., Semnan Univ., Semnan, Iran ; Masoumi, M.

We are proposing that the recently proposed cell-FPGA-like hybrid CMOS/nanodevice architecture is an optimum platform to realize encryption algorithms. Such circuits will combine a semiconductor-transistor (CMOS) stack and a two-level nanowire crossbar with nanoscale two-terminal nanodevices (programmable diodes) formed at each crosspoint. The basic modules of the Secure Hash Algorithm (SHA-512) have been designed using this architecture. In addition, using a custom set of design automation tools, quasi-optimum gate placing, routing and rerouting are provided for SHA-512 building blocks. It is shown that such a design results in a circuit which is defect tolerant, much faster and strikingly denser than its CMOS counterpart.

Published in:

Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on

Date of Conference:

24-27 May 2009

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.