The following pages link to (Q4826108):
Displayed 50 items.
- Fast elliptic curve point multiplication based on window non-adjacent form method (Q2335516) (← links)
- Analysis and enhancement of a password authentication and update scheme based on elliptic curve cryptography (Q2336256) (← links)
- Design of improved password authentication and update scheme based on elliptic curve cryptography (Q2450508) (← links)
- Computing the modular inverses is as simple as computing the GCDs (Q2469471) (← links)
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\) (Q2491249) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Cold Boot Attacks in the Discrete Logarithm Setting (Q2790059) (← links)
- Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice (Q2794525) (← links)
- Ultra High-Performance ASIC Implementation of SM2 with SPA Resistance (Q2801770) (← links)
- DCapBAC: embedding authorization logic into smart things through ECC optimizations (Q2804894) (← links)
- ECC on Your Fingertips: A Single Instruction Approach for Lightweight ECC Design in GF(p) (Q2807202) (← links)
- Energy-Efficient Elliptic Curve Cryptography for MSP430-Based Wireless Sensor Nodes (Q2817458) (← links)
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography (Q2874306) (← links)
- New DES based on elliptic curves (Q2892115) (← links)
- Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation (Q3011912) (← links)
- Cryptographic aspects of real hyperelliptic curves (Q3075870) (← links)
- Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach (Q3076977) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Batch Computations Revisited: Combining Key Computations and Batch Verifications (Q3084250) (← links)
- A Key Escrow-Free Identity-Based Signature Scheme without using Secure Channel (Q3085284) (← links)
- Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p ) (Q3100520) (← links)
- Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves (Q3104704) (← links)
- Square Always Exponentiation (Q3104721) (← links)
- On Application of Elliptic Curves in Some Electronic Voting Protocols (Q3120405) (← links)
- Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves (Q3121344) (← links)
- A general method for to decompose modular multiplicative inverse operators over Group of units (Q3295207) (← links)
- Lattice-Based Fault Attacks Against ECMQV (Q3297553) (← links)
- (Q3305164) (← links)
- Fast Hashing to G 2 on Pairing-Friendly Curves (Q3392906) (← links)
- A model of hierarchical key assignment scheme (Q3443233) (← links)
- Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors (Q3454155) (← links)
- Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves (Q3511181) (← links)
- VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- On Avoiding ZVP-Attacks Using Isogeny Volcanoes (Q3605396) (← links)
- Double-Base Number System for Multi-scalar Multiplications (Q3627454) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Jacobi Quartic Curves Revisited (Q3634512) (← links)
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine (Q3637151) (← links)
- On Modular Decomposition of Integers (Q3637152) (← links)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- EPG-representations with Small Grid-Size (Q4625111) (← links)
- Free storage basis conversion over finite fields (Q4633245) (← links)
- Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields (Q4932751) (← links)
- Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях (Q4958987) (← links)
- Scalar multiplication in elliptic curve libraries (Q5034943) (← links)
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication (Q5035834) (← links)
- Small scalar multiplication on Weierstrass curves using division polynomials (Q5042268) (← links)