Rump Session, CHES 2004August 12, 2004 How to Securely Implement Cryptosystems Against Side-Channel Attacks on General Purpose Cryptographic Hardware Filipe.

Slides:



Advertisements
Similar presentations
Chapter 3 Public Key Cryptography and Message authentication.
Advertisements

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.
SHA-1 collision found Lukáš Miňo, Richard Bartuš.
RSA: More about attacks Need to take care with the implementation, e.g.: - Do not take p or q very small. - Difference of p and q should not be very small.
Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.
Institute for Applied Information Processing and Communications (IAIK) – VLSI & Security 1 TU Graz/Computer Science/IAIK/VLSI Institute for Applied Information.
1 Authors: MILENA STANOJLOVIĆ PREDRAG PETKOVIĆ LABORATORY FOR ELECTRONIC DESIGN AUTOMATION Faculty of Electronic Engineering University of Nis.
The Physically Observable Security of Signature Schemes Alexander W. Dent Joint work with John Malone-Lee University of Bristol.
Iron Key and Portable Drive Security Zakary Littlefield.
Side-Channel Attacks on Smart Cards. Timing Analysis Cryptosystems take different amount of time to process different inputs. Performance optimisations.
Henric Johnson1 Chapter3 Public-Key Cryptography and Message Authentication Henric Johnson Blekinge Institute of Technology, Sweden
©1999 by J. D. Tygar Endeavour Overview 1 Endeavour Security and assurance Doug Tygar UC Berkeley 25 May 1999.
Radu Muresan CODES+ISSS'04, September 8-10, 2004, Stockholm, Sweden1 Current Flattening in Software and Hardware for Security Applications Authors: R.
R R FID Authentication : M inimizing Tag Computation CHES2006 Rump Session, Yokohama. Japan Ph.D. Jin Kwak Kyushu University, JAPAN
Automatic Application of Power Analysis Countermeasures Ali Galip Bayrak Francesco Regazzoni David Novo Philip Brisk François-Xavier Standaert Paolo Ienne.
SIDE CHANNEL ATTACKS Presented by: Vishwanath Patil Abhay Jalisatgi.
Network Security Essentials Fifth Edition by William Stallings Fifth Edition by William Stallings.
Dan Boneh Public Key Encryption from trapdoor permutations RSA in practice Online Cryptography Course Dan Boneh.
C HAPTER 13 Asymmetric Key Cryptography Slides adapted from "Foundations of Security: What Every Programmer Needs To Know" by Neil Daswani, Christoph Kern,
Database Key Management CSCI 5857: Encoding and Encryption.
Csci5233 Computer Security1 Bishop: Chapter 10 Key Management: Digital Signature.
1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden
Digital Signatures Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 7, 2013.
Sagar Joshi Senior Security Consultant | ACE Team, Microsoft Information Security
Written By: Kris Tiri and Ingrid Verbauwhede Presented By: William Whitehouse.
LOGO Hardware side of Cryptography Anestis Bechtsoudis Patra 2010.
The Misuse of RC4 in Microsoft Office A paper by: Hongjun Wu Institute for Infocomm Research, Singapore ECE 578 Matthew Fleming.
4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.
Analyzing and Testing a justified Prime Number Jeong-kyu YANG Seok-kyu Kang ( Mid-term Presentation )
Strength of Cryptographic Systems Dr. C F Chong, Dr. K P Chow Department of Computer Science and Information Systems The University of Hong Kong.
Primitive Operations. Communication Operations –Reader to tag Read Write –Tag to Tag Read Write Hash and Encryption Operations –Hash: MD5, Sha-1, Sha-256,
Class 5 Channels and Preview CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
Improving Encryption Algorithms Betty Huang Computer Systems Lab
Low-Cost Untraceable Authentication Protocols for RFID Yong Ki Lee, Lejla Batina, Dave Singelée, Ingrid Verbauwhede BCRYPT workshop on RFID Security February.
1 Project Proposals for MAI from COSIC Oct. 6th, pm.
Sandrine AGAGLIATE, FTFC Power Consumption Analysis and Cryptography S. Agagliate Canal+Technologies P. Guillot Canal+Technologies O. Orcières Thalès.
Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.
Lecture 8 Overview. Secure Hash Algorithm (SHA) SHA SHA SHA – SHA-224, SHA-256, SHA-384, SHA-512 SHA-1 A message composed of b bits.
A Quick Tour of Cryptographic Primitives Anupam Datta CMU Fall A: Foundations of Security and Privacy.
Exploiting the Order of Multiplier Operands: A Low-Cost Approach for HCCA Resistance Poulami Das and Debapriya Basu Roy under the supervision of Dr. Debdeep.
DPA Countermeasures by Improving the Window Method Kouichi Itoh, Jun Yajima, Masahiko Takenaka and Naoya Torii Workshop on Cryptographic Hardware and Embedded.
Kouichi Itoh, Tetsuya Izu and Masahiko Takenaka Workshop on Cryptographic Hardware and Embedded Systems (CHES 2002) August, 2002 Address-bit Differential.
The “Taint” Leakage Model Ron Rivest Crypto in the Clouds Workshop, MIT Rump Session Talk August 4, 2009.
Faster Implementation of Modular Exponentiation in JavaScript
DCI – rump session CR ‘05 Jean-Jacques Quisquater DCI – rump session CR ‘05 Jean-Jacques Quisquater Digital Cinema System Specification V1.0 Jean-Jacques.
Course web page: ECE 646 Cryptography and Computer Network Security ECE web page  Courses  Course web pages  ECE 646.
OWASP AppSec Israel, 13/Oct/2015 Yossi Oren, Ben Gurion University Joint work with Vasileios P. Kemerlis,
© Copyright 2009 SSLPost 01. © Copyright 2009 SSLPost 02 a recipient is sent an encrypted that contains data specific to that recipient the data.
Power Analysis Attack on the Masking Type Conversion Algorithm Using Exponentiation Young In Cho', Dong-GukHan g, Seokhie Hong', Young-Ho Park a 'LIST.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Network Security. Three tools Hash Function Block Cipher Public Key / Private Key.
CompSci 314 S2 C Modern Data Communications Revision of lectures #2 to #11 Clark Thomborson 12 August 2010.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
9.2 SECURE CHANNELS JEJI RAMCHAND VEDULLAPALLI. Content Introduction Authentication Message Integrity and Confidentiality Secure Group Communications.
What is BitLocker and How Does It Work? Steve Lamb IT Pro Evangelist, Microsoft Ltd
Return to Home! Go To Next Slide! Return to Home! Go To Next Slide!
Secret Key Cryptography
Web Applications Security Cryptography 1
Home: Tel: , H.P.: Office: 공) 7710A
Network Security.
Public Key Cryptosystems - RSA
continued on next slide
امنیت و اعتماد سخت افزاری
Network Security.
SCA1 Model: Towards a concrete security approach to the design of cryptosystems secure against side-channel attacks1,2 Filipe Rosado da-Fonseca Lisbon,
Professional s Your Name.
The “Taint” Leakage Model
Types of Errors And Error Analysis.
Your name Your organization Your
Presentation transcript:

