Pages that link to "Item:Q2835600"

The following pages link to Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600):

Displaying 34 items.

• Trapdoor DDH groups from pairings and isogenies (Q832364) (← links)
• Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
• An efficient attribute-based access control system with break-glass capability for cloud-assisted industrial control system (Q1984098) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
• Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
• New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
• LOVE a pairing (Q2146100) (← links)
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
• Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption (Q2229277) (← links)
• Fast, compact, and expressive attribute-based encryption (Q2234469) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• TNFS resistant families of pairing-friendly elliptic curves (Q2333827) (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
• An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Compact structure-preserving signatures with almost tight security (Q6134421) (← links)
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)