_.a conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite fieM, GF(qg ). A pipeline structure is used to implement this prime factor DFT over GF(qn). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode ReedSolomon codes. Such a pipeline fast prime factor DFT algorithm over G...

vaccines against the hiv-1 virus offers the best hope for eliminating hiv-associated mortality. recombinant adenovector type 5 (rad5) vaccine is a potential candidate for preventive vaccine strategies. in this study, we evaluated the rad5 prime/protein boost strategy in a murine model. we used rad5 harboring single hiv-1 genes. these genes, including gag (p24) and exon1 of tat, were amplified f...

‎let $r$ be a domain with quotiont field $k$‎, ‎and‎ ‎let $n$ be a submodule of an $r$-module $m$‎. ‎we say that $n$ is‎ ‎powerful (strongly primary) if $x,yin k$ and‎ ‎$xymsubseteq n$‎, ‎then $xin r$ or $yin r$ ($xmsubseteq n$‎ ‎or $y^nmsubseteq n$ for some $ngeq1$)‎. ‎we show that a submodule‎ ‎with either of these properties is comparable to every prime‎ ‎submodule of $m$‎, ‎also we show tha...

let $n$ be a submodule of a module $m$ and a minimal primary decomposition of $n$ is known‎. ‎a formula to compute baer's lower nilradical of $n$ is given‎. ‎the relations between classical prime submodules and their nilradicals are investigated‎. ‎some situations in which semiprime submodules can be written as finite intersection of classical prime submodule are stated‎.

The purpose of this paper is to justify the claim that a method for generating primes presented at EUROCRYPT'89 generates primes with virtually uniform distribution. Using convincing heuristic arguments, the conditional probability distributions of the size of the largest prime factor p 1 (n) of a number n on the order of N is derived, given that n satisses one of the conditions 2n+1 is prime, ...

Let Fq be a finite field of odd order q. In this paper, the irreducible factorization of x2 pr − 1 over Fq is given in a very explicit form, where a, b, c are positive integers and p, r are odd prime divisors of q−1. It is shown that all the irreducible factors of x2 pr − 1 over Fq are either binomials or trinomials. In general, denote by vp(m) the degree of prime p in the standard decompositio...