On The Feasibility of Internal-Nodes Power Analysis

Slides:



Advertisements
Similar presentations
TOPIC : SYNTHESIS DESIGN FLOW Module 4.3 Verilog Synthesis.
Advertisements

VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Differential Fault Analysis on AES Variants Kazuo Sakiyama, Yang Li The University of Electro-Communications Nagoya, Japan.
LINEAR FEEDBACK SHIFT REGISTERS, GALOIS FIELDS, AND STREAM CIPHERS Mike Thomsen Cryptography II May 14 th, 2012.
Differential Power Analysis of Smartcards How secure is your private information? Author: Ryan Junee Supervisor: Matt Barrie.
Cryptography and Network Security Chapter 3
Block Ciphers and the Data Encryption Standard
Software Connectors. Attach adapter to A Maintain multiple versions of A or B Make B multilingual Role and Challenge of Software Connectors Change A’s.
Introduction to Computer and Network Security Iliano Cervesato 26 August 2008 – Modern Cryptography.
Optimality Study of Logic Synthesis for LUT-Based FPGAs Jason Cong and Kirill Minkovich VLSI CAD Lab Computer Science Department University of California,
1 A Method for Fast Delay/Area Estimation EE219b Semester Project Mike Sheets May 16, 2000.
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
Cryptography Week-6.
KAIS T A lightweight secure protocol for wireless sensor networks 윤주범 ELSEVIER Mar
Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (1) Information Security.
Network Security Lecture 14 Presented by: Dr. Munam Ali Shah.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.
WEP Protocol Weaknesses and Vulnerabilities
Exploiting Cache-Timing in AES: Attacks and Countermeasures Ivo Pooters March 17, 2008 Seminar Information Security Technology.
A paper by: Paul Kocher, Joshua Jaffe, and Benjamin Jun Presentation by: Michelle Dickson.
Intro to Cryptography Lesson Introduction
CRYPTOGRAPHY PRESENTED BY : NILAY JAYSWAL BRANCH : COMPUTER SCIENCE & ENGINEERING ENTRY NO. : 14BCS033 1.
Static Timing Analysis
RC6: The Simple Cipher Presenter: Morgan Monger. RC6 Cipher Created by Ronald Rivest et al. for AES submission Follows the evolution of RC5 cipher –Parameterized.
Reut Caspi & Moriah Stern Advisors: Dr. Osnat Keren & Mr. Itamar Levi.
Lecture 5 Page 1 CS 236 Online More on Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
Control of Dynamic Discrete-Event Systems Lenko Grigorov Master’s Thesis, QU supervisor: Dr. Karen Rudie.
A High Speed TRNG Based on SRAM for Resource Constrained Devices
Cracking Encrypted Systems
Overview on Hardware Security
ISA 400 Management of Information Security
Symmetric Cryptography
Francisco Blas Izquierdo Riera AKA klondike
Xin Fang, Pei Luo, Yunsi Fei, and Miriam Leeser
New Cache Designs for Thwarting Cache-based Side Channel Attacks
ABYSS : An Architecture for Software Protection
Intrusion Tolerance for NEST
6b. Practical Constructions of Symmetric-Key Primitives.
Outline Desirable characteristics of ciphers Uses of cryptography
Modern symmetric-key Encryption
Fast Orbit Feedback System for HEPS (Cooperation work among all related systems) Dapeng Jin Control System Dec. 12, 2017.
Outline Desirable characteristics of ciphers Uses of cryptography
Tradeoff Analysis of Strategies for System Qualities
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
A Novel Framework for Software Defined Wireless Body Area Network
Cryptography Basics and Symmetric Cryptography
Efficient CRT-Based RSA Cryptosystems
Targeted Searches using Q Pipeline
مروري برالگوريتمهاي رمز متقارن(كليد پنهان)
UNIT-8 INVERTERS 11/27/2018.
PART VII Security.
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Security.
STREAM CIPHERS by Jennifer Seberry.
Architectures of distributed systems Fundamental Models
Cryptography and Network Security
Architectures of distributed systems Fundamental Models
Outline Using cryptography in networks IPSec SSL and TLS.
doc.: n Jeff Gilbert Atheros Communications
doc.: n Jeff Gilbert Atheros Communications
SYMMETRIC ENCRYPTION.
Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS
Architectures of distributed systems Fundamental Models
Helen: Maliciously Secure Coopetitive Learning for Linear Models
Advanced Logical Effort
Cryptanalysis Network Security.
Presentation transcript:

On The Feasibility of Internal-Nodes Power Analysis Reut Caspi & Moriah Stern Academic Advisor: Prof. Alexander Fish, Dr. Osnat Keren Advisor: Mr. Itamar Levi

Outline Motivation Background Project Objective Results Further Research Conclusions Power analysis Small Scale Model Real Life Model

