The following pages link to (Q3141896):
Displayed 50 items.
- A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates (Q294862) (← links)
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm (Q396590) (← links)
- Isomorphism classes of Edwards curves over finite fields (Q413563) (← links)
- On Kloosterman sums over finite fields of characteristic 3 (Q516773) (← links)
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings (Q726463) (← links)
- The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
- On the isomorphism classes of Legendre elliptic curves over finite fields (Q763675) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- Improving e-payment security using elliptic curve cryptosystem (Q968357) (← links)
- New schemes for sharing points on an elliptic curve (Q1004845) (← links)
- Elliptic curve based hardware architecture using cellular automata (Q1010044) (← links)
- Subtraction-free almost Montgomery inverse algorithm (Q1041714) (← links)
- Partial known plaintext attack on Koyama scheme (Q1044714) (← links)
- Self-certified multi-proxy signature schemes with message recovery (Q1045611) (← links)
- Cyclicity statistics for elliptic curves over finite fields (Q1284208) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- A random number generator based on elliptic curve operations (Q1433102) (← links)
- An iterative modular multiplication algorithm (Q1609170) (← links)
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two (Q1751377) (← links)
- Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability (Q1774853) (← links)
- On the cyclicity of elliptic curves over finite field extensions (Q1808845) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Some computational problems of cryptographic significance concerning elliptic curves over rings (Q1854282) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- On the oracle complexity of factoring integers (Q1918949) (← links)
- On divisibility of exponential sums of polynomials of special type over fields of characteristic 2 (Q1934224) (← links)
- Orchards in elliptic curves over finite fields (Q1994973) (← links)
- Protecting ECC against fault attacks: the ring extension method revisited (Q2023307) (← links)
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
- Elliptic curve cryptosystems in the presence of permanent and transient faults (Q2486874) (← links)
- Generating more MNT elliptic curves (Q2491266) (← links)
- Isomorphism classes of elliptic and hyperelliptic curves over finite fields \(\mathbb F_{(2g+1)^n}\) (Q2566956) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← links)
- Efficient proxy signature schemes using self-certified public keys (Q2577791) (← links)
- On classical Kloosterman sums (Q2632841) (← links)
- Chevalley-Warning at the boundary (Q2666928) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Fast Hashing to G 2 on Pairing-Friendly Curves (Q3392906) (← links)
- Semi-systolic Modular Multiplier over GF(2m) (Q3512542) (← links)
- Interpolation of the Double Discrete Logarithm (Q3519547) (← links)
- On the Connection between Kloosterman Sums and Elliptic Curves (Q3600439) (← links)
- Computing the $p$-Selmer group of an elliptic curve (Q4505933) (← links)
- An elliptic curve analogue of McCurley's key agreement scheme (Q4608507) (← links)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm (Q4700202) (← links)
- Construction of metrics on the set of elliptic curves over a finite field (Q4985691) (← links)
- Group ring based public key cryptosystems (Q5043926) (← links)
- An Analysis of the Vector Decomposition Problem (Q5445460) (← links)
- An Efficient Key Establishment Scheme for Self-organizing Sensor Networks (Q5445774) (← links)
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\) (Q5938924) (← links)