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 8 of 8 for “"Chinese Remainder Theorem"”.
-
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 …
-
A Structure-based Attack on the Linearized Braid Group-based Diffie-Hellman Conjugacy Problem in Combination with an Attack using Polynomial Interpolation and the Chinese Remainder Theorem
… with integer polynomial interpolation and the Chinese remainder theorem (CRT), instead of fast matrix multiplication as suggested by others. The major idea here is to distribute the task of solving a system of linear equations over a giant finite field to several much smaller finite fields. …
-
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 …
-
Modelling and resolving of the ambiguous angle of arrival measurements of the SANAE IV SuperDARN Radar
… target angles. A third algorithm involving the Chinese Remainder Theorem (CRT) was shown to work in theory (albeit only up to ±66ᵒ), but failed to perform in practice. Results presented in this dissertation indicate that the maximum measurable AOA is expanded by a factor of 4 by using the STDEV …
-
The Monochromatic Column Problem: The Prime Case
<p>Let p1, p2, . . . , pn be pairwise coprime positive integers and let P = p1p2 · · · pn. Let 0,1,...,m−1 be a sequence of m different colors. Let A be an n×mP matrix of colors in which row i consists of blocks of pi consecutive entries of the same color, with colors 0 through m − 1 repeated …
-
Path calibration algorithms for many-aperture fiber-linked broadband hypertelescopes
… path length information using an expanded robust Chinese Remainder Theorem algorithm, and then the absolute offset and telescope pointing errors can be inferred from the statistics of the aperture path length errors. A simulation framework for fiber-linked densified-pupil direct-imaging …
-
Efficient RSA Cryptosystems Immune against the Hardware Fault Attack and the FPGA Implementations
In this thesis, new algorithms and structures with immunity against the hardware fault attack for CRT-based two-prime and multi-prime RSA cryptosystems are proposed, investigated, and compared to the previous work. The VLSI implementations of these cryptosystems are carried out in the thesis …
-
Σχεδίαση κυκλωμάτων με πλεονάζουσες και μη αναπαραστάσεις για το αριθμητικό σύστημα υπολοίπων
Η υλοποίηση αποδοτικών αριθμητικών κυκλωμάτων αποτελεί ένα ανοικτό πεδίο έρευνας καθώς η συνεχής εξέλιξη της τεχνολογίας απαιτεί την επανεκτίμηση των μεθόδων σχεδίασής τους, ενώ παράλληλα δημιουργεί νέους τομείς εφαρμογής τους. Ο τεράστιος όγκος πληροφορίας και η ανάγκη γρήγορης επεξεργασίας της …