47 search results - page 6 / 10 » Testing Low-Degree Polynomials over Prime Fields |
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
ANTS
2008
Springer
14 years 11 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
102
click to vote
ICISC
2000
14 years 10 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
STOC
1991
ACM
15 years 28 days ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...