A secure implementation of a symmetric encryption algorithm in white-box attack contexts

DOI10.1155/2013/431794MaRDI QIDQ1789910zbMATH OpenOpenAlexWikidataFDO

Authors Yang Shi, Qin Liu, Qinpei Zhao

Publication date 10 October 2018

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/431794

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Review text

Summary: In a white-box context, an adversary has total visibility of the implementation of the cryptosystem and full control over its execution platform. As a countermeasure against the threat of key compromise in this context, a new secure implementation of the symmetric encryption algorithm SHARK is proposed. The general approach is to merge several steps of the round function of SHARK into table lookups, blended by randomly generated mixing bijections. We prove the soundness of the implementation of the algorithm and analyze its security and efficiency. The implementation can be used in web hosts, digital right management devices, and mobile devices such as tablets and smart phones. We explain how the design approach can be adapted to other symmetric encryption algorithms with a slight modification.

Recommendations

• On security of a white-box implementation of SHARK
• Attacks and countermeasures for white-box designs
• scientific article; zbMATH DE number 1951616
• Selected Areas in Cryptography
• White-box security notions for symmetric encryption schemes

Cited in

(1)

• On security of a white-box implementation of SHARK

This page was built for publication: A secure implementation of a symmetric encryption algorithm in white-box attack contexts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789910)