scientific article; zbMATH DE number 1122449
From MaRDI portal
Publication:4379555
algorithmsChinese reaminder algorithmChinese remainder theoremcodingcryptographycyclic convolutionfast Fourier transformmodular computationsmultiplication of large integerspolynomial interpolationresultantsshift register synthesis
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Recommendations
- scientific article; zbMATH DE number 2096584
- Anwendungen des chinesischen Restsatzes. (Applications of the Chinese remainder theorem)
- The Chinese remainder theorem
- The generalization of the Chinese remainder theorem
- Chinese remainder theorem, Reed-Solomon codes, and list decoding
- One application of the Chinese remainder theorem to the Vigenére cipher
- Selected application of the Chinese remainder theorem in multiparty computation
- Chinese remainder theorem secret sharing in multivariate polynomials
Cited in
(82)- A trace representation of binary Jacobi sequences
- Anwendungen des chinesischen Restsatzes. (Applications of the Chinese remainder theorem)
- Chinesische Reste und moderne Kryptographie
- The Chinese remainder theorem
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Secret-sharing with a class of ternary codes
- Combined random number generator via the generalized Chinese remainder theorem
- The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
- Optimal FHSs and DSSs via near zero-difference balanced functions
- Distributive weighted threshold secret sharing schemes
- Primitive idempotents of irreducible cyclic codes of length \(n\)
- A new family of optimal FHS sets with composite lengths
- On quantum secret sharing via chinese remainder theorem with the non-maximally entanglement state analysis
- High-efficient quantum secret sharing based on the Chinese remainder theorem via the orbital angular momentum entanglement analysis
- Scalable antinoise-robustness estimation of frequency and direction of arrival based on the relaxed sparse array
- Two new classes of binary sequence pairs with three-level cross-correlation
- New number-theoretic cryptographic primitives
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding
- Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem
- A new \((w, t, n)\)-weighted threshold quantum secret sharing scheme based on two-qubit system
- Fuzzy congruences on AG-group
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Selected application of the Chinese remainder theorem in multiparty computation
- Zero-difference balanced functions with applications
- Minimal reaction systems: duration and blips
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Discrete logarithm and minimum circuit size
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Residue number systems. Theory and applications
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Generalized cyclotomic numbers of order two and their applications
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- Generalized cyclotomic numbers with respect to prime powers
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- A Sharpened Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers
- Whiteman's generalized cyclotomic numbers with respect to \(t\) primes
- A geometrical interpretation of the Chinese remainder theorem and its applications to MD signal processing
- Modular arithmetic and its applications in info-communication technologies
- Fast Chinese remaindering in practice
- scientific article; zbMATH DE number 2138801 (Why is no real title available?)
- Computationally efficient robust Chinese remainder theorem for frequency estimation from undersampled waveforms
- Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
- Applications of the Chinese remainder theorem to reaction systems with duration
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- Generalizing Ruth-Aaron numbers
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
- The linear complexity of a class of binary sequences with period \(2p\)
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Cyclic codes with generalized cyclotomic cubic classes
- Restricted congruences in computing
- Graph state-based quantum secret sharing with the Chinese remainder theorem
- A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing
- Autocorrelation of the modified binary two-prime Sidelnikov sequence
- Simplification on dynamic range of a generalized Chinese remainder theorem for multiple integers
- Chinese remainder codes
- Simplified bounds on FHSs set and its strictly optimal construction
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- One application of the Chinese remainder theorem to the Vigenére cipher
- Error Correction Method in Modular Redundant Codes
- A perfect secret sharing scheme for general access structures
- Type-II polyadic constacyclic codes over finite fields
- Efficient Hardware Operations for the Residue Number System by Boolean Minimization
- MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
- Two classes of optimal frequency-hopping sequences with new parameters
- New successor rules to efficiently produce exponentially many binary de Bruijn sequences
- The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem
- A new public key cryptosystem based on the cubic Pell curve
- Factorization and irreducibility of composed products
- On Mignotte secret sharing schemes over Gaussian integers
- A family of cyclic codes with increasing dimensions and fixed minimum distances
- Parameterized approximability for modular linear equations
- Some arithmetical properties of cyclotomic cosets and their applications
- Fast arithmetics using Chinese remaindering
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379555)
