scientific article; zbMATH DE number 3269473
From MaRDI portal
Publication:5553682
zbMath0168.15303MaRDI QIDQ5553682
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (80)
Bits and relative order from residues, space efficiently ⋮ A high-speed division algorithm in residue number system using parity-checking technique ⋮ Division and sign detection algorithms for residue number systems ⋮ A layered algorithm for quantifier elimination from linear modular constraints ⋮ RNS sign detector based on Chinese remainder theorem II (CRT II) ⋮ Fast RNS division algorithms for fixed divisors with application to RSA encryption ⋮ Arithmetic codes resembling neural encoding ⋮ Base extension using a convolution sum in residue number systems ⋮ A division algorithm for residue numbers ⋮ On convergence and limit cycles in digital filters in integer number systems ⋮ RNS architectures for the implementation of the `diagonal function' ⋮ On the optimal utilization of all available states in the \(2^{n}\) moduli set ⋮ Cunningham numbers in modular arithmetic ⋮ A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ The factor-2 sign detection algorithm using a core function for RNS numbers ⋮ Modular multiplication using the core function in the residue number system ⋮ High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\) ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ An error-free generalized matrix inversion and linear least squares method based on bordering ⋮ A flow-mode, self-steering, cellular multiplier-summation processor ⋮ Parallel p-adic computation ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Fast and highly compact RNS multipliers ⋮ Communication complexity of matrix computation over finite fields ⋮ Reverse conversion using core function, CRT and mixed radix conversion ⋮ Exact deconvolution using number-theoretic transforms ⋮ Error-free computation of the moore-penrose inverse with application to linear least squares analysis ⋮ Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256 ⋮ Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ Generation of integral characteristics of symmetric-range residue codes ⋮ Error Correction Method in Modular Redundant Codes ⋮ Reference Points Based RNS Reverse Conversion for General Moduli Sets ⋮ An Algorithm for the Exact Reduction of a Matrix to Frobenius form Using Modular Arithmetic. II ⋮ A new high dynamic range moduli set with efficient reverse converter ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ A floating-point residue arithmetic unit ⋮ Four-moduli set (\(2, 2^{n}-1, 2^{n}+2^{n-1}-1, 2^{n+1}+2^{n}-1\)) simplifies the residue to binary converters based on CRT II. ⋮ New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set ⋮ Positional characteristics for efficient number comparison over the homomorphic encryption ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ An improved Chen's parity detection technique for the two-moduli set ⋮ The Fast Fourier Transform in a Finite Field ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ An efficient design of residue to binary converter for four moduli set \((2^{n}-1,2^n + 1,2^{2n}-2,2^{2n+1}-3)\) based on New CRT II ⋮ Floating-point numbers in residue number systems ⋮ Method for designing efficient mixed radix multipliers ⋮ Revisiting sum of residues modular multiplication ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set ⋮ Highly parallel modular multiplication in the residue number system using sum of residues reduction ⋮ Division in logspace-uniformNC1 ⋮ Concurrent detection of additive overflow and arithmetic errors in residue codes ⋮ Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems ⋮ Toward Acceleration of RSA Using 3D Graphics Hardware ⋮ An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) ⋮ A note on RNS architectures for the implementation of the diagonal function ⋮ Error codes in residue number systems with magnitude index ⋮ Pursuit and synchronization in hydrodynamic dipoles ⋮ A new residue number system division algorithm ⋮ Sign determination in residue number systems ⋮ Parallel DNA arithmetic operation based on \(n\)-moduli set ⋮ Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs ⋮ Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ On symmetric radix representation of Gaussian integers ⋮ Arithmetic division in RNS using Galois field \(GF(p)\) ⋮ A new technique for WFTA input/output reordering ⋮ Exploiting the Power of GPUs for Asymmetric Cryptography ⋮ Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even) ⋮ Error-free computation with rational numbers ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\) ⋮ Multiparty generation of an RSA modulus ⋮ Error-free computation of a reflexive generalized inverse ⋮ Fast algorithms for erasures and error correction in redundant residue number systems ⋮ An improved algorithm for mixed-radix conversion of residue numbers ⋮ Special algorithms for convolutions over Galois fields ⋮ A fully parallel algorithm for residue to binary conversion ⋮ Core function of an RNS number with no ambiguity ⋮ An iterative modular multiplication algorithm in RNS ⋮ An approximate sign detection method for residue numbers and its application to RNS division
This page was built for publication:
