Modular Multiplication Without Trial Division
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Montgomery exponent architecture based on programmable cellular automata
- Constructive and destructive use of compilers in elliptic curve cryptography
- Fast arithmetic for triangular sets: from theory to practice
- High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
- Integer representation in the mixed base (2,3)
- Computation of discrete logarithms in prime fields
- Fast one's-complement multiplication
- Accelerated evaluation of modular reduction
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- Bits and relative order from residues, space efficiently
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Efficient algorithms for remainder computation and exponentiation of long numbers
- Carryless addition
- Fast direct computation of modular reduction
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
- An iterative modular multiplication algorithm
- Quantum arithmetic with the quantum Fourier transform
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Choosing and generating parameters for pairing implementation on BN curves
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Redundant integer representations and fast exponentiation
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
- Analysis of the variable length nonzero window method for exponentiation
- Functional encryption for cascade automata
- Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods
- An alternative approach for SIDH arithmetic
- Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- FFT program generation for ring LWE-based cryptography
- On the worst-case side-channel security of ECC point randomization in embedded devices
- A fast algorithm for computing the number of magic series
- Unified program generation and verification: a case study on number-theoretic transform
- On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- A HDL generator for flexible and efficient finite-field multipliers on FPGAs
- Cracking the problem with 33
- Efficient big integer multiplication and squaring algorithms for cryptographic applications
- Cunningham numbers in modular arithmetic
- Acoustic cryptanalysis
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system
- Fast batch modular exponentiation with common-multiplicand multiplication
- Faster arithmetic for number-theoretic transforms
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- Differential addition on binary elliptic curves
- Fast cryptography in genus 2
- On Grosswald's conjecture on primitive roots
- Double-speed Barrett moduli
- Improving the Big Mac attack on elliptic curve cryptography
- Accelerating oblivious transfer with batch multi-exponentiation
- Performance analysis of ``addition machines
- Recursive double-size fixed precision arithmetic
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
- Montgomery modular multiplication on ARM-NEON revisited
- On symmetric encryption with distinguishable decryption failures
- Linear systolic multiplier/squarer for fast exponentiation
- Nonlinearities in elliptic curve authentication
- On fast calculation of addition chains for isogeny-based cryptography
- Efficient and formally proven reduction of large integers by small moduli
- A generic approach to searching for Jacobians
- A multimodular algorithm for computing Bernoulli numbers
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- Trade-off approaches for leak resistant modular arithmetic in RNS
- A general method to decompose modular multiplicative inverse operators over group of units
- SIKE round 2 speed record on ARM Cortex-M4
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- A new fast modular arithmetic method in public key cryptography
- Optimal use of Montgomery multiplication on smart cards
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Low-weight primes for lightweight elliptic curve cryptography on 8-bit AVR processors
- Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers
- Fast Point Decompression for Standard Elliptic Curves
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
- Modular Reduction in GF(2 n ) without Pre-computational Phase
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- ECM on Graphics Cards
- A New Operator for Multi-addition Calculations
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Code Generation for Polynomial Multiplication
- On Software Parallel Implementation of Cryptographic Pairings
- Distinguishing Multiplications from Squaring Operations
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
- scientific article; zbMATH DE number 3961705 (Why is no real title available?)
- An Algorithm for Multiplication in Modular Arithmetic
- scientific article; zbMATH DE number 4023370 (Why is no real title available?)
- Tables of Fibonacci and Lucas factorizations
- A faster modular multiplication algorithm
- scientific article; zbMATH DE number 62666 (Why is no real title available?)
- scientific article; zbMATH DE number 3494267 (Why is no real title available?)
- Certifying assembly with formal security proofs: the case of BBS
- scientific article; zbMATH DE number 1979274 (Why is no real title available?)
- New frameworks for Montgomery’s modular multiplication method
This page was built for publication: Modular Multiplication Without Trial Division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347947)
