Modular Multiplication Without Trial Division
From MaRDI portal
Publication:3347947
DOI10.2307/2007970zbMath0559.10006OpenAlexW4237773356MaRDI QIDQ3347947
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2007970
Related Items
Fast cryptography in genus 2, Improvements to RSA key generation and CRT on embedded devices, A multimodular algorithm for computing Bernoulli numbers, FFT program generation for ring LWE-based cryptography, A new fast modular arithmetic method in public key cryptography, Computational schemes for subresultant chains, Linear systolic multiplier/squarer for fast exponentiation, Nonlinearities in elliptic curve authentication, Cunningham numbers in modular arithmetic, Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications, 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 Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA, Efficient software-implementation of finite fields with applications to cryptography, Hardware implementation of finite-field division, Efficient hardware implementation of finite fields with applications to 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, Efficient algorithms for remainder computation and exponentiation of long numbers, Carryless addition, Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS, Redundant integer representations and fast exponentiation, Unified program generation and verification: a case study on number-theoretic transform, Acoustic cryptanalysis, Highly parallel modular multiplier for elliptic curve cryptography in residue number system, An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques, 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, Programmable cellular automata based Montgomery hardware architecture, Fast batch modular exponentiation with common-multiplicand multiplication, Montgomery Modular Multiplication on ARM-NEON Revisited, Quantum arithmetic with the quantum Fourier transform, Fast modular multi-exponentiation using modified complex arithmetic, On Symmetric Encryption with Distinguishable Decryption Failures, The distributions of individual bits in the output of multiplicative operations, Horizontal collision correlation attack on elliptic curves, RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems, 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, 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, Differential addition on binary elliptic curves, Modular Reduction in GF(2 n ) without Pre-computational Phase, Certifying assembly with formal security proofs: the case of BBS, Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses, Faster arithmetic for number-theoretic transforms, On Fast Calculation of Addition Chains for Isogeny-Based Cryptography, Analysis of the variable length nonzero window method for exponentiation, A general method for to decompose modular multiplicative inverse operators over Group of units, A binary algorithm with low divergence for modular inversion on SIMD architectures, Computation of discrete logarithms in prime fields, SIKE Round 2 Speed Record on ARM Cortex-M4, Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography, A HDL generator for flexible and efficient finite-field multipliers on FPGAs, Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques, Choosing and generating parameters for pairing implementation on BN curves, Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes, Missing a trick: Karatsuba variations, Backtracking-assisted multiplication, Simultaneous modular reduction and Kronecker substitution for small finite fields, Revisiting sum of residues modular multiplication, Highly parallel modular multiplication in the residue number system using sum of residues reduction, A multiprecise integer arithmetic package, Factoring: algorithms, computations, and computers, Functional encryption for cascade automata, On Grosswald’s conjecture on primitive roots, A generic approach to searching for Jacobians, Fast binary multiplication by performing dot counting and complement recoding, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Double-Speed Barrett Moduli, Improving the Big Mac Attack on Elliptic Curve Cryptography, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients, Montgomery exponent architecture based on programmable cellular automata, Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods, Constructive and destructive use of compilers in elliptic curve cryptography, Accelerating Oblivious Transfer with Batch Multi-exponentiation, Recursive Double-Size Fixed Precision Arithmetic, An alternative approach for SIDH arithmetic, Fast arithmetic for triangular sets: from theory to practice, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Cracking the problem with 33, Accelerated evaluation of modular reduction, Efficient Algorithms for Supersingular Isogeny Diffie-Hellman, Fast direct computation of modular reduction, High-performance hardware of the sliding-window method for parallel computation of modular exponentiations, Integer representation in the mixed base \((2,3)\), Efficient big integer multiplication and squaring algorithms for cryptographic applications, A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation., Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model, A design of fast pipelined modular multiplier based on a diminished-radix algorithm, Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm, An implementation of parallel number-theoretic transform using Intel AVX-512 instructions, An iterative modular multiplication algorithm, An iterative modular multiplication algorithm in RNS, Efficient FPGA design of exception-free generic elliptic curve cryptosystems, Improved Quantum Circuits for Elliptic Curve Discrete Logarithms, Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems, Generalised Mersenne numbers revisited, Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields, Tables of Fibonacci and Lucas factorizations, Faster integer multiplication using short lattice vectors, Reduction-free multiplication for finite fields and polynomial rings, Finite field arithmetic in large characteristic for classical and post-quantum cryptography, Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?, Efficient Hardware Operations for the Residue Number System by Boolean Minimization, Faster truncated integer multiplication, Improved Stage 2 to P ± 1 Factoring Algorithms, Searching for a counterexample to Kurepa’s conjecture, Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields, A comparison of different finite fields for elliptic curve cryptosystems, Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\), $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms, Fast convolutions meet Montgomery, An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm, Cryptographic Side-Channels from Low-Power Cache Memory, Toward Acceleration of RSA Using 3D Graphics Hardware, Speeding up the computations on an elliptic curve using addition-subtraction chains, Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms, Functional Encryption for Cascade Automata (Extended Abstract), ECM on Graphics Cards, A New Operator for Multi-addition Calculations, New frameworks for Montgomery’s modular multiplication method, 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, Public-key cryptography on smart cards, Exploiting the Power of GPUs for Asymmetric Cryptography, Key management for outsourced data security, Enhanced Digital Signature Using RNS Digit Exponent Representation, Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography
