手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| リターン指向プログラミング× | 差分暗号解読 (Differential Cryptanalysis)× | |
|---|---|---|
| 分野 | 暗号学 | 暗号学 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 2007 | 1990 |
| 提唱者≠ | Hovav Shacham | Eli Biham |
| 種類≠ | code reuse attack methodology | statistical attack on block ciphers |
| 原典≠ | Shacham, H. (2007). The geometry of innocent flesh on the bone: Return-into-libc without function calls (on the x86). In Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007), pp. 552-561. DOI ↗ | Biham, E., & Shamir, A. (1990). Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - CRYPTO 1990, LNCS 537, pp. 2-21. DOI ↗ |
| 別名 | ROP, code reuse attack, Turing-complete gadget | differential attack, differential path, differential probability |
| 関連 | 3 | 3 |
| 概要≠ | Return-Oriented Programming (ROP) is an exploit technique that chains together short sequences of instructions (gadgets) from existing executable code to perform arbitrary computation, bypassing security defenses like code injection prevention. Introduced by Hovav Shacham in 2007, ROP exploits code reuse to execute malicious logic even when data execution prevention (DEP) and code signing prevent direct code injection. ROP is considered one of the most powerful exploit techniques against modern defense mechanisms and has been demonstrated to be Turing-complete. | Differential cryptanalysis is a statistical attack technique on symmetric block ciphers that analyzes differences in inputs and outputs to recover secret keys. Introduced by Eli Biham and Adi Shamir in 1990, differential cryptanalysis was the first practical attack on DES that outperformed brute force search. The technique exploits non-random properties of cipher transformations by studying how small changes in plaintext propagate through the cipher rounds. Differential cryptanalysis has shaped cipher design for three decades. |
| ScholarGateデータセット ↗ |
|
|