A Public Key Infrastructure for Key Distribution in TinyOS Based on Elliptic Curve Cryptography David J. Malan, Matt Welsh, Michael D. Smith Presented.

Slides:

Advertisements

Similar presentations

Signatures for Network Coding Denis Charles Kamal Jain Kristin Lauter Microsoft Research.

Advertisements

Key Management Nick Feamster CS 6262 Spring 2009.

Public Key Cryptography Nick Feamster CS 6262 Spring 2009.

Public Key Cryptography INFSCI 1075: Network Security – Spring 2013 Amir Masoumzadeh.

Cryptography and Network Security Chapter 8 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Modified – Tom Noack.

Are standards compliant Elliptic Curve Cryptosystems feasible on RFID?

Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.

Elliptic curve arithmetic and applications to cryptography By Uros Abaz Supervised by Dr. Shaun Cooper and Dr. Andre Barczak.

TinySec: A Link Layer Security Architecture for Wireless Sensor Networks C. Karlof, N. Sastry, D. Wagner SPINS: Security Protocol for Sensor Networks A.

ELECTRONIC PAYMENT SYSTEMSFALL 2002COPYRIGHT © 2002 MICHAEL I. SHAMOS Electronic Payment Systems Lecture 6 Epayment Security II.

Windows Core Security1© 2006 Microsoft Corp Cryptography: Helping Number Theorists Bring Home the Bacon Since 1977 Dan Shumow SDE Windows Core Security.

November 1, 2006Sarah Wahl / Graduate Student UCCS1 Public Key Infrastructure By Sarah Wahl.

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

1 CS 577 “TinySec: A Link Layer Security Architecture for Wireless Sensor Networks” Chris Karlof, Naveen Sastry, David Wagner UC Berkeley Summary presented.

Summary of – “TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks” Presented by: Maulin Patel Nov/17/09 CSE291.

CS470, A.SelcukElGamal Cryptosystem1 ElGamal Cryptosystem and variants CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.

No-Key Cryptography Nathan Marks Based on Massey-Omura US Patent # 4,567,600.

Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.

TinySec: Link Layer Security Chris Karlof, Naveen Sastry, David Wagner University of California, Berkeley Presenter: Todd Fielder.

The Diffie-Hellman Algorithm Riley Lochridge April 11, 2003.

Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.

CPE5021 Advanced Network Security --- Advanced Cryptography: Elliptic Curve Cryptography --- Lecture 3 CPE5021 Advanced Network Security --- Advanced Cryptography:

Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.

ASYMMETRIC CIPHERS.

-Anusha Uppaluri.  ECC- A set of algorithms for key generation, encryption and decryption (public key encryption technique)  ECC was introduced by Victor.

By Abhijith Chandrashekar and Dushyant Maheshwary.

Network Security. An Introduction to Cryptography The encryption model (for a symmetric-key cipher).

1 Network Security Lecture 6 Public Key Algorithms Waleed Ejaz

Calculating Discrete Logarithms John Hawley Nicolette Nicolosi Ryan Rivard.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

1 TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Hai Yan Computer Science & Engineering University of Connecticut.

SENSOR NETWORK SECURITY Group Members Pardeep Kumar Md. Iftekhar Salam Ahmed Galib Reza 1 Presented by: Iftekhar Salam 1.

CS 627 Elliptic Curves and Cryptography Paper by: Aleksandar Jurisic, Alfred J. Menezes Published: January 1998 Presented by: Sagar Chivate.

FORESEC Academy FORESEC Academy Security Essentials (IV)

Security in Wireless Sensor Networks using Cryptographic Techniques By, Delson T R, Assistant Professor, DEC, RSET 123rd August 2014Department seminar.

Midterm Review Cryptography & Network Security

Elliptic Curve Cryptography Implementation & PKI Adoption Brian Saville Jonathan Mitchell.

Cryptography and Network Security (CS435) Part Eight (Key Management)

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Elliptical Curve Cryptography Manish Kumar Roll No - 43 CS-A, S-7 SOE, CUSAT.

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

Cryptography and Network Security Chapter 13 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

CS461/ECE422 Spring 2012 Nikita Borisov — UIUC1.  Text Chapters 2 and 21  Handbook of Applied Cryptography, Chapter 8 

