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: | , , |
---|---|
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 |