Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Chinese Remainder Theorem"”.

  1. DESIGNING A NEOTERIC ARCHITECTURE & COMMUNICATION PROTOCOLS FOR CHINESE REMAINDER THEOREM BASED STRUCTURED PEER-TO-PEER NETWORKS WITH COMMON INTERESTS

    … We shall use a mathematical model based on the Chinese Remainder Theorem (CRT), generally used in cryptography, to define the neighborhood relations among peers to obtain the above-mentioned diameters. To the best of our knowledge, use of CRT in P2P network design is a completely new idea; it …

    siu-theses Repository record for DESIGNING A NEOTERIC ARCHITECTURE & COMMUNICATION PROTOCOLS FOR CHINESE REMAINDER THEOREM BASED STRUCTURED PEER-TO-PEER NETWORKS WITH COMMON INTERESTS (opens in a new tab)

  2. Applications of the Chinese Remainder Theorem to the construction and analysis of confounding systems and randomized fractional replicates for mixed factorial experiments

    A well-known theorem in "Number Theory", the Chinese Remainder Theorem, was first utilized by Paul K. Lin in constructing confounding systems for mixed factorial experiments. This study extends the use of the theorem to cover cases when more than one component from some of the symmetrical …

    vt Repository record for Applications of the Chinese Remainder Theorem to the construction and analysis of confounding systems and randomized fractional replicates for mixed factorial experiments (opens in a new tab)

  3. Kinų liekanų teorema ir paslapties pasidalijimo schemos /

    Chinese remainder theorem is based on „Pars pro toto“(eng.a part (taken) for thewhole) principle, it raises a question, does a part of an object gives information about thewhole. Earliest known Chinese remainder theorem statement was presented in the Chinesemathematician Sun Zie book around 3rd …

    vilnius Repository record for Kinų liekanų teorema ir paslapties pasidalijimo schemos / (opens in a new tab)

  4. Encoding Efficient Attributes Using Prime Modulo Method For Anonymous Credentials

    … binary and finite set attribute, we used the Chinese remainder theorem instead of using prime numbers [1].We then used the divisibility and coprime properties to efficiently prove the presence and absence of the attributes. The system is built on strong RSA assumptions. The new method can …

    ndsu Repository record for Encoding Efficient Attributes Using Prime Modulo Method For Anonymous Credentials (opens in a new tab)

  5. Intersective polynomials and Hensel's Lemma

    … methods, namely Hensel’s Lemma and the Chinese remainder theorem, to allow us to create three new infinite families of intersective polynomials. In order to create a candidate intersective polynomial, we employ methods from Galois theory. We multiply together carefully chosen polynomials …

    ubc Repository record for Intersective polynomials and Hensel's Lemma (opens in a new tab) Download PDF for Intersective polynomials and Hensel's Lemma (opens in a new tab)

  6. Key Management Techniques for Dynamic Secure Multicasting

    … method developed by Chiou and Chen, using the Chinese Remainder Theorem. The protocol is implemented for a small group of users and its performance is studied. While, the secure lock method works well for a small group of users and the performance is degraded when the group grows in size. A …

    vt Repository record for Key Management Techniques for Dynamic Secure Multicasting (opens in a new tab)

  7. Data Compression Using a Multi-residue System (Mrs)

    … based on multi-residue number systems. The basic theorem is that an under-determined system of congruences could be solved to accomplish data compression for a signal satisfying continuity of its information content and bounded in peak-to -peak amplitude by the product of relatively prime moduli,. …

    unt Repository record for Data Compression Using a Multi-residue System (Mrs) (opens in a new tab)

  8. Resolving frequency ambiguities in step: frequency compressive receivers

    … limitations. An algorithm that implements the Chinese Remainder Theorem to solve the frequency ambiguities that occur in the design due to sub-Nyquist sampling with high resolutions is investigated. Different resolutions, a different number of sampling frequencies, and sampling frequency pairs …

    nps Repository record for Resolving frequency ambiguities in step: frequency compressive receivers (opens in a new tab)

  9. Low power modulo reduction technique and its application in residue-to-binary converters

    … modulo reduction algorithms to the modified Chinese Remainder Theorem (CRT), the complexity of modulo operation in the modified CRT is reduced significantly. The modulo reduction technique and the modulo reduced modified CRT are applied to derive R/B algorithms for two existing three-moduli …

    concordia Download PDF for Low power modulo reduction technique and its application in residue-to-binary converters (opens in a new tab)

  10. High-Performance VLSI Architectures for Lattice-Based Cryptography

    … lattice-based PQC scheme. Afterward, an NTT and Chinese remainder theorem (CRT)-based high-speed modular polynomial multiplier is presented for HE schemes whose moduli are large integers.

    clemson Repository record for High-Performance VLSI Architectures for Lattice-Based Cryptography (opens in a new tab)

  11. Improved Pattern Generation for Bloom Filters with Bit Patterns Optimizing bit patterns for use in blocked Bloom filters

    … generation used in these structures based on the Chinese Remainder Theorem. The results indicate that this construction improves the false positive rate for all our testing scenarios. As a side-result we also propose a modification to a known combinatorial design used in group testing which …

    chalmers Repository record for Improved Pattern Generation for Bloom Filters with Bit Patterns Optimizing bit patterns for use in blocked Bloom filters (opens in a new tab)

  12. Multitarget Tracking with Doppler Ambiguity

    … to eliminate the Doppler ambiguity based on the Chinese Remainder Theorem have been proposed for radars with multiple PRFs. Time- Frequency Analysis (TFA) using Fast Fourier Transform (FFT) can reduce the ambiguity in the frequency domain.</p> <p>In this paper, a new approach for multitarget …

    mcmaster Repository record for Multitarget Tracking with Doppler Ambiguity (opens in a new tab)

  13. Energy Efficient Secure Key Management Schemes for WSNs and IoT

    … multi-secret sharing scheme based on the Chinese remainder theorem (CRT) with two verification methods, while the previous works are mostly based on the Lagrange polynomial. Key management schemes play an important role in communication security in Wireless Sensor Networks (WSNs). While …

    ottawa-retro Repository record for Energy Efficient Secure Key Management Schemes for WSNs and IoT (opens in a new tab)

  14. Secure group communications and hierarchical access control

    … control scheme for tree structures, and (ii) a Chinese Remainder Theorem based hierarchical access scheme for secure group communications .

    nebraska Repository record for Secure group communications and hierarchical access control (opens in a new tab)

  15. Adaptive Approaches for Medical Imaging Security

    … background regions. A new algorithm based on the Chinese remainder theorem is modified to encrypt a medium information region. The high information region is encrypted using the AES. The results showed that implementation time is reduced by an average of 20% and the robustness is maintained in …

    guelph Repository record for Adaptive Approaches for Medical Imaging Security (opens in a new tab)

  16. Algorithms for Scheduling Problems and Integer Programming

    … congruences. However, the setting of the famous Chinese Remainder Theorem is that each congruence has to have a certain remainder. We relax this setting such that the remainder of each congruence may lie in a given interval. We show that the smallest solution to these congruences can be computed …

    cau-kiel Repository record for Algorithms for Scheduling Problems and Integer Programming (opens in a new tab)

  17. Number Theoretic Algorithms For Elliptic Curves

    … H_D modulo p for p inert which is used in the Chinese remainder theorem algorithm to compute H_D. For an elliptic curve E over any field K, the Weil pairing is a bilinear map on the points of order n of E. The Weil pairing is a useful tool in both the theory of elliptic curves and the …

    maryland Repository record for Number Theoretic Algorithms For Elliptic Curves (opens in a new tab)

  18. Number-Theoretic Sequence Design for Uncoordinated Resource Block Assignments in Relay-Assisted Machine-Type Communication Systems

    … multi-generator sequences. In particular, the Chinese remainder theorem (CRT) is used to combine cyclically-generated sequences into longer ones. This combining process introduces additional degrees of freedom in sequence generation, thereby enriching the set of assignment sequences. We then …

    carleton Repository record for Number-Theoretic Sequence Design for Uncoordinated Resource Block Assignments in Relay-Assisted Machine-Type Communication Systems (opens in a new tab)

Page 1 of 2