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 13 of 13 for “"number-theoretic transform"”.

  1. VLSI architecture for adaptive digital filtering utilising number theoretic transform

    … filter in Very Large Scale Integration using the Number Theoretic Transform. The properties of residue numbering systems are investigated, and particularly the possible advantages occured from parallelism, operations without the need for carry, and the absence of round-off errors. The conclusion …

    kent Download PDF for VLSI architecture for adaptive digital filtering utilising number theoretic transform (opens in a new tab)

  2. Secure Circuits: Efficient hardware countermeasures against physical side-channel attacks

    … Firstly, we introduce MBSNTT (Multi-Bit Serial Number Theoretic Transform Accelerator) to accelerate the NTT operation in Homomorphic Encryption. In this implementation, we apply processing-in-memory techniques to the NTT operation, thereby achieving high parallelism. In the second design, …

    rice Repository record for Secure Circuits: Efficient hardware countermeasures against physical side-channel attacks (opens in a new tab)

  3. Secure Hardware Constructions for Fault Detection of Lattice-based Post-quantum Cryptosystems

    … blocks of lattice-based cryptosystems, i.e., number-theoretic transform, ring polynomial multiplication, and ring learning with error are introduced. Moreover, the secure hardware architecture of post-quantum key encapsulation mechanism SABER and the signature scheme Falcon are explored. The …

    usf Repository record for Secure Hardware Constructions for Fault Detection of Lattice-based Post-quantum Cryptosystems (opens in a new tab)

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

    … first presents different architectures for the number-theoretic transform (NTT)-based polynomial multiplication, one of the crucial parts of the fundamental arithmetic for lattice-based HE and PQC schemes. Then a high-speed modular integer multiplier is proposed, particularly for lattice-based …

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

  5. On Large Polynomial Multiplication in Certain Rings

    … high degree is used in cryptography. Residue number system (RNS) helps distribute a very large integer over a set of smaller integers, which makes the computations faster. In this thesis, multiplication of polynomials in ring Z_p/(x^n + 1) where n is a power of two is analyzed using the …

    waterloo Repository record for On Large Polynomial Multiplication in Certain Rings (opens in a new tab)

  6. Pipelined-Parallel Modular Multiplication and Key-Switching Accelerators for Homomorphic Encryption

    … coefficients broken down via the Residue Number System (RNS). However, the immense computational overhead, severe memory bandwidth bottlenecks, and complex data routing constraints of these schemes hinder their practical, real-time deployment. Conventional memory-based hardware …

    umn Repository record for Pipelined-Parallel Modular Multiplication and Key-Switching Accelerators for Homomorphic Encryption (opens in a new tab)

  7. Optimizations of Large Multipliers for Integer-Based Fully Homomorphic Encryption

    … based on the frequency domain multiplier, Number Theoretic Transform (NTT). An optimisation is emphasized on NTT kernel which results in stretched NTT length; thus, to offer larger multiplier. Significant speed-up improvement is achieved with 92% faster than software. The second proposed …

    whiterose Download PDF for Optimizations of Large Multipliers for Integer-Based Fully Homomorphic Encryption (opens in a new tab)

  8. VLSI implementation of digital filters

    … In this approach the filter algorithm is first transformed into its corresponding z-domain equivalent and recursive expressions similar to single assignment codes are derived using Horner's rule or other polynomial evaluation techniques. By obtaining different recursive expressions, different …

    uvic Repository record for VLSI implementation of digital filters (opens in a new tab)

  9. On designing hardware accelerator-based systems: interfaces, taxes and benefits

    … conversion operations, are bottlenecked by number theoretic transform (NTT) operations, accelerating NTT in hardware alone is not sufficient to get enough application throughput (frame rate per second) improvement. We need to address all bottlenecks such as error sampling, encryption, and …

    bu Repository record for On designing hardware accelerator-based systems: interfaces, taxes and benefits (opens in a new tab)

  10. Algorithms and Architectures for Training-Based Channel Characterization

    … an algorithm and architecture that uses the Number Theoretic Transform (NTT) alongside finite field arithmetic to invert the circulant and skew-circulant matrices formed by training sequences in-system in real-time without a loss in precision. Alongside this, we analyze unique relationships …

    mcmaster Repository record for Algorithms and Architectures for Training-Based Channel Characterization (opens in a new tab)