73 search results - page 2 / 15 » On the Automatizability of Polynomial Calculus |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
EJC
2011
12 years 8 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
DM
2008
13 years 3 months ago
2008
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying pS(x + y) = TU=S pT (x)pU (y). Using umbral calculus, we give a formula for t...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
MST
2011
13 years 5 days ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...