12/19   Why is EULER-PATH not as important as HAMPATH? (seriously, what is the
        main diff between "edges only once" and "nodes only once")
        \_ Euler path is a linear problem- O(V+E).  Hamiltonian circuit is
           NP-Complete, which means that it's at least as hard as
           thousands of other problems.  Produce a polynomial time
           algorithm for Hamilton and you can crack nearly any public-key
	...

9/20    In Netscape for NT, how do I find out whether it's a 56-bit or 128-bit
        version?  Thanks.
        \_ about: doesn't work for you?
           \_ It says" This version supports U.S.  security with RSA Public Key
              Cryptography, MD2, MD5, RC2-CBC, RC4, DES-CBC, DES-EDE3-CBC."
              Does it mean 56-bit or 128-bit?
	...

7/27    In Applied Cryptography he basically comes out and says that IDEA
        is pretty much the cypher to use for max. security, but I keep hearing
        about this thing called AES that is "better". Anyone know where
        I can find a comparision of AES to IDEA in terms of the resitance
        to linear and differential crytanalysis.
        \_ from Schneier's mouth, he has no problem with AES/Rjendael; and
	...

6/18    I have a question about diffie-hellman. After going through the initial
        key exchange and generating the session key k', how do you use this key
        with 3des or blowfish? Do you just trucate the key to the appropriate
        length (doesn't seem right) or is there some other method?  tia.
        \_ Probably feed the key into a one way hash function (i.e. MD5) that
           outputs the appropriate number of bits.
	...

6/19    Here is another question for all you knowledgable crypto people.
        How bad is the ability of a PC to generate random numbers for
        cryptography?  Is this at all a limiting factor in PC based
        encryption?  If someone were to build a little box that made
        random numbers based on a physical process that was provably
        uncorrelated, would that interest people?
	...

5/29    I'm looking for a list of 512bit or larger primes I can use
        for a diffie-hellman implementation I'm working on. Google
        didn't produce many workable matches. Anyone know where I
        might be able to find a list?
        \_ How many do you need?
           \_ A dozen or so should be more than enough. My understanding
	...

1/24    Should I expect to put more work in cs170 or m113?
        \_ 113 was cake.  One of the easier upper div classes I took.  170 had
           piles of work but it wasn't hard.  It only takes time and lithium to
           get through any upper div math class.
           \_ lithium? what is this a reference to?
                \_ Also a great Nirvana song!  Woo hoo!
	...

12/28   Help crack DES again. http:/http://www.distributed.net
        \_ oh boy how exciting.  Get a fucking life.
           \_ If you don't like tech projects, don't read the soda motd.
                \_ Crunching random numbers over and over again is not
                   a tech project.  -tom
                   \_ You tell 'em Tom!  Crush their will, destroy their ego!
	...

12/3    The Wassenaar agreement has been signed; approximately speaking, it
        is a treaty which will require other countries to impose US-style
        export controls on cryptography.  http://www.wassenaar.org
        \_ Damn Republicans.  They had to start this whole anti-
           cryptography crap.  I can't believe Clinton actually
           supports them too.
	...