363 search results - page 11 / 73 » Code Generation for Polynomial Multiplication |
SAIG
2000
Springer
13 years 11 months ago
2000
Springer
When writing a program generator requires considerable intellectual effort, it is valuable to amortize that effort by using the generator to build more than one application. When ...
EUROPKI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
CASC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
TIT
2008
13 years 7 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...