%PDF-1.5 % 1 0 obj << /S /GoTo /D (section.1) >> endobj 4 0 obj (1 Introduction) endobj 5 0 obj << /S /GoTo /D (subsection.1.1) >> endobj 8 0 obj (1.1 Our Contributions) endobj 9 0 obj << /S /GoTo /D (subsection.1.2) >> endobj 12 0 obj (1.2 Organization of the Paper) endobj 13 0 obj << /S /GoTo /D (section.2) >> endobj 16 0 obj (2 Preliminaries) endobj 17 0 obj << /S /GoTo /D (subsection.2.1) >> endobj 20 0 obj (2.1 Notations) endobj 21 0 obj << /S /GoTo /D (subsection.2.2) >> endobj 24 0 obj (2.2 Lightweight Secure PUF \(LSPUF\)) endobj 25 0 obj << /S /GoTo /D (subsection.2.3) >> endobj 28 0 obj (2.3 Security Notion of LSPUF) endobj 29 0 obj << /S /GoTo /D (subsection.2.4) >> endobj 32 0 obj (2.4 Related Works) endobj 33 0 obj << /S /GoTo /D (section.3) >> endobj 36 0 obj (3 Analysis of LSPUF Output Network and Its Vulnerabilities) endobj 37 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 40 0 obj (3.1 Linear Independence of LSPUF Outputs) endobj 41 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 44 0 obj (3.2 Virtual Output Bits and Its Properties) endobj 45 0 obj << /S /GoTo /D (subsection.3.3) >> endobj 48 0 obj (3.3 Reliability of Virtual Outputs) endobj 49 0 obj << /S /GoTo /D (section.4) >> endobj 52 0 obj (4 Proposed Modeling Attack on LSPUF) endobj 53 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 56 0 obj (4.1 Attack Overview) endobj 57 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 60 0 obj (4.2 Attack Strategy-I) endobj 61 0 obj << /S /GoTo /D (subsection.4.3) >> endobj 64 0 obj (4.3 Attack Strategy-II) endobj 65 0 obj << /S /GoTo /D (subsubsection.4.3.1) >> endobj 68 0 obj (4.3.1 Defining Last Virtual Bit vm-1) endobj 69 0 obj << /S /GoTo /D (subsubsection.4.3.2) >> endobj 72 0 obj (4.3.2 Model Building of Last Virtual Bit vm-1) endobj 73 0 obj << /S /GoTo /D (subsection.4.4) >> endobj 76 0 obj (4.4 The Relationship Between p+, x and m in Practice) endobj 77 0 obj << /S /GoTo /D (subsection.4.5) >> endobj 80 0 obj (4.5 Success Probability of the Proposed Attack) endobj 81 0 obj << /S /GoTo /D (subsection.4.6) >> endobj 84 0 obj (4.6 Complexity of the Proposed Attack) endobj 85 0 obj << /S /GoTo /D (subsubsection.4.6.1) >> endobj 88 0 obj (4.6.1 Time Complexity) endobj 89 0 obj << /S /GoTo /D (subsubsection.4.6.2) >> endobj 92 0 obj (4.6.2 Data Complexity) endobj 93 0 obj << /S /GoTo /D (section.5) >> endobj 96 0 obj (5 Experiment and Results) endobj 97 0 obj << /S /GoTo /D (subsection.5.1) >> endobj 100 0 obj (5.1 Experimental Setup) endobj 101 0 obj << /S /GoTo /D (subsection.5.2) >> endobj 104 0 obj (5.2 Results of the Proposed Attack) endobj 105 0 obj << /S /GoTo /D (subsubsection.5.2.1) >> endobj 108 0 obj (5.2.1 Special Case of Attack Strategy-I) endobj 109 0 obj << /S /GoTo /D (subsubsection.5.2.2) >> endobj 112 0 obj (5.2.2 Case-I of Attack Strategy-II) endobj 113 0 obj << /S /GoTo /D (subsubsection.5.2.3) >> endobj 116 0 obj (5.2.3 Case-II of Attack Strategy-II) endobj 117 0 obj << /S /GoTo /D (subsubsection.5.2.4) >> endobj 120 0 obj (5.2.4 Case-III of Attack Strategy-II) endobj 121 0 obj << /S /GoTo /D (section.6) >> endobj 124 0 obj (6 Discussion) endobj 125 0 obj << /S /GoTo /D (section.7) >> endobj 128 0 obj (7 Conclusion) endobj 129 0 obj << /S /GoTo /D (section*.15) >> endobj 132 0 obj (References) endobj 133 0 obj << /S /GoTo /D (IEEEbiography.0) >> endobj 136 0 obj (Biographies) endobj 137 0 obj << /S /GoTo /D (IEEEbiography.1) >> endobj 140 0 obj (Phuong Ha Nguyen) endobj 141 0 obj << /S /GoTo /D (IEEEbiography.2) >> endobj 144 0 obj (Durga Prasad Sahoo) endobj 145 0 obj << /S /GoTo /D [146 0 R /FitH] >> endobj 165 0 obj << /Length 4596 /Filter /FlateDecode >> stream xڝv]_G,i8Vv\Kiӓ$A "[ Rܹ߹:۫ﯾ{I"?^WZ'*ҡju[6ʕN=s} I щ)7[]We);F厁,-҇rׅajg