decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
Fun with numbers | 144 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
Here we go again
Authored by: Anonymous on Tuesday, January 29 2013 @ 02:01 PM EST
Relying on scale to declare something so difficult it is impossible,
thus evading the moral question of whether the act is permissible.
And I think you might have twelve too many zeroes on the bottom line.

[ Reply to This | Parent | # ]

How long do you figure it'd take to crack 923 bit encryption?
Authored by: Anonymous on Tuesday, January 29 2013 @ 03:01 PM EST

Would you figure on 148 days?

I've got to run - but I'll also dig up one of the cryptographic machanisms commonly used with 128 that is now breakable in a few hours.

As the other poster pointed out:

    What does any of that have to do with the moral question presented of an invasion of privacy?

RAS

[ Reply to This | Parent | # ]

128 bit encryption cracked
Authored by: Anonymous on Tuesday, January 29 2013 @ 03:30 PM EST

Obviously this speaks to one method of encryption and does not equally apply to all.

The bottom line point is:

    Just because something would take the life of the universe to brute force doesn't mean it can't be cracked in far less time using math techniques.
Again:
    This has nothing whatsoever to do with Joe deliberately, knowingly accessing information he is not entitled to!

RAS

[ Reply to This | Parent | # ]

Fun with numbers
Authored by: Anonymous on Tuesday, January 29 2013 @ 05:23 PM EST

Let's do the math in a different direction - just for fun.

    Total combination 2128 = 3.4E+38
    Time frame to brute force all: 5 years = 157,788,000 seconds
    Processing per second: 2.15658E+30
Assuming Moore's Law holds true as applied to supercomputers (doubles approx. every two years), how many years would it be before a supercomputer was built that could process that many transactions per second?

Current record holder is Oakridge National Labs with a whopping 17.59 petaflops (1015).

Taking 17.59 petaflops and dropping it into a spreadsheet, doubling it for the next column and so on puts us in processing range in 94 years :)

So there's my estimate based on Moore's Law.

    In 94 years we'll be able to brute force a 128 bit key in a 5 year period.
    In 148 years, we'll be able to brute force the 128 bit key in 1 second.

:)

Hmm... maybe 150 years isn't really so long in the context of society's lifespan as opposed to an individual's lifespan.

RAS

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )