Pages that link to "Item:Q5426200"

The following pages link to Pairing-Friendly Elliptic Curves of Prime Order (Q5426200):

Displaying 50 items.

• Effective compression maps for torus-based cryptography (Q264119) (← links)
• Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
• Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
• Multibase scalar multiplications in cryptographic pairings (Q300879) (← links)
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
• Signal-flow-based analysis of wireless security protocols (Q385716) (← links)
• Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
• Sequential aggregate signatures with lazy verification from trapdoor permutations (Q476200) (← links)
• An efficient ring signature scheme from pairings (Q528720) (← links)
• Efficient selective identity-based encryption without random oracles (Q656924) (← links)
• Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
• A comparison of MNT curves and supersingular curves (Q862563) (← links)
• Implementing optimized pairings with elliptic nets (Q893619) (← links)
• Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
• On bilinear structures on divisor class groups (Q1017359) (← links)
• Pairing-based cryptography on elliptic curves (Q1616164) (← links)
• Provably secure and pairing-based strong designated verifier signature scheme with message recovery (Q1637871) (← links)
• Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
• Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group (Q1640704) (← 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)
• Refinement of the four-dimensional GLV method on elliptic curves (Q1746951) (← links)
• MOV attack in various subgroups on elliptic curves (Q1766871) (← links)
• Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis (Q1787193) (← links)
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Efficient redactable signature and application to anonymous credentials (Q2055711) (← links)
• Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
• New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
• LOVE a pairing (Q2146100) (← links)
• Skipping the \(q\) in group signatures (Q2152050) (← links)
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption (Q2229277) (← links)
• A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
• Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
• TNFS resistant families of pairing-friendly elliptic curves (Q2333827) (← links)
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles (Q2377064) (← links)
• Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
• Compact proofs of retrievability (Q2392096) (← links)
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
• Short signatures without random oracles and the SDH assumption in bilinear groups (Q2425530) (← links)
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
• Faster computation of the Tate pairing (Q2430985) (← links)
• Heuristics of the Cocks-Pinch method (Q2437964) (← links)
• Secure administration of cryptographic role-based access control for large-scale cloud storage systems (Q2509592) (← links)
• Efficient revocable identity-based encryption with short public parameters (Q2658050) (← links)