#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2010

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Journals and Conferences

Learn More

- Andrzej Chmielowiec
- Theor. Comput. Sci.
- 2010

This paper aims to develop and analyze an effective parallel algorithm for multiplying polynomials and power series with integer coefficients. Such operations are of fundamental importance when generating parameters for public key cryptosystems, whereas their effective implementation translates directly into the speed of such algorithms in practical… (More)

This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra. It can be used to prove primality of numbers with thousands of bits in a reasonable amount of time. The running time of this algorithm for number N is O((lnN)C ln ln lnN) for some constant… (More)

- ‹
- 1
- ›