guess that stealing information of
someone's "face" is easier than stealing information
about someone's "fingerprints",
but stealing information about someone's "retina"
would be much harder.
Such a scale can be useful in the design of secure
protoc
At 04:02 AM 2/10/2008, Peter Gutmann wrote:
"Perry E. Metzger" <[EMAIL PROTECTED]> writes:
<\snip
So your potential market for this is people running Monte Carlo simulations
who don't like PRNGs. Seems a bit of a limited market...
I think that the market is a little bit bigger than just appli
At 11:08 PM 6/26/2007, John Lowry wrote:
... Also, a small revolution has been taking place while
discussion (on this list anyway) has focused on 1st generation
QKD. Several very high speed (up to
nominal line speed) systems have been proposed. Long-haul all-
optical networks
are being res
6 (not 8??!?!).
Anyway, this suggest one obvious thing: if a PK system
is built over Z_{2^x}[x_1,x_2,...,x_m] then the number
of variables m have to be at least 80 (or 128, or 196,
...) in order to eliminate the Hansel lifting as a
form of attack. But t
Danilo Gligoroski writes:
>[...] solve a system of 3 polynomials of order 3
>with 3 variables x1, x2 and x3 in the set Z_{2^32}
and
>coeficients also in Z_{2^32} [...]
David Wagner wrote:
>Here is a trick that should solve these kinds of
>equations extremely quickly. First, you so
which is different
than just solving polynomials (univariate or
multivariate) modulo 2^32.
I will appreciate any hint or coment.
Regards,
Danilo Gligoroski
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe
