Pages that link to "Item:Q4209277"
From MaRDI portal
The following pages link to A Survey of Fast Exponentiation Methods (Q4209277):
Displaying 50 items.
- IGCC for PAPR reduction in OFDM systems over the nonlinearity of SSPA and wireless fading channels (Q318292) (← links)
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases (Q394267) (← links)
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms (Q407590) (← links)
- A note on asynchronous multi-exponentiation algorithm using binary representation (Q456161) (← links)
- Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques (Q503609) (← links)
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour (Q626943) (← links)
- A new strategy for generating shortest addition sequences (Q644844) (← links)
- Calculating optimal addition chains (Q644848) (← links)
- Star reduction among minimal length addition chains (Q644852) (← links)
- Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143) (← links)
- On the number of optimal base 2 representations of integers (Q851731) (← links)
- Improved generation of minimal addition chains (Q854698) (← links)
- Applying quick exponentiation for block upper triangular matrices (Q865509) (← links)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- A low-complexity LUT-based squaring algorithm (Q971658) (← links)
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833) (← links)
- On \(\tau\)-adic representations of integers (Q1008948) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- A fast parallel modular exponentiation algorithm (Q1640600) (← links)
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods (Q1670419) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- Signed bits and fast exponentiation (Q1826277) (← links)
- Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases (Q1937312) (← links)
- Probabilistic inductive constraint logic (Q2051275) (← links)
- A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices (Q2250225) (← links)
- Efficient big integer multiplication and squaring algorithms for cryptographic applications (Q2336123) (← links)
- A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics (Q2374532) (← links)
- Stern polynomials (Q2383531) (← links)
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields (Q2383972) (← links)
- Lifted discriminative learning of probabilistic logic programs (Q2425249) (← links)
- On a generalization of addition chains: addition-multiplication chains (Q2467743) (← links)
- Trading inversions for multiplications in elliptic curve cryptography (Q2491297) (← links)
- Secure evolvable hardware for public-key cryptosystems (Q2493297) (← links)
- How to compute modular exponentiation with large operators based on the right-to-left binary algorithm (Q2493773) (← links)
- A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography (Q2570690) (← links)
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems (Q2572747) (← links)
- On the construction of short addition-subtraction chains and their applications (Q2689402) (← links)
- Just a Little Bit More (Q2790027) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation (Q2889996) (← links)
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864) (← links)
- Structure computation and discrete logarithms in finite abelian $p$-groups (Q3081295) (← links)
- Binary Addition Chain on EREW PRAM (Q3101432) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Fast Point Decompression for Standard Elliptic Curves (Q3506353) (← links)
- Fast Point Multiplication on Elliptic Curves without Precomputation (Q3519550) (← links)
- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation (Q3623066) (← links)
- Exponent Recoding and Regular Exponentiation Algorithms (Q3637149) (← links)
- Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two (Q4600710) (← links)
