Proceedings of the 51st Annual Design Automation Conference 2014
DOI: 10.1145/2593069.2596668
|View full text |Cite
|
Sign up to set email alerts
|

Advanced Techniques for Designing Stealthy Hardware Trojans

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(17 citation statements)
references
References 7 publications
0
17
0
Order By: Relevance
“…The replicable partitions are symmetrically-positioned ones, as similar current loads are favorable on these regions. For example, regions (1, 2), (2, 1), (2,3) and (3,2) in Fig. 5 are replicable with each other but not with any other region.…”
Section: Other Normalization Factorsmentioning
confidence: 90%
See 3 more Smart Citations
“…The replicable partitions are symmetrically-positioned ones, as similar current loads are favorable on these regions. For example, regions (1, 2), (2, 1), (2,3) and (3,2) in Fig. 5 are replicable with each other but not with any other region.…”
Section: Other Normalization Factorsmentioning
confidence: 90%
“…2 to handle the process variation, but these methods are not powerful enough for detecting ultra-small HTHs. 2,3 Various e®orts are performed to overcome the challenges of process variation. 5,9 Partial activation of VLSI chips is used in Ref.…”
Section: Trojan Detection Techniquesmentioning
confidence: 99%
See 2 more Smart Citations
“…This directive takes three arguments: the first is a constant expression corresponding to the bit expansion of φ(kφ) −1 N , while the remaining arguments are the names of two macros implementing squaring (for bits 0 in the bit expansion), as well as squaring and multiplying (for bits 1). 5 Using the provided bit expansion, the compiler generates a list of macro calls to either the squaring macro, or the squaring and multiplying one, mapping each such call to the corresponding bit in the bit expansion (starting from the least significant one, without generating any branching code). This list of macros is used at runtime to compute the decryption of the first ciphertext argument of function G. The compiler completes the implementation of function G, by referencing library code to perform the following steps: (i) generate new encryptions 0 (using previous random encryptions of zero as randomness seed); (ii) depending on the result of a Leq test (eq.…”
Section: Library Multiplication and Function Gmentioning
confidence: 99%