Power-Blog.com Password Leak Analysis

Power-Blog.com was hacked and their database released. The leak contains a total of 5860 MD5 hashes. The data contains 3 hashes of passwords normally used by automated SQLi tools, this might indicate that the website was hacked by an SQLi flaw in the website.

A total of 5067 hashes were cracked. That is 86,46%. It took 4 hours and 19 minutes to crack them.

The Results

Length distribution
 
Average password length: 7,5267466

Character distribution
 

Unique character distribution


Contained in common wordlists
 

Contained in IQ wordlist (Click here for more info)


Top 30 most common passwords

Password Frequency
123456 161
apples12 30
000000 14
super123 14
786000 14
sonor98 13
19661102 13
123456789 11
111111 11
112233 9
success 9
qwerty123 7
powerblog 7
marina 7
123456abc 6
58138948 6
654321 6
12345678 5
lovexinh 5
7550708 5
killer9987 4
eudoh065 4
666888 4
82338233 4
tt1314520 4
abc123 4
lddocbz 4
asdfasdf 4
444444 4
Knight 4

Top 30 longest passwords


Password Length
Chidvilasananda 15
nguyentrongtinh 15
unitedstatesofa 15
zaihuishou2008 14
trequan1234567 14
hatamikia2006 13
divertisment 12
198005231234 12
lovelygirl16 12
adnan12ahsan 12
amalgamation 12
123456abcdef 12
fiddlefaddle 12
lasvegas2009 12
ranveersingh 12
blessings888 12
198403160316 12
liverpool296 12
eaglesong777 12
emamzaman12 11
09324115296 11
smartnet456 11
lovelove123 11
greenfields 11
makemoney77 11
vatanperver 11
super77star 11
edumedicina 11
caterpillar 11
13631365772 11

Comments

Post a Comment

Popular posts from this blog

Reducing the size of self-contained .NET Core applications

Just for note keeping, I've written down some methods of reducing the size of a .NET Core application. I thought others could use it as well, so here you go. Original Size First off, let's see how much disk space a self-contained 'hello world' application takes up. > dotnet new console > dotnet publish -r win-x86 -c release Size: 53.9 MB -  yuck! Trimming Microsoft has built a tool that finds unused assemblies and removes them from the distribution package. This is much needed since the 'netcoreapp2.0' profile is basically .NET Framework all over again, and it contains a truckload of assemblies our little 'hello world' application don't use. > dotnet new console > dotnet add package Microsoft.Packaging.Tools.Trimming -v 1.1.0-preview1-25818-01 > dotnet publish -r win-x86 -c release /p:TrimUnusedDependencies=true Size: 15.8 MB Much better! Although, we have only removed unused assemblies - what about unused...
Read more

.NET Compression Libraries Benchmark

Image
I often find myself needing a compression library in a software development project, and after a few tests with disappointing results I usually fall back to spawning 7Zip as an external process. This time however, the application specification prohibits any data written to disk, which 7Zip needs to do in order to work correctly. I needed to do everything in memory, and so I had to test some of the C# libraries available for compression as well as the different compression algorithms. Here is a full list of the tested libraries: .NET DeflateStream ICSharpCode SharpZip Zlib.NET DotNetZip Managed LZMA LZMA SDK QuickLZ    Compression 101 Before I get to the results of the benchmark, I think it is important to understand the different archive formats and compression algorithms in order to compare the results with other benchmarks/and or tests. Lets get to it! A compression algorithm can be compared to a small machine that takes in some data, do some math on it and...
Read more

The Ramer-Douglas-Peucker Polygon Simplification Algorithm

Image
One of the important algorithms in vector graphics and robotics is the Ramer-Douglas-Peucker algorithm. It simplifies a polygon by reducing the number of points by some tolerance. It was invented independently by Urs Ramer in 1972 and by David Douglas & Thomas Peucker in 1973. In 1992 it was improved by John Hershberger & Jack Snoeyink at the cost of the algorithm only working with simple 2D planar polylines, and not in higher dimentions. Here is how it roughly works: 0. Start with a polygon. 1. Make a polyline between the two endpoints. This is the initial approximation to the simplified polygon. 2. Calculate the distance between the edge and the remaining vertices. If the vertex tested is further away that the user defined tolerance, then the vertex is added to the simplification. 3. Repeat step 2 until you have a complete approximation of the polygon like shown in step 4 in the picture.   The idea with the algorithm is that we can give it an input like t...
Read more