I seem to recall hearing of a signature scheme wherein the message is
recovered from the signature. Does this ring a bell for anyone? Any
pointers?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
Is it possible to choose a seed, multiplier, and modulus for a linear
congruential generator such that it duplicates any finite list of
positive integers?
[No, but I'll let others expand or do it in another message. --Perry]
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
Arnold G. Reinhold wrote:
You can see that Perry is right by a simple counting argument. Say the word
size is m bits. There are 2**(3*m) cvombinations of seed, multiplier, and
modulus and there are (2**m)! possible arangements of the values. The
latter is much bigger for m 2.
Arnold
I wrote:
just enough room to store a password 16 unicode characters long, the maximum length
password you're allowed
It's actually 15 characters, so any prime between 2^240 and 2^256 will
work.
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
The encryption in MS Word / Excel uses 32 *bytes* of salt. It's
interesting to me that this is just enough room to store a password 16
unicode characters long, the maximum length password you're allowed.
Just choose the first prime smaller than 2^256, one of say, 1024
multipliers, and modular
I have a set of unit vectors, but don't know their coordinates, or even
the dimension of the space they span. I'm given the angle between each
pair of vectors in units of some unknown "unit angle". I'd like to find
the smallest dimension into which the set fits, as well as the range of
values
What does decorellation do?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
The ecc discrete log problem is given points A and B, find integer x
such that xA=B if it exists. I assume that most crypto implementations
of ecc use finite fields; in a finite field can you assume that x
exists?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:[EMAIL PROTECTED]
How many ways can one form an abelian group with N symbols? Note that
I'm not asking how many groups there are of order N, since isomorphisms
count separately, and it's not just the number of abelian groups times
the number of permutations of the symbols, since the identity element
isn't
Our company works with the FBI a lot. We provide the software they
actually use to recover passwords.
The majority of software out there uses access-denial: the encryption /
ofuscation doesn't depend on the password. But to be acceptable in
court, you have to prove that you didn't change a
I seem to recall someone saying that if you can get one bit of an RSA
message, you can get the whole thing. Or maybe it was the key. Does
anyone know where I might be able to find out more about this?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
I know they got one guy here in the States for sending a death threat
across state boundaries (went over the internet out of state, then back
in again).
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
I wrote the author of the challenge. He responded (quoted with
permission)
quote
If you had received my previous email, with accompnaying URL (below),
you would know how I encrypted this message and have my source code.
Will you provide source to the encryption code?
Yes. See:
On the Los Alamos Preprint site (xxx.lanl.gov) today:
quant-ph/9910072 [abs, src, ps, other] :
Title: Quantum secure identification using entanglement and catalysis
Authors: Howard N. Barnum
Comments: 7 pages; no figures
I consider the use of entanglement between two parties to enable one to
Before OSR2, Windows PWL (cached password database) files reused the
same RC4 stream for known plaintext and the cached passwords. Someone
exploited this and published code. Apparently, MS has fixed the
problem. PWL files under '95/OSR2 and '98 are protected with a single
RC4 stream whose
Also check out RedCreek Ravlin.
"Michael Enk" [EMAIL PROTECTED] on 11/03/99 05:11:25 AM
To: [EMAIL PROTECTED], [EMAIL PROTECTED]
cc:(bcc: Christopher St Clair/OH/BANCONE)
Subject: HOWTO: Encryption on local LAN
Hi all,
I have run into a bit of a problem. I am looking for a
Are there any kinds of primes I should avoid when picking a modulus for
an ElGamal system?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
On average, you'll find one N-bit collision after looking at O(2^(N/2))
random N-bit strings; how long does it take, on average, to find k
collisions? O(k*2^(N/2))?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
I wrote:
O(k*2^(N/2))?
It has to be faster than that by a counting argument. How much faster?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
I've got something with around 100 bytes of ram and an 8-bit multiply.
Is there an authentication mechanism that can fit in this?
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
mailto:[EMAIL PROTECTED]
You can get away with as few as seven bytes of plaintext and 2^40 work
if you have other files in the archive. Five of the thirteen bytes are
only used for filtering, so if you have other files you can use the
password check bytes instead of known plaintext bytes. Also, in
kocher's attack, you
Today on http://xxx.lanl.gov/list/quant-ph/new
quant-ph/0006109 [abs, src, ps, other] :
Title: Unconditionally Secure Quantum Bit Commitment Is Possible
Authors: Horace P. Yuen
Comments: 12 pages
Bit commitment involves the submission of evidence from one party
to another
It would be true if they used a fixed set of huffman codes for which
lower case letters had shorter codes; this is reasonable if you're
compressing large amounts of text, since most of it is lowercase.
--
Mike Stay
Programmer / Crypto guy
AccessData Corp.
[EMAIL PROTECTED]
23 matches
Mail list logo
