45 search results - page 4 / 9 » Cryptography in Quadratic Function Fields |
142
click to vote
ASAP
2004
IEEE
15 years 5 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
DAGSTUHL
2010
15 years 2 months ago
2010
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
SIAMMAX
2010
14 years 8 months ago
2010
It is well-known that the Legendre-Fenchel conjugate of a positive definite quadratic form can be explicitly expressed as another positive definite quadratic form, and that the con...
129
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
122
click to vote
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...