Rump Session, CHES 2004August 12, 2004 How to Securely Implement Cryptosystems Against Side-Channel Attacks on General Purpose Cryptographic Hardware Filipe Rosado da-Fonseca Portugal

Rump Session, CHES 2004August 12, 2004 Common Implementation 1.The cryptosystem to implement is selected. 2.The cryptosystem is implemented by use of the functions made available by the cryptographic hardware's APIs.

Rump Session, CHES 2004August 12, 2004 Cryptographic Hardware's APIs 1.Non-cryptographic Functions (xor, and, or, not,...): protected against simple side-channel attacks. 2.Cryptographic Primitives (RSA, AES, SHA-1,...): protected against both simple and differential side-channel attacks.

Rump Session, CHES 2004August 12, 2004 Example: CBC-MAC T K (M) { if ((|M|=0)  ((|M| mod 128)≠0)) then return error; n_m:=|M|/128; for(j:=1; j≤n_m; j++) m j :=M[(j-1)*128...j*128-1]; y 0 := > 128 ; for(i:=1; i≤n_m; i++) { x1 i :=xor(m i, y i-1 ); y i :=AES K (x1 i ); } tag:=y n_m ; return tag; }

Rump Session, CHES 2004August 12, 2004 Secure Implementation 1.The cryptosystem to implement is selected. 2.The cryptosystem is tested for leakages. If leakages are found, then one goes back to step 1. Otherwise, one goes to step 3. 3.The cryptosystem is implemented by use of the functions made available by the cryptographic hardware's APIs.

Rump Session, CHES 2004August 12, 2004 Questions and Further Information Annotated Slides: SCA1 Model: