Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^15: SaltedDigest Salt?

by BrowserUk (Patriarch)
on Feb 10, 2012 at 21:09 UTC ( [id://953132]=note: print w/replies, xml ) Need Help??


in reply to Re^14: SaltedDigest Salt?
in thread SaltedDigest Salt?

  1. SHA512 in 1 was 3.5 times slower than DES

    I used the numbers in that pdf to try and relate the headline numbers available for DES to SHA512, because both algorithms had been implemented on the same hardware. I accept my interpretation of that relationship may be wrong.

    Okay. You don't like those numbers, I have different ones. These are all direct throughput measurements of the SHA512 algorithm implemented in FPGAs.

    • This one gives a throughput figure for SHA512 of 1.365Gb/s. (Virtex-4 hardware.
    • This one gives a (derived) throughput value of 2.285Gb/s for SHA512 (Virtex-5 hardware.)
    • This one gives a throughput value of 1.243 Gb/s. (Virtex-E hardware.)

    All 3 or 4 years older than the current generation of Virtex-7 hardware. And all single FPGA implementations.

    Using the highest of those values as an underestimate for this years hardware -- now using 28nm rather than 40nm process -- we get 4.8 Gencryptions/second for each FPGA.

    Now multiply that by 1792 for the RIVYERA hardware.

  2. you're not taking into account number of slices required to implement SHA512 and DES

    This is essentially irrelavent. The fact that SHA512 uses 23% of the slices means that there is 77% of the hardware left to play with to improve the performance. Which many others have subsequently done by using that unused capacity to unroll lumps of the algorithm,moving them off the critical path.

    Unused slices are like unused memory on a PC. Indeed, one of the uses the can be put to is to form on-chip 'memory' to speed things up.

  3. 1 is about hashing data stream, copacobana is about key search. 1 doesn't allow parallel operations, copacobana does.

    "Didn't use", not "doesn't allow".

    One of the possible uses for that 77% of unused capacity, would be to create 4 identical encryptors. Loading up 4 keys at a time onto each FPGA and encrypting them in parallel. Even that very old device with only 100 slices could have pipelined 4 keys at a time.

    The Virtex-7 device has 3,600 slices. It could handle 144 pipelines of the gremboski implementation per FPGA. And run them faster. (Higher clockrate due to process shrink.)

    So, using your math: 616Mb/s / 512 = 1,261,568 keys/s. * 144 (piplines/FPGA) * 1792 (FPGAs/system) * 5 (clock-rate increase) = 1,631,358,812,160 keys/s.

I guess we're done now, but keep watching, because it's coming. Like it or not.

(Indeed, I'm guessing that certain organisations with very deep pockets already have it.)


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

The start of some sanity?

Replies are listed 'Best First'.
Re^16: SaltedDigest Salt?
by zwon (Abbot) on Feb 11, 2012 at 04:14 UTC
    Okay. You don't like those numbers, I have different ones.

    That's just ridiculous. I don't even question the result numbers, but your methods of manipulating data, sure they allow you to get any result you want.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://953132]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2024-04-24 02:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found