Public key ciphers 2 Session 6.

Symmetric Cryptography, Asymmetric Cryptography, and Digital Signatures.

TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof :: Naveen Sastry :: David Wagner Presented by Roh, Yohan October.

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

TinySec : Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof :: Naveen Sastry :: David Wagner Presented by Anil Karamchandani 10/01/2007.

Cryptography and Network Security Key Management and Other Public Key Cryptosystems.

Sensor Network Security through Identity-Based Encryption

Elliptic Curve Cryptography

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

Chapter 4: Public Key Cryptography

Elliptic Curves Number Theory and Cryptography. A Pile of Cannonballs A Square of Cannonballs.

TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Seetha Manickam Modified by Sarjana Singh.

Cryptography issues – elliptic curves Presented by Tom Nykiel.

Lecture 9 Elliptic Curves. In 1984, Hendrik Lenstra described an ingenious algorithm for factoring integers that relies on properties of elliptic curves.

11 RSA Variants.  Scheme ◦ Select s.t. p and q = 3 mod 4 ◦ n=pq, public key =n, private key =p,q ◦ y= e k (x)=x (x+b) mod n ◦ x=d k (y)=  y mod n.

A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.

Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.

1 Cryptanalysis Lab Elliptic Curves. Cryptanalysis Lab Elliptic Curves 2 Outline [1] Elliptic Curves over R [2] Elliptic Curves over GF(p) [3] Properties.

Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.

Key Exchange in Systems VPN usually has two phases –Handshake protocol: key exchange between parties sets symmetric keys –Traffic protocol: communication.

Elliptic Curve Public Key Cryptography Why ? ● ECC offers greater security for a given key size. ● The smaller key size also makes possible much more compact.

D. Cheung – IQC/UWaterloo, Canada D. K. Pradhan – UBristol, UK

The Application of Elliptic Curves Cryptography in Embedded Systems

Security Of Wireless Sensor Networks

Security of Wireless Sensor Networks

Presentation transcript:

A Public Key Infrastructure for Key Distribution in TinyOS Based on Elliptic Curve Cryptography David J. Malan, Matt Welsh, Michael D. Smith Presented by James Balasalle

Overview Introduction SKIPJACK and TinySEC Elliptic Curve Cryptography Implementation Results Conclusions

Introduction Not much data to support claim that PKI is infeasible ECC Solves key distribution problems ECC and the Discrete Logarithmic Problem Implemented Results Conclusions

SKIPJACK and TinySEC Link layer security Secret keys, possibly global Re-keying is problematic Transmit time RTT time

SKIPJACK and TinySEC Cont’d. Tiny Sec Size Encryption Time

Elliptic Curve Cryptography Like other PKI schemes based on DLP (discrete logarithmic problem) y=(gx)mod p “Easy” to find y, very difficult to find x Based on finite fields Elements in group are points (x,y)

Elliptic Curve Cryptography Cont’d. y 2 = x 3 + ax + b Elliptic Curve

Elliptic Curve Cryptography Cont’d. Point Addition

Elliptic Curve Cryptography Cont’d. Point Multiplication

Elliptic Curve Cryptography Cont’d. Q(x,y) = kP(x,y) Q is public key Field is set of points on curve up to P, which is large prime Field can be of different types

Elliptic Curve Cryptography Cont’d.

Implementation 1 st attempt failed – based on code by Michael Rosing Stack overflow Memory consumption for multi-word arithmetic – exponential RAM usage for keys above 33 bits

Implementation Cont’d. 2 nd Attempt EccM 2.0 Based on Dragongate Technologies Limited’s jBorZoi Keys are broadcast in 2 22-byte messages Different algorithms are used for multiplication of points, and addition of points EccM 1.0 is subject to sub exponential attack via MOV reduction with indexed calculus. Eccm 2.0 is not.

Results TinySec Sizes EccM Sizes

Results Cont’d. 148 times more expensive 149 times slower

Conclusions Feasible for infrequent re-keying Significantly simplifies key distribution Provides high level of security Twice as big code size as TinySec Larger BSS size

Conclusions Cont’d. Significantly slower PKI allows more ways for nodes to establish keys – reducing chance of network fragmentation