[DGD] ASN, how to use them?

[Petter Nyström]

On Fri, Oct 8, 2010 at 2:54 PM, Felix A. Croes <felix at dworkin.nl> wrote:
> Whenever you are working with integers in LPC, you are working with an
> implied modulus of 2 ** 32.  Often, one wants to use ASN to implement
> numbers that are not of arbitrary size, but merely larger than ordinary
> integers; for example, 64 bit or 128 bit numbers.

Aha, thanks for explaining, Dworkin.

So the size of an ASN is only as abritrary as I allow it to be? How
does computation cost connect with the size of the chosen modulus?
I.e. is it a bad idea to use a crazy large modulus for situations
where you just want an ASN that can be, well, arbitrarily large?

Thanks,
Jimorie