Off-campus SJSU users: To download campus access theses, please use the following link to log into our proxy server with your SJSU library user name and PIN.
Thesis - Campus Access Only
Master of Science (MS)
cryptography, galois field airthmetic, modular arithmetic, Mongtomery, Post-Quantum Cryptography, reduction-free
Cryptography requires working with finite fields and related structures in which the fundamental arithmetic operations are carried out without error. With respect to multiplication, the complexity varies significantly based on the mathematical structure and defining polynomial. When considering fields and rings, multiplication entails a multiplication step and a reduction step. In this work we present a fully interleaved reduction-free modular multiplier over GF(2n) that interleaves Karatsuba-Ofman polynomial multiplication with bipartite reduction. The multiplier works with elements in polynomial rings and finite fields and is applicable to cryptographic schemes in the modern and post-quantum regimes, especially elliptic curve cryptography (ECC). Moreover, it is more efficient in software than its counterparts and allows for a high level of parallelism in hardware.
Oliva Madrigal, Samira Carolina, "Reduction-free Multiplication in GF(2n) Applicable to Modern and Post-quantum Cryptographic Schemes" (2019). Master's Theses. 5074.