Security Design for IEEE P1687

Slides:



Advertisements
Similar presentations
Introduction to DFT Alexander Gnusin.
Advertisements

BOUNDARY SCAN.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 31/22alt1 Lecture 31 System Test (Lecture 22alt in the Alternative Sequence) n Definition n Functional.
Copyright 2001, Agrawal & BushnellLecture 12: DFT and Scan1 VLSI Testing Lecture 10: DFT and Scan n Definitions n Ad-hoc methods n Scan design  Design.
Xiutao Feng Institute of Software Chinese Academy of Sciences A Byte-Based Guess and Determine Attack on SOSEMANUK.
FPGA Configuration. Introduction What is configuration? – Process for loading data into the FPGA Configuration Data Source Configuration Data Source FPGA.
Apr. 20, 2001VLSI Test: Bushnell-Agrawal/Lecture 311 Lecture 31 System Test n Definition n Functional test n Diagnostic test  Fault dictionary  Diagnostic.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
1 SECURE-PARTIAL RECONFIGURATION OF FPGAs MSc.Fisnik KRAJA Computer Engineering Department, Faculty Of Information Technology, Polytechnic University of.
LOGSYS Development Environment of Embedded Systems Tamás Raikovich Béla Fehér Péter Laczkó Budapest University of Technology and Economics Department of.
Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.
The ARM7TDMI Hardware Architecture
Copyright 2001, Agrawal & BushnellDay-2 PM Lecture 101 Design for Testability Theory and Practice Lecture 10: DFT and Scan n Definitions n Ad-hoc methods.
Introduction to Information Technology: Your Digital World © 2013 The McGraw-Hill Companies, Inc. All rights reserved.Using Information Technology, 10e©
JTAG Course Lecturer: Tomer Rothschild
Lecture 28 IEEE JTAG Boundary Scan Standard
Feng-Xiang Huang A Low-Cost SOC Debug Platform Based on On-Chip Test Architectures.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 291 Lecture 29 IEEE JTAG Advanced Boundary Scan & Description Language (BSDL) n Special scan.
Spring 08, Apr 17 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2008 System Test Vishwani D. Agrawal James J. Danaher.
1 Lecture 23 Design for Testability (DFT): Full-Scan n Definition n Ad-hoc methods n Scan design Design rules Scan register Scan flip-flops Scan test sequences.
Real-Time Systems Design JTAG – testing and programming.
Vishwani D. Agrawal James J. Danaher Professor
Spring 07, Jan 25 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 VLSI System DFT Vishwani D. Agrawal James J. Danaher.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 20alt1 Lecture 20alt DFT: Partial, Random-Access & Boundary Scan n Definition n Partial-scan architecture.
IC-SOC STEAC: An SOC Test Integration Platform Cheng-Wen Wu.
TAP (Test Access Port) JTAG course June 2006 Avraham Pinto.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 241 Lecture 24 Design for Testability (DFT): Partial-Scan & Scan Variations n Definition n Partial-scan.
BIST vs. ATPG.
ASPPRATECH.
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
Scan and JTAG Principles1 Scan and JTAG Principles ARM Advanced RISC Machines.
IEEE-1394 Data Link Design Review Sherry Womack Erik Pace ECE 4040 Dr. Martin Brooke.
® ChipScope ILA TM Xilinx and Agilent Technologies.
BS Test & Measurement Technique for Modern Semi-con devices & PCBAs.
IEEE P1687 Obstacle Course John Potter Sr. Principal Technologist
Reporter: PCLee. Assertions in silicon help post-silicon debug by providing observability of internal properties within a system which are.
National Taiwan University JTAG and Multi-ICE Speaker : 沈文中.
Standard based Instrumentation schemes for 3D SoC Neal Stollon Chairman, Nexus 5001 Forum
MICROPROCESSOR INPUT/OUTPUT
Presenter: Hong-Wei Zhuang On-Chip SOC Test Platform Design Based on IEEE 1500 Standard Very Large Scale Integration (VLSI) Systems, IEEE Transactions.
Testing of integrated circuits and design for testability J. Christiansen CERN - EP/MIC
LEONARDO INSIGHT II / TAP-MM ASTEP - The Boundary Scan Test (BST) technology © J. M. Martins Ferreira - University of Porto (FEUP / DEEC)1 The Boundary.
1 System-on-Chip (SoC) Testing An Introduction and Overview of IEEE 1500 Standard Testability Method for Embedded Core-based ICs.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Reducing Test Application Time Through Test Data Mutation Encoding Sherief Reda and Alex Orailoglu Computer Science Engineering Dept. University of California,
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Boundary Scan.
Introduction Advantage of DSP: - Better signal quality & repeatable performance - Flexible  Easily modified (Software Base) - Handle more complex processing.
EE3A1 Computer Hardware and Digital Design
25 April 2000 SEESCOASEESCOA STWW - Programma Evaluation of on-chip debugging techniques Deliverable D5.1 Michiel Ronsse.
April 20, 2001VLSI Test: Bushnell-Agrawal/Lecture 281 Lecture 28 IEEE JTAG Boundary Scan Standard n Motivation n Bed-of-nails tester n System view.
Improving NoC-based Testing Through Compression Schemes Érika Cota 1 Julien Dalmasso 2 Marie-Lise Flottes 2 Bruno Rouzeyre 2 WNOC
LEONARDO INSIGHT II / TAP-MM ASTEP - Introduction to mixed-signal testing using the standard © J. M. Martins Ferreira - University of Porto (FEUP.
Power Problems in VLSI Circuit Testing Keynote Talk Vishwani D. Agrawal James J. Danaher Professor Electrical and Computer Engineering Auburn University,
NAM S.B MDLAB. Electronic Engineering, Kangwon National University 1.
SYSTEM-LEVEL TEST TECHNIQUES INTRODUCTION In the 1970s, the in-circuit testing (ICT) method appeared. In the 1970s, the in-circuit testing (ICT) method.
ECE 353 Introduction to Microprocessor Systems
JTAG and Multi-ICE National Taiwan University
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 2)
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
ECE 434 Advanced Digital System L18
Lecture 23 Design for Testability (DFT): Full-Scan (chapter14)
VLSI Testing Lecture 15: System Diagnosis
The Xilinx Virtex Series FPGA
CPE/EE 428/528 VLSI Design II – Intro to Testing
CPE/EE 422/522 Advanced Logic Design L17
The Xilinx Virtex Series FPGA
Lecture 26 Logic BIST Architectures
VLSI Testing Lecture 13: DFT and Scan
STAM: The Final Frontiers of System Test Access Management
Presentation transcript:

