Modular Multiplication Without Trial Division
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Improvements to RSA key generation and CRT on embedded devices
- On Grosswald's conjecture on primitive roots
- Fast Point Decompression for Standard Elliptic Curves
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- A new fast modular arithmetic method in public key cryptography
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
- Computational schemes for subresultant chains
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- scientific article; zbMATH DE number 4023370 (Why is no real title available?)
- scientific article; zbMATH DE number 1979274 (Why is no real title available?)
- Exploiting the Power of GPUs for Asymmetric Cryptography
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- An iterative modular multiplication algorithm
- Highly parallel modular multiplication in the residue number system using sum of residues reduction
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- Efficient implementations of square-root Vélu's formulas
- Modular multiplication in the AMNS representation: hardware implementation
- Simultaneous modular reduction and Kronecker substitution for small finite fields
- Fast cryptography in genus 2
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- Efficient big integer multiplication and squaring algorithms for cryptographic applications
- Revisiting sum of residues modular multiplication
- A multiprecise integer arithmetic package
- Factoring: algorithms, computations, and computers
- scientific article; zbMATH DE number 3961705 (Why is no real title available?)
- Distinguishing Multiplications from Squaring Operations
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Code Generation for Polynomial Multiplication
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- Choosing and generating parameters for pairing implementation on BN curves
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- Functional encryption for cascade automata
- Acoustic cryptanalysis
- A HDL generator for flexible and efficient finite-field multipliers on FPGAs
- The Inverse of a Multiplication Trick
- Efficient software-implementation of finite fields with applications to cryptography
- Hardware implementation of finite-field division
- ECM on Graphics Cards
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms
- Accelerated evaluation of modular reduction
- On fast calculation of addition chains for isogeny-based cryptography
- scientific article; zbMATH DE number 62666 (Why is no real title available?)
- Bits and relative order from residues, space efficiently
- Modular Reduction in GF(2 n ) without Pre-computational Phase
- Double-speed Barrett moduli
- Fast binary multiplication by performing dot counting and complement recoding
- FFT program generation for ring LWE-based cryptography
- Certifying assembly with formal security proofs: the case of BBS
- Fast convolutions meet Montgomery
- Faster integer multiplication using short lattice vectors
- High-performance hardware of the sliding-window method for parallel computation of modular exponentiations
- Fast direct computation of modular reduction
- Linear systolic multiplier/squarer for fast exponentiation
- Nonlinearities in elliptic curve authentication
- SIKE round 2 speed record on ARM Cortex-M4
- Searching for a counterexample to Kurepa's conjecture
- Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers
- A New Operator for Multi-addition Calculations
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Key management for outsourced data security
- On symmetric encryption with distinguishable decryption failures
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Reduction-free multiplication for finite fields and polynomial rings
- Cryptographic Side-Channels from Low-Power Cache Memory
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- Programmable cellular automata based Montgomery hardware architecture
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
- Toward Acceleration of RSA Using 3D Graphics Hardware
- Montgomery exponent architecture based on programmable cellular automata
- Constructive and destructive use of compilers in elliptic curve cryptography
- The distributions of individual bits in the output of multiplicative operations
- Survey number theoretic transform algorithm over a polynomial ring and its application
- Improved Stage 2 to P ± 1 Factoring Algorithms
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- Verified Newton-Raphson iteration for multiplicative inverses modulo powers of any base
- Reduction modulo \(2^{448}-2^{224}-1\)
- Efficient Hardware Operations for the Residue Number System by Boolean Minimization
- Fast modular multi-exponentiation using modified complex arithmetic
- Multiple product modulo arbitrary numbers
- Multiple product modulo arbitrary numbers
- Cunningham numbers in modular arithmetic
- A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2n - (2p 1))
- New frameworks for Montgomery’s modular multiplication method
- A fast algorithm for computing the number of magic series
- Tables of Fibonacci and Lucas factorizations
- Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
- A multimodular algorithm for computing Bernoulli numbers
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)
