formalism to assess the
play

"Formalism to Assess the Entropy and Reliability of Loop - PowerPoint PPT Presentation

Nov 14, 2022 •115 likes •335 views

CRYPTARCHI 2017 Smolenice "Formalism to Assess the Entropy and Reliability of Loop PUF" Jean-Luc Danger 1,2 Olivier Rioul 1 Sylvain Guilley 1,2 Alexander Schaub 1 1 Tlcom ParisTech, LTCI, UPSAY 2 Secure-IC Page 1

  1. CRYPTARCHI 2017 Smolenice "Formalism to Assess the Entropy and Reliability of Loop PUF" Jean-Luc Danger 1,2 Olivier Rioul 1 Sylvain Guilley 1,2 Alexander Schaub 1 1 Télécom ParisTech, LTCI, UPSAY 2 Secure-IC Page 1 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  2. Outline  Loop PUF architecture  Entropy assessment  Reliability assessment  Results on real silicon  Conclusions * Depends on algorithm, not implementation Page 2 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  3. Loop PUF architecture Page 3 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  4. Operating Mode The information for each challenge is D Sign = identifier Module = reliability Page 4 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  5. Balance of Delay Elements in ASIC duplication Page 5 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  6. Balance of Delay Elements in FPGA Cluster 2 Cluster N Cluster 1 duplication N duplications Page 6 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  7. Delay measurement Page 7 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  8. Entropy  For a n-delay LPUF  If challenge = Hadamard codeword of n bits => Entropy = n * * Rioul, O., Solé, P ., Guilley, S., & Danger, J. L. (2016, July). On the Entropy of Physically Unclonable Functions. In Information Theory (ISIT), 2016 IEEE International Symposium on (pp. 2928-2932). IEEE. Page 8 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  9. Entropy with more than n challenges Page 9 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  10. LPUF reliability With Page 10 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  11. LPUF reliability The Reliability is not enough ~10 -3 even with high SNR => Needs of secure sketch : Error Correcting codes and Helper data Page 11 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  12. Reliability enhancement by delay knowledge Bit unreliable  |delay| < Th Th= W s The bits in the unreliable area "B" are discarded The helper data indicates the unreliable bits Page 12 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  13. New BER with filtered bits Page 13 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  14. Entropy after bit filtering Number of delay elements to reach n bits of entropy with Hadamard codes Page 14 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  15. Results on real silicon  n=54 cells, 65nm technology Page 15 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  16. i..i.d. check Correlation matrix on the 64 elements of the 49 PUFs No correlation between the 64 delay elements => entropy ~ 64 with Hadamard codes Page 16 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  17. Impact of the measurement window on the SNR SNR ~60 for log 2 L=14 Page 17 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  18. Entropy Page 18 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  19. Reliability: BER results Page 19 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  20. Conclusions  The Entropy of the Loop PUF can be formally obtained if Hadamard codes are used: N=Number of challenges  Entropy = number of delay elements n  The entropy increases non linearly if M > n  The reliability of the Loop PUF is low (BER ~10 -3 )  It can be easily improved by exploiting the delay knowledge  The unreliable bits are discarded  BER can go down 10 -9  But more bits are needed to reach the same entropy Page 20 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

  21. THANK YOU FOR YOUR ATTENTION Page 21 Télécom-ParisTech Jean-Luc Danger CRYPTARCHI 2017

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

using formalism in HCI from cognitive models to placemats From Formalism to

using formalism in HCI from cognitive models to placemats From Formalism to

using formalism in HCI from cognitive models to placemats From Formalism to Physicality, Alan Dix, UPC North, 30 April 2008 what to model users cognitive models task models system behaviour

313 views • 5 slides
a brief history of formalism from Aristotle to Alan Turing From Formalism to

a brief history of formalism from Aristotle to Alan Turing From Formalism to

a brief history of formalism from Aristotle to Alan Turing From Formalism to Physicality, Alan Dix, UPC North, 30 April 2008 first steps Aristotle (384 BC - 322 BC) foundations of logic Euclid (325 BC - 265 BC)

217 views • 4 slides
Statecharts aka Harel Charts Visual Modelling 1. Higraph formalism 2. Statechart formalism

Statecharts aka Harel Charts Visual Modelling 1. Higraph formalism 2. Statechart formalism

Statecharts aka Harel Charts Visual Modelling 1. Higraph formalism 2. Statechart formalism (combines Higraphs and State Automata) Diverse applications. In particular: concurrent systems behaviour Hans Vangheluwe hv@cs.mcgill.ca Modelling and

