diff --git a/security/steghide/Makefile b/security/steghide/Makefile
index de3adb371ddc..6122fa0a4597 100644
--- a/security/steghide/Makefile
+++ b/security/steghide/Makefile
@@ -7,7 +7,7 @@
 
 PORTNAME=	steghide
 PORTVERSION=	0.5.1
-PORTREVISION=	3
+PORTREVISION=	4
 CATEGORIES=	security
 MASTER_SITES=	SF
 DISTNAME=	${PORTNAME}-${PORTVERSION:S/.b/b/}
diff --git a/security/steghide/distinfo b/security/steghide/distinfo
index 88be8b46eec2..124af4d435fc 100644
--- a/security/steghide/distinfo
+++ b/security/steghide/distinfo
@@ -1,3 +1,2 @@
-MD5 (steghide-0.5.1.tar.gz) = 5be490e24807d921045780fd8cc446b3
 SHA256 (steghide-0.5.1.tar.gz) = 78069b7cfe9d1f5348ae43f918f06f91d783c2b3ff25af021e6a312cf541b47b
 SIZE (steghide-0.5.1.tar.gz) = 476125
diff --git a/security/steghide/files/patch-src-BmpFile.cc b/security/steghide/files/patch-src-BmpFile.cc
new file mode 100644
index 000000000000..ec71f97a5bda
--- /dev/null
+++ b/security/steghide/files/patch-src-BmpFile.cc
@@ -0,0 +1,15 @@
+--- src/BmpFile.cc.orig	2011-06-21 15:28:36.000000000 +0200
++++ src/BmpFile.cc	2011-06-21 15:28:40.000000000 +0200
+@@ -214,10 +214,10 @@
+ 		// create reservoir - for every i reservoir[i] contains the sample values that are neighbourss of
+ 		// the sample value with label i and have a lower label (and have already been found)
+ 		// This is necessary to use collapsing trees together with bucket sort (without huge increase in memory usage)
+-		std::vector<BmpRGBSampleValue*> reservoir[svs.size()] ;
++		std::vector<std::vector<BmpRGBSampleValue*> > reservoir(svs.size()) ;
+ 
+ 		// neighbours sorted by distance (for the current source sample value)
+-		std::vector<BmpRGBSampleValue*> neighbours_byd[r + 1] ;
++		std::vector<std::vector<BmpRGBSampleValue*> > neighbours_byd(r + 1) ;
+ 
+ 		for (std::vector<SampleValue*>::const_iterator srcsvit = svs.begin() ; srcsvit != svs.end() ; srcsvit++) {
+ 			BmpRGBSampleValue* srcsv = (BmpRGBSampleValue*) (*srcsvit) ;