References
Zhang F, Lou X X, Zhao X J, et al. Persistent fault analysis on block ciphers. IACR Trans Cryptograph Embed Syst, 2018, 2018: 150–172
Joye M, Tunstall M. Fault Analysis in Cryptography. Berlin: Springer, 2012
Ferrante M, Saltalamacchia M. The coupon collector’s problem. Mater Matemàtics, 2014, 2014: 1–35
Flajolet P, Gardy D, Thimonier L. Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl Math, 1992, 39: 207–229
Acknowledgements
This work was supported in part by Open Fund of State Key Laboratory of Cryptology (MMKFKT201805), Zhejiang Key R&D Plan(2019C03133), Major Scientific Research Project of Zhejiang Lab (2018FD0ZX01), Young Elite Scientists Sponsorship Program by CAST(17-JCJQ-QT-045), Alibaba-Zhejiang University Joint Institute of Frontier Technologies.
Author information
Authors and Affiliations
Corresponding author
Supplementary File
Rights and permissions
About this article
Cite this article
Zhang, F., Xu, G., Yang, B. et al. Theoretical analysis of persistent fault attack. Sci. China Inf. Sci. 63, 139102 (2020). https://doi.org/10.1007/s11432-018-9818-y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-018-9818-y