Pages that link to "Item:Q3347947"
From MaRDI portal
The following pages link to Modular Multiplication Without Trial Division (Q3347947):
Displayed 50 items.
- Efficient big integer multiplication and squaring algorithms for cryptographic applications (Q2336123) (← links)
- Cunningham numbers in modular arithmetic (Q2371565) (← links)
- Acoustic cryptanalysis (Q2397444) (← links)
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system (Q2399132) (← links)
- Fast batch modular exponentiation with common-multiplicand multiplication (Q2410573) (← links)
- Faster arithmetic for number-theoretic transforms (Q2437296) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543) (← links)
- Differential addition on binary elliptic curves (Q2689349) (← links)
- On Grosswald’s conjecture on primitive roots (Q2787085) (← links)
- Double-Speed Barrett Moduli (Q2803625) (← links)
- Improving the Big Mac Attack on Elliptic Curve Cryptography (Q2803645) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- Recursive Double-Size Fixed Precision Arithmetic (Q2819221) (← links)
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman (Q2835601) (← links)
- Montgomery Modular Multiplication on ARM-NEON Revisited (Q2942845) (← links)
- On Symmetric Encryption with Distinguishable Decryption Failures (Q2946887) (← links)
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- A multimodular algorithm for computing Bernoulli numbers (Q3160744) (← links)
- Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA (Q3179485) (← links)
- Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS (Q3194592) (← links)
- A general method for to decompose modular multiplicative inverse operators over Group of units (Q3295207) (← links)
- SIKE Round 2 Speed Record on ARM Cortex-M4 (Q3297612) (← links)
- Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography (Q3297615) (← links)
- A new fast modular arithmetic method in public key cryptography (Q3443246) (← links)
- Optimal Use of Montgomery Multiplication on Smart Cards (Q3452242) (← links)
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems (Q3452345) (← links)
- Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors (Q3454155) (← links)
- Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers (Q3455499) (← links)
- Fast Point Decompression for Standard Elliptic Curves (Q3506353) (← links)
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography (Q3506407) (← links)
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (Q3511179) (← links)
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation (Q3511182) (← links)
- Modular Reduction in GF(2 n ) without Pre-computational Phase (Q3519553) (← links)
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients (Q3623057) (← links)
- ECM on Graphics Cards (Q3627453) (← links)
- A New Operator for Multi-addition Calculations (Q3628549) (← links)
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography (Q3634510) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Distinguishing Multiplications from Squaring Operations (Q3644212) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- New frameworks for Montgomery’s modular multiplication method (Q4452169) (← links)
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems (Q4827601) (← links)
- Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields (Q4932751) (← links)
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms (Q5041233) (← links)
- Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278) (← links)
- Functional Encryption for Cascade Automata (Extended Abstract) (Q5207903) (← links)