The following pages link to (Q4826108):
Displaying 50 items.
- On the distribution of Atkin and Elkies primes (Q404278) (← links)
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 (Q411481) (← links)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- Enhanced secure anonymous authentication scheme for roaming service in global mobility networks (Q445398) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- An ID-based three-party authenticated key exchange protocol using elliptic curve cryptography for mobile-commerce environments (Q458506) (← links)
- A novel elliptic curve scalar multiplication algorithm against power analysis (Q474700) (← links)
- Simplified small exponent test for batch verification (Q501674) (← links)
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) (Q510481) (← links)
- Multiple point compression on elliptic curves (Q521859) (← links)
- On optimal binary signed digit representations of integers (Q551451) (← links)
- A matrix approach for FCSR automata (Q662175) (← links)
- Unbalanced digit sets and the closest choice strategy for minimal weight integer representations (Q735022) (← links)
- High-throughput elliptic curve cryptography using AVX2 vector instructions (Q832404) (← links)
- A metric on the set of elliptic curves over \(\mathbb{F}_p\) (Q847404) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Hardware implementation of finite-field division (Q850787) (← links)
- An exact subexponential-time lattice algorithm for Asian options (Q878377) (← links)
- Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- Highly parallel modular multiplication in the residue number system using sum of residues reduction (Q969623) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Extractors for binary elliptic curves (Q1009079) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves (Q1616162) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- LWDSA: light-weight digital signature algorithm for wireless sensor networks (Q1637662) (← links)
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery (Q1637871) (← links)
- High-performance generic-point parallel scalar multiplication (Q1640404) (← links)
- Pseudorandom bit sequence generator for stream cipher based on elliptic curves (Q1665107) (← links)
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods (Q1670419) (← links)
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves (Q1675781) (← links)
- Authenticated communication from quantum readout of pufs (Q1700008) (← links)
- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) (Q1705651) (← links)
- Injective encodings to binary ordinary elliptic curves (Q1726692) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Cryptanalysis of a communication-efficient three-party password authenticated key exchange protocol (Q1761614) (← links)
- Speeding up Huff form of elliptic curves (Q1801095) (← links)
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions (Q2018202) (← links)
- Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
- Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited (Q2056729) (← links)
- Efficient arithmetic in (pseudo-)Mersenne prime order fields (Q2085714) (← links)
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems (Q2117041) (← links)
- The rank-based cryptography library (Q2163759) (← links)
- An application of crypto cloud computing in social networks by cooperative game theory (Q2190321) (← links)
- Speeding up regular elliptic curve scalar multiplication without precomputation (Q2210646) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
