How Fast Can Higher-Order Masking Be in Software?-Reference-Cited by-同舟云学术

How Fast Can Higher-Order Masking Be in Software?

Published:2017 Issue: Volume: Page:567-597
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Goudarzi Dahmun,Rivain Matthieu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-56620-7_20

Reference36 articles.

1. Lecture Notes in Computer Science;J Balasch,2015

2. Lecture Notes in Computer Science;G Barthe,2015

3. Barthe, G., Dupressoir, F., Faust, S., Grégoire, B., Standaert, F.-X., Strub, P.-Y.: Parallel implementations of masking schemes and the bounded moment leakage model. Cryptology ePrint Archive, Report 2016/912 (2016). http://eprint.iacr.org/2016/912

4. Lecture Notes in Computer Science;E Biham,1997

5. Lecture Notes in Computer Science;B Bilgin,2014

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Feistel Ciphers for Efficient Prime Field Masking;Lecture Notes in Computer Science;2024

2. Leveraging Coprocessors as Noise Engines in Off-the-Shelf Microcontrollers;Lecture Notes in Computer Science;2024

3. Compositional Verification of First-Order Masking Countermeasures against Power Side-Channel Attacks;ACM Transactions on Software Engineering and Methodology;2023-12-05

4. Combined Private Circuits - Combined Security Refurbished;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

5. Compositional Verification of Efficient Masking Countermeasures against Side-Channel Attacks;Proceedings of the ACM on Programming Languages;2023-10-16