At 11:05 PM -0500 12/2/05, [EMAIL PROTECTED] wrote:
You know, I'd wonder how many people on this
list use or have used online banking.
To start the ball rolling, I have not and won't.
I have, and it's nice for making Quicken data entry faster, but
that's about all. The rest gives me the wil
> ...how many people on this list use or have used online banking?
> To start the ball rolling, I have not and won't.
Dan, that makes two of us.
John
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cr
On 2005-12-02, [EMAIL PROTECTED] wrote:
> You know, I'd wonder how many people on this
> list use or have used online banking.
>
> To start the ball rolling, I have not and won't.
I've been using it for me and my wife with 3 banks since they
first offered it; I use it every week to pay all our
On Fri, Dec 02, 2005 at 10:13:21PM -0200, [EMAIL PROTECTED] wrote:
>
> Well, you just can't prove a PRNG is secure. It would be like proving that
> the AES
> is secure, or that factoring integers is hard. It just can't be done (aside
> theoretical
> discutions about P=NP).
>
Actually, this
Joseph Ashwood wrote:
> byte [] rawBytes = new byte[lenNum/8];
> rand.nextBytes(rawBytes);
> curNum = new BigInteger(rawBytes);
I haven't thought through why it would produce non-primes, but it
doesn't seem to do what you want. That produces a 512 bit
twos-complement number, which gives you
You know, I'd wonder how many people on this
list use or have used online banking.
To start the ball rolling, I have not and won't.
--dan
Cryptography is nothing more than a mathematical framework for
discussing the implications of various paranoid delusions.
-- Don Alvarez
---
Well, you just can't prove a PRNG is secure. It would be like proving that the
AES
is secure, or that factoring integers is hard. It just can't be done (aside
theoretical
discutions about P=NP).
What you can do, at most, is show that it has the same strength than a known
difficult problem.
http://www.nsa.gov/vietnam/
These are the documents related to the claim that NSA suppressed many
of the intercepts relating to the so-called Gulf of Tonkin incident.
--Steven M. Bellovin, http://www.cs.columbia.edu/~smb
| Hi,
| Apologies if this has been asked before.
|
| The company I work for has been asked to prove the randomness of a random
| number generator. I assume they mean an PRNG, but knowing my employer it
| could be anything.. I've turned the work down on the basis of having
another
| gig that week.
Will Morton wrote:
> Eric Rescorla wrote:
>>
>> May I ask why you don't just use TLS?
>>
>
> I would if I could, believe me. :o)
>
> The negotiated key will be used for both reliable (TCP-like) and
> non-reliable (UDP-like) connections, all tunnelled over a single UDP
> port for NAT-busting purpo
Will Morton wrote:
I am designing a transport-layer encryption protocol, and obviously wish
to use as much existing knowledge as possible, in particular TLS, which
AFAICT seems to be the state of the art.
In TLS/SSL, the client and the server negotiate a 'master secret' value
which is passed thr
On Fri, 2 Dec 2005, Lee Parkes wrote:
> Hi,
> Apologies if this has been asked before.
> So, the question is, how can the randomness of a PRNG be proved within
> reasonable limits of time, processing availability and skill?
"Randomness" is a quality that, intrinsically, cannot be proven. Per
On Fri, Dec 02, 2005 at 11:54:03AM +0100, Lee Parkes wrote:
> Hi,
> Apologies if this has been asked before.
>
> The company I work for has been asked to prove the randomness of a random
> number generator. I assume they mean an PRNG, but knowing my employer it
> could be anything.. I've turned t
On Fri, 2005-12-02 at 11:54 +0100, Lee Parkes wrote:
> So, the question is, how can the randomness of a PRNG be proved within
> reasonable limits of time, processing availability and skill?
Cryptographic randomness? None.
Any one who considers arithmetical methods of producing random digits
is,
14 matches
Mail list logo