Security Design for IEEE P1687 Hejia Liu Major Professor: Vishwani D. Agrawal

Introduction Part 1: Introduction of IEEE P1687 (IJTAG) security risks in P1687 Part 2: Security design and expected unlocking time Part 3: Discussion of a proposal and improvement in security Apr 8, 2014 Liu: MEE Project

IEEE 1149.1 (JTAG) Interface Apr 8, 2014 Liu: MEE Project

What is P1687/ IJTAG? IEEE P1687 is a valuable tool for accessing on- chip instruments during test, diagnosis, debug and board configurations. P1687 is a proposed IEEE Standard that has 3 components A flexible set of serial scan chain techniques for the instrument access architecture (called the network) A network description language (called instrument connectivity language, ICL) An instrument vector language (called procedure description language, PDL) IEEE P1687 is a valuable tool for accessing on-chip instruments during test, diagnosis, debug and board configurations. Apr 8, 2014 Liu: MEE Project

Communication between Chips An example of communication P1687 network between 3 chips Apr 8, 2014 Liu: MEE Project

Instruments, IPs An IP (Intellectual property core) with a P1687 compliant interface is named instrument. IPs: Analog, digital or mixed signal circuitry performing particular functions, such as a clock a generator, an interface to an external measurement probe, a radio tuner, an analog signal converter, a digital signal processor, etc. Apr 8, 2014 Liu: MEE Project

P1687 Network TAP controller : All transitions between states are determined by TMS Decoder: EXTEST, SAMPLE/PRELOAD, IDCODE, BYPASS SIB can provide 2 accessing path. When a SIB is open, it will include the segments in the next level to the scan path. SIB is closed, exclude the next level path to scan path. Rst Optional Apr 8, 2014 Liu: MEE Project

