Dummy shuffling against algebraic attacks in white-box implementations

DOI10.1007/978-3-030-77886-6_8zbMath1479.94129OpenAlexW3157937103WikidataQ119496630 ScholiaQ119496630MaRDI QIDQ2056730

Aleksei Udovenko, Alex Biryukov

Publication date: 8 December 2021

Full work available at URL: https://eprint.iacr.org/2021/290

zbMATH Keywords

provable securityalgebraic attackobfuscationshufflingwhite-box

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

A modular approach to the incompressibility of block-cipher-based AEADs

Cites Work

• Unnamed Item
• Unnamed Item
• LPN decoded
• Differential computation analysis: hiding your white-box designs is not enough
• Attacks and countermeasures for white-box designs
• Side-channel masking with pseudo-random generator
• A White-Box DES Implementation for DRM Applications
• Protecting AES Software Implementations on 32-Bit Processors Against Power Analysis
• Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
• Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
• Robust Pseudorandom Generators
• Advances in Cryptology - CRYPTO 2003
• Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings
• Selected Areas in Cryptography
• Noise-tolerant learning, the parity problem, and the statistical query model
• Applied Cryptography and Network Security
• Higher-order DCA against standard side-channel countermeasures

This page was built for publication: Dummy shuffling against algebraic attacks in white-box implementations