2015 IEEE International Symposium on Hardware Oriented Security and Trust (HOST) 2015
DOI: 10.1109/hst.2015.7140227
|View full text |Cite
|
Sign up to set email alerts
|

Silent Simon: A threshold implementation under 100 slices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 11 publications
0
16
0
Order By: Relevance
“…There have been a number of results demonstrating record-breaking FPGA implementations [8,23], some with side channel mitigations [12,28], and highly efficient microcontroller implementations [11,17,20]. Novel uses have been proposed, including explorations showing the suitability of Simon in the decidedly non-lightweight realm of homomorphic encryption [27,18].…”
Section: Others' Workmentioning
confidence: 99%
“…There have been a number of results demonstrating record-breaking FPGA implementations [8,23], some with side channel mitigations [12,28], and highly efficient microcontroller implementations [11,17,20]. Novel uses have been proposed, including explorations showing the suitability of Simon in the decidedly non-lightweight realm of homomorphic encryption [27,18].…”
Section: Others' Workmentioning
confidence: 99%
“…Because of its lightweight structure, SIMON circuit has weak resistance to power analysis attack. Some studies have clearly demonstrated or implemented the crack of SIMON circuits through power analysis such as Refs [2,8,10,11]. The purpose of this section is to show intuitively through analysis and experiment that the SIMON circuit can be cracked by simple differential power analysis.…”
Section: Differential Power Attack On Simonmentioning
confidence: 99%
“…The encrypted operation of fault plaintext is randomly inserted into the first half cycle or the second half cycle of normal encrypted operation by double rate technology so that the attacker cannot accurately locate the position of each round of encryption operations in the power curve. Compared with existing countermeasure based on the threshold implementation and bool mask [2,6,11], our scheme is area-efficient.…”
Section: Introductionmentioning
confidence: 99%
“…7 and reported in [68], in every clock cycle, 1-bit of internal state is processed. So if the circuit takes nbit size plaintext as input, n/2-clock cycles will be required to complete the whole round.…”
Section: -Ti Simon-128/128mentioning
confidence: 99%