It is usual to emphasize the analogy between the integers and polynomials with coe$cients in a "nite "eld, comparing di!erent notions in the two points of view. We introduce a particular rank one Drinfeld module to get an exponentiation for polynomials and then de"ne the notions of Euler pseudoprime
Generalized Strong Pseudoprime Tests and Applications
β Scribed by Pedro Berrizbeitia; T.G. Berry
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 270 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
We describe probabilistic primality tests applicable to integers whose prime factors are all congruent to 1 mod r where r is a positive integer; r = 2 is the Miller-Rabin test. We show that if Ξ½ rounds of our test do not find n = (r + 1) 2 composite, then n is prime with probability of error less than (2r) -Ξ½ . Applications are given, first to provide a probabilistic primality test applicable to all integers, and second, to give a test for values of cyclotomic polynomials.
π SIMILAR VOLUMES
We describe a test, based on the correlation integral, for the independence of a variable and a vector that can be used with serially dependent data. Monte Carlo simulations suggest that the test has good power to detect dependence in several models, performing nearly as well or better than the BDS
## Abstract In the paper we generalize the theory of classical approximation spaces to a much wider class of spaces which are defined with the help of best approximation errors. We also give some applications. For example, we show that generalized approximation spaces can be used to find natural (i
In this paper we first introduce a new generalized cyclotomy of order 2 with respect to pC 2pCR R , then we calculate the new cyclotomic numbers of order 2. Some applications of the new cyclotomy in sequences, cryptography, and coding theory are also discussed. In the last section of this paper, we