The following pages link to Tanja Lange (Q701119):
Displayed 50 items.
- On the number of sparse RSA exponents (Q701120) (← links)
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions (Q1021236) (← links)
- A new Kloosterman sum identity over \(F_{2^m}\) for odd \(m\). (Q1398281) (← links)
- Elliptic curve point counting over finite fields with Gaussian normal basis (Q1418381) (← links)
- Item:Q701119 (redirect page) (← links)
- Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\) (Q1604418) (← links)
- Decompositions of cascaded GMW functions (Q1609678) (← links)
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem (Q1611366) (← links)
- Taking cube roots in \(\mathbb Z_{m}\) (Q1614110) (← links)
- HILA5 pindakaas: on the CCA security of lattice-based encryption with error correction (Q1653237) (← links)
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme (Q1695977) (← links)
- CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Lattice Klepto -- turning post-quantum crypto against itself (Q1746980) (← links)
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto (Q1753876) (← links)
- MOV attack in various subgroups on elliptic curves (Q1766871) (← links)
- The Weil pairing, and its efficient calculation (Q1772231) (← links)
- Formulae for arithmetic on genus 2 hyperelliptic curves (Q1772238) (← links)
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves (Q1772239) (← links)
- Koblitz curve cryptosystems (Q1779327) (← links)
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
- Incomplete character sums and a special class of permutations (Q1826280) (← links)
- Linear complexity of the discrete logarithm (Q1869823) (← links)
- A comparision of the number of rational places of certain function fields to the Hasse-Weil bounds (Q1879276) (← links)
- Efficient arithmetic on Koblitz curves (Q1976040) (← links)
- Verifying post-quantum signatures in 8 kB of RAM (Q2118545) (← links)
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies (Q2292880) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- A complete set of addition laws for incomplete Edwards curves (Q2430986) (← links)
- (Q2712122) (← links)
- (Q2741445) (← links)
- (Q2762749) (← links)
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions (Q2773333) (← links)
- Batch NFS (Q2798603) (← links)
- Dual EC: A Standardized Back Door (Q2803634) (← links)
- Never Trust a Bunny (Q2858118) (← links)
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation (Q2867160) (← links)
- Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild (Q2867164) (← links)
- Computing Small Discrete Logarithms Faster (Q2876940) (← links)
- Faster Batch Forgery Identification (Q2876952) (← links)
- Hyper-and-elliptic-curve cryptography (Q2878835) (← links)
- The Security Impact of a New Cryptographic Library (Q2915120) (← links)
- Kummer Strikes Back: New DH Speed Records (Q2938852) (← links)
- Twisted Hessian Curves (Q2946454) (← links)
- TweetNaCl: A Crypto Library in 100 Tweets (Q2946467) (← links)
- SPHINCS: Practical Stateless Hash-Based Signatures (Q2948336) (← links)
- (Q2949487) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)