applied cryptography - protocols, algorithms, and source code in c

Knowledge of one encryptiondecryption pair of

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ese three values for e (assuming you pad messages with random values—see later section), even if a whole group of users uses the same value for e. Table 19.3 Existing RSA Chips Baud Rate Clock Per Cycles Per Bits Clock 512 512 Bit per Speed Bits Encryption Technology Chip 25 MHz 15 MHz 10 MHz 5 MHz 20 MHz 25 MHz 14 MHz 30 MHz 13 K 19 K 5.1 K 3.8 K 28 K 5.3 K 17 K 6.8 K .98 M 2 micron .4 M 1.5 micron 1 M 2.5 micron .67 M Gate Array .36 M 2 micron 2.3 M 1 micron .4 M Gate Array 1.2 M 1.5 micron 1024 298 256 32 593 1024 120 1024 Company Alpha Techn. AT&ampT British Telecom Business Sim. Ltd. Calmos Syst. Inc. CNET Cryptech Cylink Number of Transistors 180,000 100,000 —— —— 95,000 100,000 33,000 150,000 GEC Marconi Pijnenburg Sandia Siemens 25 MHz 10.2 K 25 MHz 50 K 8 MHz 10 K 5 MHz 8.5 K .67 M 1.4 micron .256 M 1 micron .4 M 2 micron .3 M 1 micron 512 1024 272 512 160,000 400,000 86,000 60,000 Previous Table of Contents Next Products | Contact Us | About Us | Privacy | Ad Info | Home Use of this site is subject to certain Terms & Conditions, Copyright © 1996-2000 EarthWeb Inc. All rights reserved. Reproduction whole or in part in any form or medium without express written permission of EarthWeb is prohibited. Read EarthWeb's privacy statement. To access the contents, click the chapter and section titles. Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C (cloth) Go! Keyword Brief Full Advanced Search Search Tips (Publisher: John Wiley & Sons, Inc.) Author(s): Bruce Schneier ISBN: 0471128457 Publication Date: 01/01/96 Search this book: Go! Previous Table of Contents Next ----------- Table 19.4 RSA Speeds for Different Modulus Lengths with an 8-bit Public Key (on a SPARC II) 512 bits Encrypt Decrypt Sign Verify 0.03 sec 0.16 sec 0.16 sec 0.02 sec 768 bits 0.05 sec 0.48 sec 0.52 sec 0.07 sec 1, 024 bits 0.08 sec 0.93 sec 0.97 sec 0.08 sec Private key operations can be speeded up with the Chinese remainder theorem if you save the values of p and q, and additional values such as d mod (p - 1), d mod (q - 1), an...
View Full Document

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Ask a homework question - tutors are online