The following pages link to (Q3718617):
Displaying 50 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- A new two-round dynamic authenticated contributory group key agreement protocol using elliptic curve Diffie-Hellman with privacy preserving public key infrastructure (Q301801) (← links)
- A reduction of semigroup DLP to classic DLP (Q306053) (← links)
- Analysis of the fault attack ECDLP over prime field (Q410803) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) (Q429602) (← links)
- First-order side channel attacks on Zhang's countermeasures (Q433061) (← links)
- Efficient precomputation schemes of \(kP+lQ\) (Q436568) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- A novel elliptic curve scalar multiplication algorithm against power analysis (Q474700) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis (Q497571) (← links)
- Provably secure proxy convertible authenticated encryption scheme based on RSA (Q506763) (← links)
- A new method for decomposition in the Jacobian of small genus hyperelliptic curves (Q510414) (← links)
- Permutation polynomials and a new public-key encryption (Q516791) (← links)
- Toric forms of elliptic curves and their arithmetic (Q548601) (← links)
- ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (Q556108) (← links)
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- A chosen message attack on Demytko's elliptic curve cryptosystem (Q676832) (← links)
- A traceable proxy multisignature scheme based on the elliptic curve cryptosystem (Q702590) (← links)
- Encryption of covert information into multiple statistical distributions (Q715984) (← links)
- A new generalization of the KMOV cryptosystem (Q721553) (← links)
- Cryptanalysis of a key exchange scheme based on block matrices (Q726474) (← links)
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- Complete addition formulas on the level four theta model of elliptic curves (Q780585) (← links)
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology (Q814764) (← links)
- Improved supersingularity testing of elliptic curves using Legendre form (Q831974) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- A metric on the set of elliptic curves over \(\mathbb{F}_p\) (Q847404) (← links)
- Fast elliptic scalar multiplication using new double-base chain and point halving (Q865543) (← links)
- Efficient elliptic curve scalar multiplication algorithms resistant to power analysis (Q881859) (← links)
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers (Q887435) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Fault attacks on hyperelliptic curve discrete logarithm problem over binary field (Q893699) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Fast simultaneous scalar multiplication (Q990540) (← links)
- New schemes for sharing points on an elliptic curve (Q1004845) (← links)
- Elliptic curve based hardware architecture using cellular automata (Q1010044) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Improvement of the Miyazaki-Takaragi threshold digital signature scheme (Q1029009) (← links)
- Quasi-quadratic elliptic curve point counting using rigid cohomology (Q1030255) (← links)
- Self-certified multi-proxy signature schemes with message recovery (Q1045611) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Hyperelliptic cryptosystems (Q1121852) (← links)
- Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
