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 17 of 17 for “"Polynomial Multiplication"”.

  1. Polynomial Multiplication for Post-Quantum Cryptography

    … perspective. The focus of this thesis lies on polynomial multiplication which is at the core of most post-quantum cryptography based on hard lattice problems. The first part covers cryptographic schemes specifically designed to benefit from a particular polynomial multiplication technique: …

    radboud Repository record for Polynomial Multiplication for Post-Quantum Cryptography (opens in a new tab) Download PDF for Polynomial Multiplication for Post-Quantum Cryptography (opens in a new tab)

  2. On Large Polynomial Multiplication in Certain Rings

    Multiplication of polynomials with large integer coefficients and very 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 …

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

  3. On Efficient Polynomial Multiplication and Its Impact on Curve based Cryptosystems

    … curve and pairing based cryptography. Polynomial multiplication is used in the underlying operations of these protocols. Therefore, as part of this thesis different recursive algorithms are studied; these algorithms include Karatsuba, Toom, and Bernstein. In this thesis, we investigate …

    waterloo Repository record for On Efficient Polynomial Multiplication and Its Impact on Curve based Cryptosystems (opens in a new tab)

  4. Applications of Multiplicative Complexity Theory to Convolution and the Discrete Fourier Transform (Fast, Computational, Digital Filtering, Signal Processing, Algorithms)

    … results on the multiplicative complexity of polynomial multiplication, products in extension fields, multivariate polynomial multiplication, and multiple products in the same extension field with one or more fixed polynomials. In addition, new results are obtained for the multiplicative …

    rice Repository record for Applications of Multiplicative Complexity Theory to Convolution and the Discrete Fourier Transform (Fast, Computational, Digital Filtering, Signal Processing, Algorithms) (opens in a new tab)

  5. Software Implementations of Polynomial Multiplications for Lattice-Based Cryptosystems

    This thesis studies the implementation aspects of polynomial multiplication in lattice-based cryptosystems Dilithium, Kyber, Saber, NTRU, and NTRU Prime. As hardware gradually evolves and enormous platforms are in use nowadays, systematic surveys and studies with numerical justification of the …

    radboud Repository record for Software Implementations of Polynomial Multiplications for Lattice-Based Cryptosystems (opens in a new tab) Download PDF for Software Implementations of Polynomial Multiplications for Lattice-Based Cryptosystems (opens in a new tab)

  6. FPGA Implementation and Optimization of Bit Flipping Key Generation Algorithm for Post Quantum Cryptography in Embedded Systems Applications

    … 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 implementation of BIKE on the Artix-7 FPGA, designed for …

    houston Repository record for FPGA Implementation and Optimization of Bit Flipping Key Generation Algorithm for Post Quantum Cryptography in Embedded Systems Applications (opens in a new tab) Embargoed until 2027-05-01

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

    … 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 cryptography. In addition, a novel …

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

  8. Design of a Flexible Schoenhage-Strassen FFT Polynomial Multiplier with High-Level Synthesis

    … operations such as high precision, high degree polynomial multiplication resulting in a minimum computational complexity of O(n log(n)) on standard CPUs though application of the Fast Fourier Transform (FFT). These operations result in poor overall performance for HE schemes in software and …

    rit Repository record for Design of a Flexible Schoenhage-Strassen FFT Polynomial Multiplier with High-Level Synthesis (opens in a new tab)

  9. Accelerating Homomorphic Encryption in the Cloud Environment through High-Level Synthesis and Reconfigurable Resources

    … software implementation of Karatsuba modular polynomial multiplication. This implementation was designed to be used with High-Level Synthesis to accelerate the large modular polynomial multiplication operations required by homomorphic encryption. The accelerator generated from this …

    rit Repository record for Accelerating Homomorphic Encryption in the Cloud Environment through High-Level Synthesis and Reconfigurable Resources (opens in a new tab)

  10. Efficient Binary Field Multiplication on a VLIW DSP

    … cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities to optimize this operation in a heterogeneous multiprocessing platform such as TI OMAP3530. By migrating the long operand modular multiplication from a general-purpose ARM Cortex A8 …

    vt Repository record for Efficient Binary Field Multiplication on a VLIW DSP (opens in a new tab)

  11. Secure Hardware Constructions for Fault Detection of Lattice-based Post-quantum 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 proposed architectures can also …

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

  12. Fast Fourier Transform Algorithms with Applications

    … that can be used to quickly evaluate a polynomial over a collection of points and interpolate these evaluations back into a polynomial. Engineers define the 'Fast Fourier Transform' as a method of solving the interpolation problem where the coefficient ring used to construct the …

    clemson Repository record for Fast Fourier Transform Algorithms with Applications (opens in a new tab)

  13. Issues in Implementation of Public Key Cryptosystems

    A new class of moduli called the low-weight polynomial form integers (LWPFIs) is introduced. LWPFIs are expressed in a low-weight, monic polynomial form, <em>p</em> = <em>f</em>(<em>t</em>). While the generalized Mersenne numbers (GMNs) proposed by Solinas allow only powers of two for <em>t</em>, …

    waterloo Repository record for Issues in Implementation of Public Key Cryptosystems (opens in a new tab)

  14. Weight Enumerators and Weight Distribution of KM Codes

    … complexity problem of multiplying two polynomials together, as this relates directly to a particular type of bilinear form and the main theorem linking codes and bilinear forms (Theorem 3.11) can then be invoked. We review work done by Winograd, Hopcroft and Musinski and Fiduccia on the …

    glasgow Download PDF for Weight Enumerators and Weight Distribution of KM Codes (opens in a new tab)

  15. Cryptanalysis and Secure Implementation of Modern Cryptographic Algorithms

    … is upper bounded by $t$, it requires $O((pN)^t)$ polynomial inversions in $\mathbb Z/p\mathbb Z[x]/(x^{N}-1)$. We also investigate several techniques to strengthen hardware implementations of NTRUEncrypt against this class of attacks. For NTRUSign with parameters ($N$, $q=p^l$, $\mathcal{B}$, …

    concordia Download PDF for Cryptanalysis and Secure Implementation of Modern Cryptographic Algorithms (opens in a new tab)

  16. Systolic design space exploration of EEA-based inversion over binary and ternary fields

    … particularly for modular division. Whereas, polynomial arithmetic operations over GF(pm) are discussed adequately in order to examine the potential for processes concurrency. In particular, polynomial division and multiplication are revisited in order to derive their iterative equations, …

    uvic Repository record for Systolic design space exploration of EEA-based inversion over binary and ternary fields (opens in a new tab)