FSM of TAP Controller FSM: only the shaded states affect the ASIC core logic, the other states are intermediate steps The pause states let the controller jog in place while the tester reloads its memory with a new set of test vectors Apr 8, 2014 Liu: MEE Project

Security Risks Depending on the application, data may be stored on-chip, including chip ID, codes, and encryption keys. An attacker can access a targeted instrument and obtain the secret data easily. Open every SIBs in the network will let the attacker access targeted instrument. Apr 8, 2014 Liu: MEE Project

A Possible Break-in Procedure Step 1: Load Instruction code in TAP Step 2: Shift in an attempt vector Step 3: Clock the TAP controller Step 4: If attempt successful, access instrument Step 5: Else, repeat from step 2 Apr 8, 2014 Liu: MEE Project

Security Levels Insecurity: Break-in time at the level of days Weak security: Break-in time at the level of years Strong security: Break-in time at the level of ten years Full Security: Break-in time in the level of thousand years The security design doesn’t need to be a silver bullet solution for protecting something absolutely critical. We aim to make the attacker pay more efforts when we increase the security level of structure. Apr 8, 2014 Liu: MEE Project

Structure of SIB (Segment Insertion Bit) Select=1 ShiftEn=1 To_TDI2 To_TDO1 1 1 1 TDI Update cell 1 Select Shift cell From_TDO2 ShiftEn There are 2 flip flops in 1 SIB. The label with No.1 is belonging to the current level The label with No. 2 is for the next level TDI is always as an input In this image, SIB includes the input from next level Select TCK UpdateEn Apr 8, 2014 Liu: MEE Project

Structure of SIB (Segment Insertion Bit) Select=0 ShiftEn=1 To_TDO1 To_TDI2 1 1 TDI 1 Update cell Select Shift cell From_TDO2 ShiftEn There are 2 flip flops in 1 SIB. The label with No.1 is belonging to the current level The label with No. 2 is for the next level TDI is always as an input In this image, SIB excludes the input from next level SIB IS CLOSE. Select TCK updateEn Apr 8, 2014 Liu: MEE Project

The Structure of SIB (Segment Insertion Bit) ShiftEn=0 UpdateEn=1 To_TDI2 To_TDO1 1 1 1 TDI Update cell 1 Shift cell 1 Select From_TDO2 ShiftEn How to Change the value in UPDATE cell Clock TAP FSM in UPDAREdr UPDATE en=1 Then the value will be delivered from the shiftCELL 1 shift in value in shift cell 2 clock TAP to updatecDR state and deliver the value from shift cell to update cell Select TCK UpdateEn Apr 8, 2014 Liu: MEE Project

Locking-SIB With Trap Select 1 1 1 RST Shift cell Update cell Dworak, et al.. ,”Don’t forget to lock your SIB:Hiding instrument using P1687,” ITC 2013 Locking-SIB With Trap To_TDI2 To_TDO1 1 1 1 RST TDI Shift cell Update cell From_TDO1 ShiftEn Select TCK Select signal of mux in frond of UPDATE cell is repaced by the output of and gate Locking part: The keys are from other cell in the scan chain. Trap part: The current value of Update cell will also feed back to AND gate Only KEYS and current value in update cell ARE CORRECT , the updateEN will be delivered to the multiplexer and active the path from Shift cell to update cell. UpdateEn Key[0] Key[n] Trap feedback select signal Whether the key and trap feedback value is 1 or 0 is decided by structure Select Apr 8, 2014 Liu: MEE Project

Unsecure and Secure P1687 Networks Apr 8, 2014 Liu: MEE Project

Break-in Procedure Cost(LSIB unlock attempt w/Trap) =10+2𝑛+𝑑 Dworak, et al., “Don’t forget to lock your SIB: Hiding instrument using P1687,” ITC 2013 Break-in Procedure Cost(LSIB unlock attempt w/Trap) =10+2𝑛+𝑑 Prob(opening SIB with key of k bits) = 1 2 𝑘+1 Expected Cost(LSIB unlock w/Trap) =(10+2𝑛+𝑑) 2 𝑘+1 Apr 8, 2014 Liu: MEE Project

