The following pages link to (Q4364556):
Displaying 24 items.
- Security analysis of a password-based authentication protocol proposed to IEEE 1363 (Q818140) (← links)
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS (Q1008987) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Kummer for genus one over prime-order fields (Q2303455) (← links)
- Message transmission for GH-public key cryptosystem (Q2349638) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- One private-key for all DL-based cryptosystems (Q2572050) (← links)
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman (Q2835601) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- On the Security of Supersingular Isogeny Cryptosystems (Q2958115) (← links)
- Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys (Q3073703) (← links)
- Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates (Q3297479) (← links)
- Strongly Secure Certificateless Key Agreement (Q3392914) (← links)
- An algebraic approach to the verification of a class of Diffie-Hellman protocols (Q3435341) (← links)
- Security analysis of discrete logarithm based cryptosystems (Q3443271) (← links)
- Computing discrete logarithms in an interval (Q4912022) (← links)
- High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions (Q4960943) (← links)
- Computing Interval Discrete Logarithm Problem with Restricted Jump Method (Q4988923) (← links)
- (Q5068487) (← links)
- Efficient message transmission via twisted Edwards curves (Q5145769) (← links)
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
