03.11.2014 Views

Cryptography in Modern Communication Systems

Cryptography in Modern Communication Systems

Cryptography in Modern Communication Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Cryptography</strong> <strong>in</strong> <strong>Modern</strong><br />

<strong>Communication</strong> <strong>Systems</strong><br />

DSPS Fest ‘99<br />

August 5th<br />

by<br />

Daniel Bailey 1 , William Cammack 2 , Jorge Guajardo 1 , and Christof Paar 1<br />

1<br />

<strong>Cryptography</strong> and Information Security (CRIS) Laboratory<br />

WPI - ECE Department, Worcester MA 01609<br />

2<br />

DSP R&D Center<br />

Texas Instruments Inc., P.O. Box 655303, MS 8374, Dallas, TX 75265


Overview<br />

• Why <strong>Cryptography</strong>?<br />

• Provid<strong>in</strong>g Information Security<br />

• Secret-key <strong>Cryptography</strong><br />

• Public-key <strong>Cryptography</strong><br />

• <strong>Cryptography</strong> and DSPs<br />

• State of the Art<br />

• The SecuriTI Library<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 2


Why <strong>Cryptography</strong>?<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 3


Why <strong>Cryptography</strong>?<br />

Our Information society relies <strong>in</strong>creas<strong>in</strong>gly on<br />

technologies such as<br />

•Internet (email, home shopp<strong>in</strong>g, … )<br />

•wireless applications<br />

•electronic commerce and data transfers …<br />

Unprotected <strong>in</strong>formation systems pose a major threat<br />

to <strong>in</strong>dividuals and society<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 4


Provid<strong>in</strong>g Information Security<br />

• Major tool for <strong>in</strong>formation security<br />

<strong>Cryptography</strong><br />

<strong>Cryptography</strong><br />

secret-key<br />

public-key<br />

(BC … 1976) (Diffie-Hellman, 1976)<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 5


Secret-key <strong>Cryptography</strong><br />

x<br />

e<br />

y=e k (x)<br />

d<br />

x<br />

Alice<br />

key k<br />

key k<br />

Bob<br />

Oscar<br />

Classical Problem: How to get the secret key to the other party?<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 6


Secret-key <strong>Cryptography</strong><br />

• Until 1998, DES<br />

– Optimized for hardware.<br />

– Designed <strong>in</strong> secret.<br />

• Now AES<br />

– Many candidate algorithms optimized for<br />

software.<br />

– Designed <strong>in</strong> the open.<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 7


Secret-key <strong>Cryptography</strong><br />

• AES history:<br />

– Summer 1998 AES1, <strong>in</strong>itial candidates<br />

– April 1999, AES2 ends Round 1<br />

comment period<br />

– April 2000, AES3<br />

• Example of AES Candidates’ Performance (200 MHz Pentium clock cycles,<br />

128 bit encryption, <strong>in</strong> C)<br />

Algorithm Company NIST Gladman<br />

CAST-256 Entrust Technologies 2169 633<br />

MARS IBM 807 369<br />

RC6 RSA 636 270<br />

RIJNDAEL J. Daemen & V. Rijmen 809 374<br />

SAFER+ Cyl<strong>in</strong>c Corporation 2095 1722<br />

TWOFISH B. Schneier et. Al. 973 376<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 8


Remember this?<br />

x<br />

e<br />

y=e k (x)<br />

d<br />

x<br />

Alice<br />

key k<br />

key k<br />

Bob<br />

Oscar<br />

Classical Problem: How to get the secret key to the other party?<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 9


Public-key <strong>Cryptography</strong><br />

x<br />

e<br />

y=e PubK (x)<br />

d<br />

x<br />

Alice<br />

PubK Bob<br />

PrivK Bob<br />

Bob<br />

Oscar<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 10


Public-key <strong>Cryptography</strong><br />

• Based on hard mathematical problems<br />

– Beware! Not easy to f<strong>in</strong>d<br />

• 3 different families of algorithms<br />

– Integer Factorization (RSA)<br />

– Discrete Logarithm (Diffie-Hellman, DSA)<br />

– Elliptic Curves (ECDSA)<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 11


Public-key <strong>Cryptography</strong><br />

• Equivalent bit lengths of different algorithms<br />

RSA DL ECC<br />

512 512 106<br />

1024 1024 163<br />

2048 2048 211<br />

• Computational Challenges<br />

– Complicated Algorithms<br />

– Most common operation: x e mod n<br />

– Computationally expensive<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 12


Did we solve the problem?<br />

Given<br />

: large<br />

prime<br />

p<br />

and<br />

an <strong>in</strong>teger α<br />

Alice<br />

Bob<br />

random private key<br />

random private key<br />

a ∈(1,2,<br />

K , p −1)<br />

a ∈ (1,2, K,<br />

p −1)<br />

b<br />

A<br />

public - key<br />

A<br />

b A<br />

b B<br />

a A a<br />

= α mod p<br />

b = α B<br />

mod p<br />

B<br />

public - key<br />

B<br />

K =<br />

b<br />

a<br />

B<br />

A<br />

= ( α<br />

= α<br />

a<br />

a<br />

B<br />

B<br />

a<br />

A<br />

a<br />

a B<br />

A<br />

)<br />

K = bA<br />

= ( α<br />

a<br />

mod p<br />

= α<br />

y<br />

y = eK ( x)<br />

x = d<br />

K<br />

( y)<br />

a<br />

A<br />

A<br />

a<br />

B<br />

)<br />

a<br />

B<br />

mod<br />

p<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 13


DSPs and <strong>Cryptography</strong><br />

• 1986, Barret: RSA on the TI TMS320<br />

– 2.6 sec for a 512-bit exponentiation at 20 MHz.<br />

• 1990, Dusse and Kaliski: RSA and DES on the<br />

Motorola DSP56000<br />

– 11.6 kbits/s (4.6kbits/s) for a 512-bit exponentiation.<br />

– 350 kbits/s for DES.<br />

– Both results at 20 MHz.<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 14


State of the Art<br />

Op 1024-RSA 2048-RSA 192-ECDSA<br />

CHES’99 on the sign 11.7 ms 84.6 ms 1.67 ms<br />

TI TMS320C6201 ver 1.2 ms 4.5 ms 6.28 ms<br />

Po<strong>in</strong>t mult ------ ------ 4.64 ms<br />

ANT 3rd Int. Symp sign 43.3 ms ------ 6.3 ms<br />

Pentium 200 MHz ver 0.65 ms ------ 26 ms<br />

Po<strong>in</strong>t mult ------ ------ 21.1 ms<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 15


The SecuriTI Library<br />

• Comprehensive cryptographic library for the TI<br />

TMS320C6201 and TMS320C54x<br />

• Includes<br />

– High Speed multi-precision library<br />

– Public-key library (RSA, DSA, ECC)<br />

– Block cipher library (DES and AES)<br />

– Hash function library (SHA-1, MD5)<br />

• Modular design<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 16


Any Questions?<br />

DSPS Fest '99 Cryptograhy <strong>in</strong> <strong>Modern</strong> <strong>Communication</strong> <strong>Systems</strong> 17

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!