Welcome to DU!
The truly grassroots left-of-center political community where regular people, not algorithms, drive the discussions and set the standards.
Join the community:
Create a free account
Support DU (and get rid of ads!):
Become a Star Member
Latest Breaking News
Editorials & Other Articles
General Discussion
The DU Lounge
All Forums
Issue Forums
Culture Forums
Alliance Forums
Region Forums
Support Forums
Help & Search
General Discussion
In reply to the discussion: Anonymous group allegedly hacked Romney tax records via Franklin firm [View all]snooper2
(30,151 posts)134. You should really read this-
http://www.eetimes.com/design/embedded-internet-design/4372428/How-secure-is-AES-against-brute-force-attacks-
How secure is AES against brute force attacks?
Mohit Arora, Sr. Systems Engineer & Security Architect, Freescale Semiconductor
5/7/2012 1:29 PM EDT
In the world of embedded and computer security, one of the often debated topics is whether 128-bit symmetric key, used for AES (Advanced Encryption Standard) is computationally secure against brute-force attack. Governments and businesses place a great deal of faith in the belief that AES is so secure that its security key can never be broken, despite some of the inherent flaws in AES.
This article describes the strength of the cryptographic system against brute force attacks with different key sizes and the time it takes to successfully mount a brute force attack factoring future advancements in processing speeds.
Any cryptographic algorithm requires multi-bit key to encrypt the data as shown in Figure 1.


As shown, it will take a maximum 16 rounds to check every possible key combination starting with "0000." Given sufficient time, a brute force attack is capable of cracking any known algorithm.
The following table just shows the possible number of key combinations with respect to key size:

Figure 4: Time to crack Cryptographic Key versus Key size
Faster supercomputer (as per Wikipedia): 10.51 Pentaflops = 10.51 x 1015 Flops [Flops = Floating point operations per second]
No. of Flops required per combination check: 1000 (very optimistic but just assume for now)
No. of combination checks per second = (10.51 x 1015) / 1000 = 10.51 x 1012
No. of seconds in one Year = 365 x 24 x 60 x 60 = 31536000
No. of Years to crack AES with 128-bit Key = (3.4 x 1038) / [(10.51 x 1012) x 31536000]
= (0.323 x 1026)/31536000
= 1.02 x 1018
= 1 billion billion years

As shown above, even with a supercomputer, it would take 1 billion billion years to crack the 128-bit AES key using brute force attack. This is more than the age of the universe (13.75 billion years). If one were to assume that a computing system existed that could recover a DES key in a second, it would still take that same machine approximately 149 trillion years to crack a 128-bit AES key.
How secure is AES against brute force attacks?
Mohit Arora, Sr. Systems Engineer & Security Architect, Freescale Semiconductor
5/7/2012 1:29 PM EDT
In the world of embedded and computer security, one of the often debated topics is whether 128-bit symmetric key, used for AES (Advanced Encryption Standard) is computationally secure against brute-force attack. Governments and businesses place a great deal of faith in the belief that AES is so secure that its security key can never be broken, despite some of the inherent flaws in AES.
This article describes the strength of the cryptographic system against brute force attacks with different key sizes and the time it takes to successfully mount a brute force attack factoring future advancements in processing speeds.
Any cryptographic algorithm requires multi-bit key to encrypt the data as shown in Figure 1.


As shown, it will take a maximum 16 rounds to check every possible key combination starting with "0000." Given sufficient time, a brute force attack is capable of cracking any known algorithm.
The following table just shows the possible number of key combinations with respect to key size:

Figure 4: Time to crack Cryptographic Key versus Key size
Faster supercomputer (as per Wikipedia): 10.51 Pentaflops = 10.51 x 1015 Flops [Flops = Floating point operations per second]
No. of Flops required per combination check: 1000 (very optimistic but just assume for now)
No. of combination checks per second = (10.51 x 1015) / 1000 = 10.51 x 1012
No. of seconds in one Year = 365 x 24 x 60 x 60 = 31536000
No. of Years to crack AES with 128-bit Key = (3.4 x 1038) / [(10.51 x 1012) x 31536000]
= (0.323 x 1026)/31536000
= 1.02 x 1018
= 1 billion billion years

As shown above, even with a supercomputer, it would take 1 billion billion years to crack the 128-bit AES key using brute force attack. This is more than the age of the universe (13.75 billion years). If one were to assume that a computing system existed that could recover a DES key in a second, it would still take that same machine approximately 149 trillion years to crack a 128-bit AES key.
Edit history
Please sign in to view edit histories.
Recommendations
0 members have recommended this reply (displayed in chronological order):
149 replies
= new reply since forum marked as read
Highlight:
NoneDon't highlight anything
5 newestHighlight 5 most recent replies
RecommendedHighlight replies with 5 or more recommendations
Copies were sent to the DNC...so what's the reason for the million dollar blackmail?
cynatnite
Sep 2012
#11
Are you operating under the illusion that the NSA announces such things publicly?
jeff47
Sep 2012
#127
Of course they wouldn't announce it, but they're still limited to the rules of math.
EOTE
Sep 2012
#131
It doesn't matter how intelligent an algorithm is if it requires billions or trillions of computer
EOTE
Sep 2012
#77
Yes, I have no idea what you're talking about because you're talking out of your ass.
EOTE
Sep 2012
#145
But surely 22 years of experience gives one the power to change the known laws of the universe.
EOTE
Sep 2012
#137
Where does it say this was Anonymous? They do not ask for ransom ever. Anyone
sabrina 1
Sep 2012
#59
yes...that is why candidates show their taxes...so they can't be blackmailed
DonRedwood
Sep 2012
#102
Nashville City Paper seems to have information that isn't in that pastebin document.
drm604
Sep 2012
#25
Would love to know if any police/security reports were made of a possible break-in?
nc4bo
Sep 2012
#19
That some people actually believe this nonsense could be true shows how gullible people are.
former9thward
Sep 2012
#34
If it were true, the hackers would have released a non-damaging part of the return.
berni_mccoy
Sep 2012
#42
It wouldn't be the first time Rove set up a dirty trick to try to make it look as if the other side
Skidmore
Sep 2012
#55
Proves that as long as Romney has secrets to hide (his tax forms), then he's blackmail-able.
Lex
Sep 2012
#52
I think it's a Rove or Koch ploy to grab the front pages from the DEM convention
woodsprite
Sep 2012
#54
Wow...this is really cool. Hope it's true. I have often thought how easy it might be for someone
Laura PourMeADrink
Sep 2012
#67
You do realize, don't you, that both the seller and the newspaper would be committing a felony.
former9thward
Sep 2012
#83
I'd be applauding the hackers if they weren't trying to profit from this.
Comrade_McKenzie
Sep 2012
#135
They should just release one page at a time until the Romney campaign agrees to release them.
cbdo2007
Sep 2012
#142
I've written more credible fiction with more details and suspense. Sorry, ain't buying it.
freshwest
Sep 2012
#147