433 views • 30 slides
How often do we assess our pupils? Parents often ask us how often we assess our pupils. The

How often do we assess our pupils? Parents often ask us how often we assess our pupils. The

How often do we assess our pupils? Parents often ask us how often we assess our pupils. The answer is, every 45 minutes! During each lesson teachers monitor childrens progress towards the curriculum objectives and their personal targets.

586 views • 30 slides
Renormalization of a Second Order Formalism for Spin 1 / 2 Fermions e Ren Angeles-Mart

Renormalization of a Second Order Formalism for Spin 1 / 2 Fermions e Ren Angeles-Mart

QFT and NKR formalism Quantization Renormalization Conclusions Renormalization of a Second Order Formalism for Spin 1 / 2 Fermions e Ren Angeles-Mart nez Mauro Napsuciale-Mendivil Science and Engineering Division - University of

618 views • 37 slides
My main messages The N formalism covers all scalar-field cases Slow-roll inf., k -inf.,

My main messages The N formalism covers all scalar-field cases Slow-roll inf., k -inf.,

Aspects of the N formalism David H. Lyth Particle Theory and Cosmology Group Physics Department Lancaster University Cambridge2006 p.1/18 My main messages The N formalism covers all scalar-field cases Slow-roll inf., k -inf.,

884 views • 85 slides
On the (non-)uniqueness of the Levi-Civita solution in the Einstein-Hilbert-Palatini formalism

On the (non-)uniqueness of the Levi-Civita solution in the Einstein-Hilbert-Palatini formalism

Introduction Palatini formalism General solution Geometrical properties Physical observability Future work Conclusions On the (non-)uniqueness of the Levi-Civita solution in the Einstein-Hilbert-Palatini formalism Jos Alberto Orejuela

821 views • 46 slides
Model-checking with the TimeLine formalism Andrea Zaccara

Model-checking with the TimeLine formalism Andrea Zaccara

Model-checking with the TimeLine formalism Andrea Zaccara Andrea.Zaccara@student.uantwerpen.be University of Antwerp 1 Overview The Timeline formalism

357 views • 17 slides
Foundations of AI 11. Planning Planning in Situational Calculus, STRIPS Formalism, Non-Linear

Foundations of AI 11. Planning Planning in Situational Calculus, STRIPS Formalism, Non-Linear

Foundations of AI 11. Planning Planning in Situational Calculus, STRIPS Formalism, Non-Linear Planning Wolfram Burgard &amp; Bernhard Nebel Contents Planning vs. Problem Solving Planning in Situation Calculus STRIPS Formalism

331 views • 30 slides
Overview Motivation IDHRG model Interaction within S-matrix formalism Results Summary

Overview Motivation IDHRG model Interaction within S-matrix formalism Results Summary

T HERMODYNAMICS AND FLUCTUATIONS - CORRELATIONS OF CONSERVED CHARGES IN A HADRON RESONANCE GAS MODEL WITH ATTRACTIVE AND REPULSIVE INTERACTION WITHIN S- MATRIX FORMALISM Subhasis Samanta National Institute of Science Education and Research

660 views • 20 slides
P Systems: A formalism for computing and for systems biology Andrea Maggiolo Schettini

P Systems: A formalism for computing and for systems biology Andrea Maggiolo Schettini

