Berkeley CSUA MOTD:Entry 18446
Berkeley CSUA MOTD
 
WIKI | FAQ | Tech FAQ
http://csua.com/feed/
2025/05/25 [General] UID:1000 Activity:popular
5/25    

2000/6/12-14 [Computer/SW/Security] UID:18446 Activity:moderate
6/11    Anybody know if encryption routines (DES, IPsec related, etc) can
        be parallelized?  Does adding more CPUs and writing some parallel
        software speed things up?
        \_ Look at the source code.  Much of the time, what can be
           parallelized is done at a fine grain level (vector data,
           level, loop level, instruction level, etc...) in which
           case, adding CPU's won't do you any good.  If it's thread
           level paralellism, then yes.  Go to http://mit.edu's web site and
           search for Krste Asonovic (he was a PhD student here w/
           Patterson).  His thesis has a good explaination.  Also look
           at the spring 2000 cs252 website.  I think someone did
           a project on encryption algorithms. -jeff
        \_ IPSEC isn't an encryption routine--IPSEC ESP just makes
           provision for tunnel encryption and key exchange for
           whatever crypto you're using.  -John the Nitpicker
        \_ No.
        \_ It depends on the feedback mode used.  If the cyper is running
           in ECB mode, yes, but it's a bad mode of operation otherwise.
           the most common mode, CFB mode, has a dependency between
           blocks and can't be parallelized.  -nweaver
           \_ is that a mathematically proven statement or a "can't _easily_
              be paralellized"?
                \_ Do you understand what you're talking about?  If step B
                   depends on the result of step A before it can be started,
                   IT'S IMPOSSIBLE TO RUN A & B IN PARALLEL.
                   \_ Do YOU understand what YOU are talking about? There's
                      more than one way to split a task into blocks, and
                      parallelism need not apply at global level to be useful.
                      A complete mathematical proof of nweaver's statement
                      would be quite difficult.
                   \_ Not so.  It's been done before in superscalar
                      processors using load value prediction and
                      trivial computation predictions.
                   \_ CFB can not be parallelized beyond the parallelism
                      inherant in the encryption of a single block, because
                      of the dependency.  CFB of block N is computed by
                      encrypting the value of N xor the last block.  -nweaver
                      \_ look, computation prediction is NOT trivial!!
                   \_ CFB encyption can NOT be parallelized beyond the
                      parallelimsm inherant in the encryption of a single
                      block, because of the cyclic dependency.  You need to
                      completely encrypt one block before you can begin
                      encrypting the next block.  CFB DECRYPTION however,
                      can be parallelized between blocks.  -nweaver
2025/05/25 [General] UID:1000 Activity:popular
5/25    

You may also be interested in these entries...
2013/6/6-7/31 [Politics/Foreign/Asia/China, Computer/SW/Security] UID:54690 Activity:nil
6/6     Wow, NSA rocks. Who would have thought they had access to major
        data exchangers? I have much more respect for government workers,
        crypto experts, mathematicans now than ever.
        \_ flea to Hong Kong --> best dim-sum in the world
           \_ "flee"
        \_ The dumb ones work for DMV, the smart ones for the NSA. If you
	...
2010/3/9-30 [Computer/HW/CPU, Computer/SW] UID:53748 Activity:nil
3/9     http://www.engadget.com/2010/03/09/1024-bit-rsa-encryption-cracked-by-carefully-starving-cpu-of-ele
        I failed to see why you must starve the CPU of electricity. Why
        can't you just simulate that in software?
        \_ And if you can simulate that in software, why not just single-
           stepping the simulated CPU and get the key out?
	...
2009/12/29-2010/1/19 [Computer/SW/Security] UID:53607 Activity:nil
12/29   Sounds like the GSM encryption key has been recovered via a
        brute force attack:
        http://www.nytimes.com/2009/12/29/technology/29hack.html
	...
2009/3/19-23 [Computer/HW/Drives] UID:52735 Activity:low
3/19    Pres. Obama's gift of DVDs doesn't even play in England
        http://www.telegraph.co.uk/news/newstopics/mandrake/5011941/Gordon-Brown-is-frustrated-by-Psycho-in-No-10.html
        \_ maybe it's a crypto-protest against region'd DVDs
	...
2009/2/23-26 [Computer/SW/Languages/C_Cplusplus] UID:52622 Activity:low
2/23    Has anyone read Anathem yet? How good (or bad) is it in comparison
        to Cryptonomicon?
        \_ Depends: what did you like/dislike about Cryptonomicon?
           \_ I started to dislike the overlapping WW2 and present day stories
              by the 1/2 half of the book.  And it seemed like a lot of the
              technical details were thrown in to prove how smart Stephenson
	...
2008/8/5-10 [Computer/HW/Laptop] UID:50783 Activity:nil
8/5     Laptop with names of 33K people in the 'Clear' program stolen.  Data
        was (of course) unencrypted.
        http://www.schneier.com/blog/archives/2008/08/laptop_with_tru.html
        \_ http://news.yahoo.com/s/nm/20080805/bs_nm/tjx_theft_charges_dc
           When are people going to learn to encrypt sensitive data?
           \_ When encryption becomes transparent enough that noone has
	...
2008/8/5-10 [Computer/HW/Laptop] UID:50787 Activity:nil
8/5     how is power usage on my laptop if i encrypt everything
        http://www.schneier.com/blog/archives/2008/08/laptop_with_tru.html
        \_ Steve Gibson's analysis on performance was that Trucrypt on a WinXP
           laptop was actually faster, but I don't know about battery.
           laptop was actually faster, but I don't know about battery life.
           \_faster?  How can that be?  Also, I don't see that in the article.
	...
2008/6/25-7/14 [Computer/SW/Security] UID:50380 Activity:nil
6/25    some XCF or CSUA person had a web page about a project they were
        working on where I set up a machine, and you set up a machine
        somewhere, and they both passively back each other, i believe with
        an encryption key so i can't read your backups.  when your disk
        catches on fire, i just give you a copy of your data.  anyone remember
        the name of this?
	...
2008/6/9-12 [Computer/SW/Languages/C_Cplusplus, Computer/SW/Security] UID:50194 Activity:nil
6/8     CSUA code guru please help. I need to see my random number
        generator with a good seed (I just need random 18 bit
        identifiers). The usual time(NULL) is OK, except my program
        might be invoked faster than once a second, and seeding using
        time() produced the same result. I tried clock() but it seems
        to return 0. My program needs to be run in Linux/DOS (Watcom
	...
Cache (741 bytes)
mit.edu
skip to search friday, may 14, 2004 About this site massachusetts institute of technology spotlight: creative intelligence an exhibit from MIT's visual arts program news creative collisions spark research at Stata education courses, admissions, OpenCourseWare research labs, centers and programs, libraries offices+services resources, jobs, business, giving to MIT community groups students, faculty, parents, alumni/ae events calendar, athletics, arts, commencement about mit facts, campus map, evolving campus search Google-MIT MIT People search terms Go MIT MIT today's homepage: Andrew Smiles massachusetts institute of technology 77 massachusetts avenue cambridge, ma 02139-4307 tel 617.253.1000 tty 617.258.9344 about this site contact