Prev: Protecting 3x16 bits with 16 bits ? (Which error correcting code for mode 3?)
Next: why doesn't the decryption primitive in PKCS#1 employ RSA blinding?
From: Richard Outerbridge on 12 Feb 2010 20:35
In article <hl4pti$tei$1(a)ihnp4.ucsd.edu>, ggr(a)nope.ucsd.edu (Greg Rose)
wrote:

> Not that I know of.

Presumably none of this affects for the worse the common trick of
pre-rotating the combined pre-computed and sometimes pre-shifted DES
P&S boxes in order to avoid an inner-loop one-bit rotate?

Richard
From: J.D. on 12 Feb 2010 20:37
>You can express the rotation as a multivariate
>polynomial, but it won't be of particularly low
>degree.

Are you sure about that? They kind of look like multivariate
polynomials of degree one to me. Or am I missing something?
From: J.D. on 12 Feb 2010 21:37

> Are you sure about that?  They kind of look like multivariate
> polynomials of degree one to me.    Or am I missing something?

Nevermind. I got turned around. They would be relatively high degree.
From: Greg Rose on 12 Feb 2010 22:25
In article <a77bc602-fcd3-41ba-84ba-bd739114ff75(a)h17g2000vbd.googlegroups.com>,
J.D. <degolyer181(a)yahoo.com> wrote:
>>You can express the rotation as a multivariate
>>polynomial, but it won't be of particularly low
>>degree.
>
>Are you sure about that? They kind of look like multivariate
>polynomials of degree one to me. Or am I missing something?

Since, in binary, x^2 = x, when people say degree,
they mean "number of variables". So in my example
there were terms of degree 3.

Greg.

--
Greg Rose
232B EC8F 44C6 C853 D68F E107 E6BF CD2F 1081 A37C
From: J.D. on 12 Feb 2010 22:55
On Feb 12, 10:25 pm, g...(a)nope.ucsd.edu (Greg Rose) wrote:
> In article <a77bc602-fcd3-41ba-84ba-bd739114f...(a)h17g2000vbd.googlegroups..com>,
>
> J.D. <degolyer...(a)yahoo.com> wrote:
> >>You can express the rotation as a multivariate
> >>polynomial, but it won't be of particularly low
> >>degree.
>
> >Are you sure about that?  They kind of look like multivariate
> >polynomials of degree one to me.    Or am I missing something?
>
> Since, in binary, x^2 = x, when people say degree,
> they mean "number of variables". So in my example
> there were terms of degree 3.
>
> Greg.
>
> --
> Greg Rose
> 232B EC8F 44C6 C853 D68F  E107 E6BF CD2F 1081 A37C

Yeah, no worries. This is all still relatively new to me, and for
each new thing I learn I seem to forget three others, and have to
relearn them again once I realize that I've screwed up somewhere...
First  |  Prev  |  Next  |  Last
Pages: 1 2 3 4 5
Prev: Protecting 3x16 bits with 16 bits ? (Which error correcting code for mode 3?)
Next: why doesn't the decryption primitive in PKCS#1 employ RSA blinding?