Cryptography
in [Science]
|
Regarding pseudo-random functions for Pollard's Rho factoringmethod Martin Lauridsen wrote: On p. 385 of The art of Computer programming vol. 2 by Knuth, he states that the function f(x) = ax + c is not random enough for the purpose of Pollard's Rho method, referring back to Chapter 3. I can't seem to find where he states that in Chapter 3. Can anyone help me out here... 18 Jun 2010 03:43
Call for Papers: International Conference on Chemical Engineering ICCE 2010 On Thu, 17 Jun 2010 18:40:44 -0700 (PDT), Proteus IIV <proteusiiv(a)gmail.com> wrote: On Jun 17, 9:15�pm, den <d...(a)densnet.com> wrote: On Jun 17, 12:25�am, Proteus IIV <proteus...(a)gmail.com> wrote: ARE YOU ON DRUGS ? THIS IS AN ELECRICAL ENGINEERING GROUP WHY DO YOU WANT US TO DIVERT TO CH... 21 Jun 2010 19:10
Problem related to a generalized birthday paradox Hello, I am invoking your help on a problem I cannot solve. Consider 16 sets of 2^{23} 32-bit random integers. We denote these sets S_{i,j} such that S is a 4x4 matrix, whose cells are the sets. Thus, for 0<i,j<3, the set S_{i,j} contains 2^{23} 32-bit random elements. A 32-bit integer is viewed as a couple of ... 18 Jun 2010 04:48
Regarding pseudo-random functions for Pollard's Rho factoring method Bryan <bryanjugglercryptographer(a)yahoo.com> writes: I first read about Pollard's rho method in Knuth, and was baffled. I much prefer the presentation in Cormen, Leiserson, Rivest (and Stein), /Introduction to Algorithms/. There are also some fine explanations you can Google up for free. The explanation i... 22 Jun 2010 10:28
Regarding pseudo-random functions for Pollard's Rho factoring method On p. 385 of The art of Computer programming vol. 2 by Knuth, he states that the function f(x) = ax + c is not random enough for the purpose of Pollard's Rho method, referring back to Chapter 3. I can't seem to find where he states that in Chapter 3. Can anyone help me out here? Why is f(x) = ax + c not random en... 22 Jun 2010 02:51
Semiautomatic Hybrid Block_Stream Cipher This is sort of an open faced composite of a base translation cipher combined with a stream cipher whereas Pt is base 97 and Ct is base 31. The full cycle is Pt, 97->31, Encrypt 31, Ct, Decrypt 31, 31->97, Pt. http://groups.google.com/group/cryptojavascript/web/06162010rosebud-pome-via-b-64 This also represen... 20 Jun 2010 01:24
Call for Papers: International Conference on Chemical Engineering ICCE 2010 CFP: International Conference on Chemical Engineering ICCE 2010 Draft Paper Submission Deadline: 2 July, 2010 Camera-Ready Papers Due & Registration Deadline: 30 July, 2010 ICCE 2010: San Francisco, USA, 20-22 October, 2010 http://www.iaeng.org/WCECS2010/ICCE2010.html The conference ICCE'10 is held under the Wor... 21 Jun 2010 22:30
Shamir Secret Sharing Implementation Query Hi, Say my secret is an n-bit number, under Shamir's scheme I need a prime, the first prime larger than the secret, then I work in GF(p). (Think that's correct) Now in terms of a practical implementation, lets say im secret sharing arbitrarily long data in 64-bit blocks. I have to assume my secret could be al... 19 Jun 2010 09:05
Sexual Contact Privacy The thread I started June 20, 1999 here in sci.crypt is available at: http://groups.google.com/group/sci.crypt/browse_thread/thread/7f87e056cef19481/add64476e5345deb?hl=en&ie=UTF-8&q=sci.crypt+dgoncz+sexual# Highlights are: From David A Molnar: -----Doug Goncz <dgo...(a)aol.com> wrote: It is for the good o... 21 Jun 2010 05:52
Best practice for password hashing (proposal) Paul Rubin <no.email(a)nospam.invalid> writes: I have an idea for an improvement, that I"ll try to work out and write up later. OK, how does this sound: You have n accounts, numbered 1...n. You want to be able to verify logins, to let the user change their own password, and to lock the account if there are... 16 Jun 2010 16:36 |