P Systems: A formalism for computing and for systems biology Andrea Maggiolo Schettini Dipartimento di Informatica, Universit` a di Pisa, Italy Torino November 16, 2009 Andrea Maggiolo Schettini (Univ. di Pisa) P Systems: A formalism for

761 views • 49 slides
A nonlinear thermodynamical formalism J er ome BUZZI (CNRS Orsay) Joint work with Renaud

A nonlinear thermodynamical formalism J er ome BUZZI (CNRS Orsay) Joint work with Renaud

A nonlinear thermodynamical formalism J er ome BUZZI (CNRS Orsay) Joint work with Renaud LEPLAIDEUR Seminar Resist encia Din amica July 10, 2020 J. Buzzi A nonlinear thermodynamical formalism July 2020 1 / 11 Outline Setup 1 A

444 views • 41 slides
dialogue notations what to do when From Formalism to Physicality, Alan Dix, UPC

dialogue notations what to do when From Formalism to Physicality, Alan Dix, UPC

dialogue notations what to do when From Formalism to Physicality, Alan Dix, UPC North, 30 April 2008 what is dialogue? conversation between two or more parties usually cooperative in user interfaces refers

393 views • 13 slides
THermodynamic Formalism and Uncertainty Quantification Luc Rey-Bellet University of

THermodynamic Formalism and Uncertainty Quantification Luc Rey-Bellet University of

THermodynamic Formalism and Uncertainty Quantification Luc Rey-Bellet University of Massachusetts Amherst Quantissima III, Venice, August 2019 Work supported by NSF and AFOSR 1 Collaborators on related projects Paul Dupuis (Brown

827 views • 34 slides
Projects (upcoming) Assess Portfolio Machine Learning for Trading Assess Learners &amp;

Projects (upcoming) Assess Portfolio Machine Learning for Trading Assess Learners &amp;

Projects (upcoming) Assess Portfolio Machine Learning for Trading Assess Learners &amp; Defeat Learners Software Platform Market Simulator Introduction &amp; Installation Towards Sharpe Ratio Sharpe Ratio 1 Intuition Considers

563 views • 11 slides
the ESTRO formalism Maria Rosa Malisan 2 AAPM RPT 258 A protocol is presented for the

the ESTRO formalism Maria Rosa Malisan 2 AAPM RPT 258 A protocol is presented for the

School on Medical Physics for Radiation Therapy : Dosimetry and Treatment Planning for Basic and Advanced Applications Trieste - Italy, 25 March -5 April 2019 MU Calculation: the ESTRO formalism Maria Rosa Malisan 2 AAPM RPT 258 A

727 views • 46 slides
t t s r rstr s

t t s r rstr s

t t s r rstr s rr s rst

909 views • 52 slides
Hacking the Query Planner, Again Richard Guo / VMware PGCon 2020 Agenda What does planner

Hacking the Query Planner, Again Richard Guo / VMware PGCon 2020 Agenda What does planner

Hacking the Query Planner, Again Richard Guo / VMware PGCon 2020 Agenda What does planner do? Phases of planning Overall backend structure Parser Determines the semantic meaning of a query string Rewriter

729 views • 52 slides
SDR4IoT an Experiment Part of Fed4FIRE+ in w-iLab.t Testbeds @alexis0duque #FOSDEM #FSR

SDR4IoT an Experiment Part of Fed4FIRE+ in w-iLab.t Testbeds @alexis0duque #FOSDEM #FSR

SDR4IoT an Experiment Part of Fed4FIRE+ in w-iLab.t Testbeds @alexis0duque #FOSDEM #FSR #SDR #IoT #ML @alexis0duque ` Who am I? Alexis DUQUE Director of Research &amp; Development @alexis0duque alexisduque alexisd@rtone.fr

536 views • 39 slides
SC 2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H.

SC 2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H.

SC 2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldnt fit) 1 University of Bath, LORIA, Fondazione Bruno Kessler

592 views • 8 slides
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code Birenjith Sasidharan, Myna Vajha

An Explicit, Coupled-Layer Construction of a High-Rate MSR Code Birenjith Sasidharan, Myna Vajha

An Explicit, Coupled-Layer Construction of a High-Rate MSR Code Birenjith Sasidharan, Myna Vajha and P. Vijay Kumar Indian Institute of Science, Bangalore Dagstuhl Seminar: Coding Theory in the Time of Big Data August 7-12, 2016 Regenerating

500 views • 25 slides
Post Quantum Crypto B e r n d F i x &lt; b r f @ h o i - p o l l o i . o

Post Quantum Crypto B e r n d F i x &lt; b r f @ h o i - p o l l o i . o

1 / 2 9 Post Quantum Crypto B e r n d F i x &lt; b r f @ h o i - p o l l o i . o r g &gt; Post-Quantum Crypto Bernd Fix &lt; b r f @ h o i - p o l l o i . o r g &gt; 2 / 2 9 Intro P r

340 views • 29 slides
Decoding ReedMuller Codes Using Redundant Code Constraints Mengke Lian , Christian H ager

Decoding ReedMuller Codes Using Redundant Code Constraints Mengke Lian , Christian H ager

Decoding ReedMuller Codes Using Redundant Code Constraints Mengke Lian , Christian H ager , Henry D. Pfister Department of Electrical and Computer Engineering, Duke University Department of Electrical Engineering,

539 views • 37 slides
A comparison of efficient designs for choices between two options Heiko Gromann Queen Mary,

A comparison of efficient designs for choices between two options Heiko Gromann Queen Mary,

A comparison of efficient designs for choices between two options Heiko Gromann Queen Mary, University of London (joint work with H. Holling, U. Grahoff and R. Schwabe) mODa 8 Almagro, 7 June 2007 Outline Background Relationship

727 views • 43 slides

More recommend