A Stackelberg model for cryptographic hybridization is introduced in which the defender randomizes over algorithms, the attacker solves a conditional optimization subgame via dynamic programming, and the defender's problem is cast as a linear program.
Twenty years of attacks on the rsa cryptosystem.Notices of the AMS, 46(2):203–213
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Stackelberg Model for Hybridization in Cryptography
A Stackelberg model for cryptographic hybridization is introduced in which the defender randomizes over algorithms, the attacker solves a conditional optimization subgame via dynamic programming, and the defender's problem is cast as a linear program.