Motivation Cryptography is the science of transferring Background Project Objective Results Further Research Conclusions plaintext Cryptographic module ciphertext Motivation Cryptography is the science of transferring information in a secure way. The effort needed to logically break the AES algorithm is the same as the brute-force attack ( 2 𝑛 ). Side channel information is any information that is not obtained from the communication interface, such as the power-supply current dissipation. By utilizing this information an attacker can find secret key very fast (and cheaply). secret key

Power Analysis Attacks Power Attack Procedure: Motivation Background Project Objective Results Further Research Conclusions Power Analysis Attacks Power Attack Procedure: Create a hypothesis of the different currents according to different keys 𝐼 ℎ𝑦𝑝𝑜𝑡ℎ𝑒𝑠𝑖𝑠 =𝐻𝑊∙𝐻𝐷

Power Attack Procedure: Motivation Background Project Objective Results Further Research Conclusions Calculate the correlation between the hypothesis current of each key and the measured current. The hypothesis that yields the largest correlation is most likely of the correct key. Measurement Hypothesis SNR גבוה: זה המפתח הנכון! Key ranking (SNR) 5

Objectives Objective: Parameters to examine: Motivation Background Project Objective Results Further Research Conclusions Objectives Where most research is focused (known crypto architecture) What we are researching Objective: Finding ways to reduce the information that leaks from the combinational part. To explore if it is feasible to attack internal nodes? Under which parameters? Parameters to examine: Fan-out Symmetric / Asymmetric design Logic Structure Noise – Dependent / Independent

Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Small Scale Model A simple module was designed in order to illustrate specific physical-phenomena- related trends we believe exist. Additional circuitry was added to assure the attack is that of an inner node.

Fan-Out => 𝐸=𝐹𝑂∗ 𝐶 𝑖𝑛𝑣 𝑉𝑑𝑑2 Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Fan-Out Larger load capacitance -> energy increase The capacitance is simplified to be linear with the fan-out. 𝐸= 𝐶 𝑙𝑜𝑎𝑑 ∗ 𝑉𝑑𝑑 2 𝐶𝑙𝑜𝑎𝑑 = 𝐹𝑂∗𝐶𝑖𝑛𝑣 Increased PA sensitivity => 𝐸=𝐹𝑂∗ 𝐶 𝑖𝑛𝑣 𝑉𝑑𝑑2

Asymmetry Symmetric design - delay balanced through all-paths. Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Asymmetry Symmetric design - delay balanced through all-paths. Asymmetric design - different delays on different paths. An attack succeeds when different computations leak information at the same time. As the asymmetry increases it is harder to capture such samples.

Asymmetry symmetric asymmetric Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Asymmetry symmetric asymmetric

Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Logical Structure The logical structure implies correlations between intermediate computations. Designs constructed with only AND or only OR based gates are highly sensitive. and or 50% and – 50% or

Current Components current we are interested in measuring Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Current Components current we are interested in measuring “undesired” components: independent of the data - easily filtered out when given enough statistics data dependent - cannot be completely filtered Data dependent current is very prominent when discussing inner nodes. Correctly designed it can enhance the immunity to PA attacks.

Current Components Data-dependent noise noisy ~50 gates no noise Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Current Components Data-dependent noise no noise noisy ~50 gates noisy ~200 gates

Attackability not attackable attackable Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Attackability not attackable attackable

Cost of Fan-Out 859 763 684 637 602 555 547 Area\Energy … Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Cost of Fan-Out Implementations were synthesized with Cadence Encounter RTL Design constraints were used to achieve the desired designs. Design FO2 FO3 FO4 FO5 FO6 FO7 FO8 Total No. of Nodes 859 763 684 637 602 555 547 Area\Energy …

Data dependent currents Motivation Background Project Objective Small Scale Further Research Conclusions Real Life Results Data dependent currents distance from the output increases -> data-dependent “noise” increases (more inner) -> vulnerability to PA attack increases

Motivation Background Project Objective Results Future Research Conclusions Future Research Inner nodes are likely to only be dependent on part of the input. Hypothesis functions must be created for sub-keys to remove unwanted noise. Example: 𝑓 𝑥 1 ,… 𝑥 8 , 𝑘 1 ,… 𝑘 8 = 𝑥 1 ⊕ 𝑘 1 ∗ 𝑥 2 ⊕ 𝑘 2 ∗ 𝑥 3 ⊕ 𝑘 3 ∗ 𝑥 4 ⊕ 𝑘 4

Conclusions YES! Is power analysis feasible in inner nodes? Sometimes… Motivation Background Project Objective Results Future Research Conclusions Conclusions Is power analysis feasible in inner nodes? YES! Sometimes… What effects the feasibility / quality of an attack? fan-out asymmetry noise logic structure etc. What is the cost? enhanced security larger no. of gates larger area

Thank You!