Complex Structure Security Strategies Break-in procedures: Step 1: Break-in the first level Step 2: Figure out the CARE BITs a: Shift in attempt vectors b: Clock TAP in UpdateDR c: Test positive feedback Step 3: Break-in the next level Step 4: Repeat step 2 and step 3 until the instrument is accessed Apr 8, 2014 Liu: MEE Project

Expected Results (f = 100MHz) Key length K Chain Length N Expected time to unlock LSIB with Trap Days Years 8 640 7.79E-07 2.13E-09 16 1280 3.94E-04 1.08E-06 32 2560 5.13E+01 1.41E-01 48 5120 6.69E+06 1.83E+04 64 10240 8.76E+11 2.40E+09 80 20480 1.15E+17 3.15E+14 96 40960 1.50E+22 4.11E+19 Apr 8, 2014 Liu: MEE Project

Features of Secure Structure The order of magnitudes for break-in time: k+1 log⁡( 2𝑁 f ) An attacker uses the scan chain length as a feedback What if we hide the length of the scan path? Apr 8, 2014 Liu: MEE Project

An Original Proposal: Use SLFSR (Secure LFSR) to Hide Scan Path Length Apr 8, 2014 Liu: MEE Project

SLFSR Example 3-stage SLFSR, R= 2 3 −1=7 Apr 8, 2014 Liu: MEE Project

Break-in Procedure 1 attempt= n*+𝐸+2𝑅+10 Apr 8, 2014 Liu: MEE Project

Attacker’s Strategies Condition 1: Attempt length is n*< N 𝑇𝑜𝑡𝑎𝑙 𝑛𝑒𝑐𝑒𝑠𝑠𝑎𝑟𝑦 𝑐𝑜𝑠𝑡 𝑤ℎ𝑒𝑛 𝑛 ∗ <𝑛 = 𝑛∗ (𝑛 ∗ +𝐸+2𝑅+10 ) 2 𝑛∗ 𝑅 Condition 2: Attempt length is n*= N 𝐸𝑥𝑝𝑒𝑐𝑡𝑒𝑑 𝑐𝑜𝑠𝑡=[ 𝑁 +2𝑅+10+𝐸 ∙𝑅] 2 𝑘+1 Condition 3: Attempt length n*> N 𝐸𝑥𝑝𝑒𝑐𝑡𝑒𝑑 𝑐𝑜𝑠𝑡=[ 𝑛 ∗ +2𝑅+10+𝐸 ∙𝑅] 2 𝑘+1 Apr 8, 2014 Liu: MEE Project

Expected Results (f = 100MHz) Condition 3: Key length K Chain length N Expected time to unlock LSIB with SLFSR(days) cycles %Increase Compared to Trap without SLFSR Days Years 8 32 2.32E-07 6.36E-10 2.01e+05 395.9596 16 64 9.34E-05 2.56E-07 8.07e+07 377.9141 128 1.06E+01 2.90E-02 9.14E+12 365.6357 40 160 3.28e+03 8.98 2.83E+15 362.8169 48 192 9.85E+05 2.70E+03 8.51E+17 360.8592 56 224 2.90E+08 7.93e+05 2.50E+20 359.4203 256 8.37E+10 2.29e+08 7.23E+22 358.3181 80 320 6.74E+15 1.85E+13 5.82E+27 356.7407 96 384 5.24E+20 1.44E+18 4.53E+32 355.6663 Apr 8, 2014 Liu: MEE Project

Disadvantage Compared to Structure without SLFSR In fact, we are increasing the feedback keys alternately. For the secure chain without LFSR,   Total expected unlocking time without LFSR = (10+2N+d) 2 𝑘+1   For the secure chain in the worst case condition (condition 3) : Total expected unlocking time with LFSR   = (10+N+2R) 2 𝑘+1−𝑚 ( 2 𝑚 −1) Comparing 2 equations, for large n, the efficiency ratio: Expected time w/no SLFSR Expected time w/SLFSR ≈2, when N→∞ Apr 8, 2014 Liu: MEE Project

Conclusion It is useful we replace the non-functional segments with SLFSR Security SLFSR increases attacker’s effort as breaking not only depends on the structure we build up, but also the strategies that attacker chooses. We should be concerned about the “lucky” attacker Apr 8, 2014 Liu: MEE Project