The SCEAS System
| |||||||

## Search the dblp DataBase
Andreas Enge:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Andreas Enge, François Morain
**Fast Decomposition of Polynomials with Known Galois Group.**[Citation Graph (0, 0)][DBLP] AAECC, 2003, pp:254-264 [Conf] - Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
**Implementing the Arithmetic of C**[Citation Graph (0, 0)][DBLP]_{3, 4}Curves. ANTS, 2004, pp:87-101 [Conf] - Andreas Enge, François Morain
**Comparing Invariants for Class Fields of Imaginary Quadratic Fields.**[Citation Graph (0, 0)][DBLP] ANTS, 2002, pp:252-266 [Conf] - Régis Dupont, Andreas Enge
**Provably secure non-interactive key distribution based on pairings.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:2, pp:270-276 [Journal] - Andreas Enge
**The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2001, v:23, n:1, pp:53-74 [Journal] - Régis Dupont, Andreas Enge, François Morain
**Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2005, v:18, n:2, pp:79-89 [Journal] - Andreas Enge
**Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time.**[Citation Graph (0, 0)][DBLP] Math. Comput., 2002, v:71, n:238, pp:729-742 [Journal] - Andreas Enge, Andreas Stein
**Smooth ideals in hyperelliptic function fields.**[Citation Graph (0, 0)][DBLP] Math. Comput., 2002, v:71, n:239, pp:1219-1230 [Journal] - Andreas Enge, Pierrick Gaudry
**An**[Citation Graph (0, 0)][DBLP]*L*(1/3 +*epsilon*) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT, 2007, pp:379-393 [Conf] - Andreas Enge, Pierrick Gaudry
**An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Andreas Enge
**Computing modular polynomials in quasi-linear time**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Andreas Enge
**The complexity of class polynomial computation via floating point approximations**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Computing Hilbert Class Polynomials.**[Citation Graph (, )][DBLP]**Class Invariants by the CRT Method.**[Citation Graph (, )][DBLP]**Discrete logarithms in curves over finite fields**[Citation Graph (, )][DBLP]**An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |