The following pages link to Andreas Enge (Q194643):
Displaying 28 items.
- Building curves with arbitrary small MOV degree over finite prime fields (Q814847) (← links)
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
- Constructing elliptic curves over finite fields using double eta-quotients (Q2483709) (← links)
- Provably secure non-interactive key distribution based on pairings (Q2489921) (← links)
- (Q2764232) (← links)
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time (Q2781220) (← links)
- A general framework for subexponential discrete logarithm algorithms (Q2781453) (← links)
- Elliptic Curves and Their Applications to Cryptography (Q2803681) (← links)
- Generalised Weber functions (Q2875425) (← links)
- Computing Class Polynomials for Abelian Surfaces (Q2875530) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- (Q3635542) (← links)
- Fast Decomposition of Polynomials with Known Galois Group (Q4426704) (← links)
- (Q4518985) (← links)
- Smooth ideals in hyperelliptic function fields (Q4529714) (← links)
- (Q4550667) (← links)
- (Q4737490) (← links)
- (Q4790459) (← links)
- The arithmetic of Jacobian groups of superelliptic cubics (Q4821055) (← links)
- Class Invariants by the CRT Method (Q4931646) (← links)
- Singular values of multiple eta-quotients for ramified primes (Q5169611) (← links)
- Modular curves of composite level (Q5315167) (← links)
- Computing Hilbert Class Polynomials (Q5387605) (← links)
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves (Q5429402) (← links)
- Algorithmic Number Theory (Q5465646) (← links)
- The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems (Q5939677) (← links)
- Bilinear pairings on elliptic curves (Q5963025) (← links)
