An Efficient Known Plaintext Attack on FEA-M
Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljevi and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 237-bit chosen plaintext and 260-b...
Saved in:
Main Authors: | WU, Hongjun, BAO, Feng, DENG, Robert H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2003
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1078 https://ink.library.smu.edu.sg/context/sis_research/article/2077/viewcontent/Wu2003_AnEfficientKnownPlaintextAttack_pv.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A chameleon encryption scheme resistant to known-plaintext attack
by: Chang, E.-C., et al.
Published: (2013) -
LEAP: Leakage-abuse attack on efficiently deployable, efficiently searchable encryption with partially known dataset
by: NING, Jianting, et al.
Published: (2021) -
Forgery Attack to an Asymptotically Optimal Traitor Tracing Scheme
by: WU, Yongdong, et al.
Published: (2007) -
Cryptanalysis of the m-permutation protection schemes
by: WU, Hongjun, et al.
Published: (2000) -
Securing Return Routability Protocol against Active Attacks
by: ZHU, Huafei, et al.
Published: (2004)