F5-A Steganographic Algorithm

  • Authors:
  • Andreas Westfeld

  • Affiliations:
  • -

  • Venue:
  • IHW '01 Proceedings of the 4th International Workshop on Information Hiding
  • Year:
  • 2001

Quantified Score

Hi-index 0.06

Visualization

Abstract

Many steganographic systems are weak against visual and statistical attacks. Systems without these weaknesses offer only a relatively small capacity for steganographic messages. The newly developed algorithm F5 withstands visual and statistical attacks, yet it still offers a large steganographic capacity. F5 implements matrix encoding to improve the efficiency of embedding. Thus it reduces the number of necessary changes. F5 employs permutative straddling to uniformly spread out the changes over the whole steganogram.