Pages that link to "Item:Q4924410"
From MaRDI portal
The following pages link to Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields (Q4924410):
Displaying 20 items.
- Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) (Q324277) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- A general polynomial sieve. (Q1591638) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
- Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
- A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH (Q2697676) (← links)
- Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups (Q2801775) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Selecting polynomials for the Function Field Sieve (Q5501157) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
