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 11 of 11 for “"Modular Arithmetic"”.
-
OnionChopper: A Modular Arithmetic Hardware Accelerator for Private Information Retrieval
Private information retrieval (PIR) is a protocol which allows a user to retrieve data from a database on a server without the server being able to deduce which records were retrieved. Due to the homomorphic cryptography systems required to make these protocols work and large amount of data …
-
To attract or to oscillate: Validating dynamics with behavior
… ``oscillatory mechanism'', to compute a novel modular arithmetic task inspired by the card game SET. The attractive mechanism computes modular arithmetic through traversing a lattice of fixed-point attractors. The oscillatory mechanism computes modular arithmetic through phase-shifts on a limit …
-
Integer Solutions to Optimization Problems and Modular Sequences of Nexus Numbers
… a sequence, and through a few computations of modular arithmetic, we analyze the sequences and their patterns based upon the different moduli. These patterns are specific to whether the power is even or odd. Within each power, there are other properties to this set of sequences. Depending on …
-
Metacognition Moderates Math Anxiety and Affects Performance on a Math Task
… Participants completed a math anxiety scale, a modular arithmetic task, and a state metacognition scale. Participants also provided information regarding their confidence in how well they answered each math question correctly as well as their estimation of their overall performance. As expected, …
-
FPGA Implementation and Optimization of Bit Flipping Key Generation Algorithm for Post Quantum Cryptography in Embedded Systems Applications
… consumption due to its computationally intensive modular arithmetic operations, which include polynomial multiplication, inversion, and hashing. These factors limits its FPGA implementation power for embedded and IoT applications. This research work presents a resource-constrained FPGA …
-
Disdyakis Triacontahedron Discrete Global Grid System
… an atlas of connectivity maps. Using some simple modular arithmetic, we can then address point to cell, neighborhood and hierarchical queries on the grid, allowing for these queries to be performed in constant time. We have evaluated the angular distortion created by our DGGS by comparing it to a …
-
Elliptic Curve Cryptography on Heterogeneous Multicore Platform
… However, performance of ECC and the underlying modular arithmetic on embedded processors remains a concern. At the same time, more complex system-on-chip platforms with multiple heterogeneous cores are commonly available in mobile phones and other embedded devices. In this work we investigate …
-
Efficient Architecture and Implementation for NTRU Based Systems
… is firstly presented. A novel design of the modular arithmetic unit is proposed to reduce the critical path delay. The FPGA implementation results have shown that the proposed design outperforms all the existing works in terms of area-delay product. Secondly, a new architecture using extended …
-
Designing a Programmable Hardware Accelerator for Fully Homomorphic Encryption
… deeply specialized to FHE primitives, such as modular arithmetic, number-theoretic transforms, and structured permutations. Due to the static nature of FHE computations, F1 uses an exposed ISA, requiring novel compilation techniques to statically schedule all compute and data movement. We …
-
Design Methods for Cryptanalysis
… logical attack on ECC with optimized modular arithmetic components. The language features of Bluespec support exploration and this is demonstrated by applying Bluespec to investigate the speed area tradeoff resulting from various design parameters and demonstrating performance that is …
-
Performance Optimization of Public Key Cryptography on Embedded Platforms
… built into these processors to accelerate the modular arithmetic which accounts for the majority of execution time in Elliptic Curve Cryptography. We exploit the structure of NIST primes to perform the reduction step as we perform the multiplication. Our implementation runs over two times …