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...

Full description

Saved in:

Bibliographic Details
Main Authors:	WU, Hongjun, BAO, Feng, DENG, Robert H.
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2003
Subjects:	Information Security
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

id	sg-smu-ink.sis_research-2077
record_format	dspace
spelling	sg-smu-ink.sis_research-20772022-02-18T03:06:21Z An Efficient Known Plaintext Attack on FEA-M WU, Hongjun BAO, Feng DENG, Robert H. 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-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations. 2003-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1078 info:doi/10.1007/978-3-540-39927-8_8 https://ink.library.smu.edu.sg/context/sis_research/article/2077/viewcontent/Wu2003_AnEfficientKnownPlaintextAttack_pv.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Information Security
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Information Security
spellingShingle	Information Security WU, Hongjun BAO, Feng DENG, Robert H. An Efficient Known Plaintext Attack on FEA-M
description	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-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations.
format	text
author	WU, Hongjun BAO, Feng DENG, Robert H.
author_facet	WU, Hongjun BAO, Feng DENG, Robert H.
author_sort	WU, Hongjun
title	An Efficient Known Plaintext Attack on FEA-M
title_short	An Efficient Known Plaintext Attack on FEA-M
title_full	An Efficient Known Plaintext Attack on FEA-M
title_fullStr	An Efficient Known Plaintext Attack on FEA-M
title_full_unstemmed	An Efficient Known Plaintext Attack on FEA-M
title_sort	efficient known plaintext attack on fea-m
publisher	Institutional Knowledge at Singapore Management University
publishDate	2003
url	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
_version_	1770570848390873088

An Efficient Known Plaintext Attack on FEA-M

Similar Items