scientific article; zbMATH DE number 1122449
From MaRDI portal
Publication:4379555
zbMath0907.11002MaRDI QIDQ4379555
Cunsheng Ding, Arto Salomaa, Pei Dingyi
Publication date: 2 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsresultantsfast Fourier transformcryptographycodingChinese remainder theoremcyclic convolutionpolynomial interpolationshift register synthesismodular computationsmultiplication of large integersChinese reaminder algorithm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (59)
Minimal reaction systems: duration and blips ⋮ Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints ⋮ Cyclic codes with generalized cyclotomic cubic classes ⋮ Fuzzy congruences on AG-group ⋮ 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 ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ Threshold cryptography based on Asmuth-Bloom secret sharing ⋮ Unnamed Item ⋮ Generalizing Ruth-Aaron Numbers ⋮ The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields ⋮ Discrete logarithm and minimum circuit size ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ Distributive weighted threshold secret sharing schemes ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Error Correction Method in Modular Redundant Codes ⋮ Robust Threshold Schemes Based on the Chinese Remainder Theorem ⋮ A perfect secret sharing scheme for general access structures ⋮ Whiteman's generalized cyclotomic numbers with respect to \(t\) primes ⋮ Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence ⋮ On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme ⋮ Type-II polyadic constacyclic codes over finite fields ⋮ Efficient Hardware Operations for the Residue Number System by Boolean Minimization ⋮ On quantum secret sharing via chinese remainder theorem with the non-maximally entanglement state analysis ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ High-efficient quantum secret sharing based on the Chinese remainder theorem via the orbital angular momentum entanglement analysis ⋮ A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme ⋮ Primitive idempotents of irreducible cyclic codes of length \(n\) ⋮ Computationally efficient robust Chinese remainder theorem for frequency estimation from undersampled waveforms ⋮ A new family of optimal FHS sets with composite lengths ⋮ Two classes of optimal frequency-hopping sequences with new parameters ⋮ 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 ⋮ The linear complexity of a class of binary sequences with period \(2p\) ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Graph state-based quantum secret sharing with the Chinese remainder theorem ⋮ 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 ⋮ Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings ⋮ Lattice-based treshold-changeability for standard CRT secret-sharing schemes ⋮ 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 ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2 ⋮ New generalized cyclotomy and its applications ⋮ A trace representation of binary Jacobi sequences ⋮ Unnamed Item ⋮ 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 ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Zero-difference balanced functions with applications ⋮ Some arithmetical properties of cyclotomic cosets and their applications ⋮ Secret-sharing with a class of ternary codes ⋮ A new \((w, t, n)\)-weighted threshold quantum secret sharing scheme based on two-qubit system ⋮ Simplified Bounds on FHSs Set and Its Strictly Optimal Construction ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting ⋮ Combined random number generator via the generalized Chinese remainder theorem
This page was built for publication:
