Pages that link to "Item:Q3347947"
From MaRDI portal
The following pages link to Modular Multiplication Without Trial Division (Q3347947):
Displayed 50 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Linear systolic multiplier/squarer for fast exponentiation (Q294863) (← links)
- Nonlinearities in elliptic curve authentication (Q296311) (← links)
- Certifying assembly with formal security proofs: the case of BBS (Q436406) (← links)
- A binary algorithm with low divergence for modular inversion on SIMD architectures (Q480385) (← links)
- Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques (Q503609) (← links)
- Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
- Revisiting sum of residues modular multiplication (Q543014) (← links)
- A multiprecise integer arithmetic package (Q547494) (← links)
- Factoring: algorithms, computations, and computers (Q547500) (← links)
- Missing a trick: Karatsuba variations (Q680912) (← links)
- Backtracking-assisted multiplication (Q680916) (← links)
- An iterative modular multiplication algorithm in RNS (Q814756) (← links)
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- Hardware implementation of finite-field division (Q850787) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) (← links)
- Programmable cellular automata based Montgomery hardware architecture (Q876683) (← links)
- Fast modular multi-exponentiation using modified complex arithmetic (Q884549) (← links)
- The distributions of individual bits in the output of multiplicative operations (Q892279) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Highly parallel modular multiplication in the residue number system using sum of residues reduction (Q969623) (← links)
- Fast binary multiplication by performing dot counting and complement recoding (Q990410) (← links)
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833) (← links)
- Montgomery exponent architecture based on programmable cellular automata (Q1010043) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- High-performance hardware of the sliding-window method for parallel computation of modular exponentiations (Q1039216) (← links)
- Integer representation in the mixed base \((2,3)\) (Q1040415) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Accelerated evaluation of modular reduction (Q1280986) (← links)
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm (Q1312101) (← links)
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications (Q1344528) (← links)
- Efficient algorithms for remainder computation and exponentiation of long numbers (Q1364066) (← links)
- Carryless addition (Q1364070) (← links)
- Fast direct computation of modular reduction (Q1570258) (← links)
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm (Q1603547) (← links)
- An iterative modular multiplication algorithm (Q1609170) (← links)
- Quantum arithmetic with the quantum Fourier transform (Q1679367) (← links)
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA (Q1698668) (← links)
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (Q1706614) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes (Q1746962) (← links)
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests (Q1820186) (← links)
- Redundant integer representations and fast exponentiation (Q1910428) (← links)
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems (Q1938506) (← links)
- Analysis of the variable length nonzero window method for exponentiation (Q1963003) (← links)