Sciweavers

371 search results - page 2 / 75
» Computation of the Minimal Associated Primes
Sort
View
PAIRING
2007
Springer
13 years 11 months ago
On the Minimal Embedding Field
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
Laura Hitt
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
13 years 11 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
JC
2006
105views more  JC 2006»
13 years 5 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
13 years 10 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
DAC
2005
ACM
13 years 7 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi