# Re: An adhoc stream encryption scheme

*From*: Globemaker <alanfolmsbee@xxxxxxxxxxxx>*Date*: Tue, 3 May 2011 10:23:38 -0700 (PDT)

On May 3, 8:43 am, Mok-Kong Shen <mok-kong.s...@xxxxxxxxxxx> wrote:

Am 03.05.2011 13:50, schrieb Globemaker:

Is there an overflow problem with a 32 bit result from raising the

plaintext to a power of R? If overflow occurs, decryption seems

impossible.

No. All integer computations are mod 2^n (n=32 on most current systems,

the mod operation is thus done automatically).

M. K. Shen

M-K S wrote, "permutation polynomials give bijective mappings".

Is this an axiom?

Is it a tautology?

Are "permutation polynomials" a large sub-set of polynomials?

Which polynomials are not permutation polynomials?

.

**Follow-Ups**:**Re: An adhoc stream encryption scheme***From:*Mok-Kong Shen

**Re: An adhoc stream encryption scheme***From:*Tom St Denis

**References**:**An adhoc stream encryption scheme***From:*Mok-Kong Shen

**Re: An adhoc stream encryption scheme***From:*Globemaker

**Re: An adhoc stream encryption scheme***From:*Mok-Kong Shen

- Prev by Date:
**Re: An adhoc stream encryption scheme** - Next by Date:
**Re: An adhoc stream encryption scheme** - Previous by thread:
**Re: An adhoc stream encryption scheme** - Next by thread:
**Re: An adhoc stream encryption scheme** - Index(es):