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 6 of 6 for “"binary extension"”.
-
High Performance Elliptic Curve Cryptographic Co-processor
… Of the ten recommended finite fields, five are binary extension fields with degrees ranging from 163 to 571. The fundamental building block of the ECDSA, like any ECC based protocol, is elliptic curve scalar multiplication. This operation is also the most computationally intensive. In many …
-
Reconfigurable elliptic curve cryptography
… requirements. The mathematics involved uses binary extension field of the form GF (2n) as the underlying field and polynomial basis for the representation of the elements in the field. A significant gain in performance is obtained by using projective coordinates for the points on the curve …
-
Σχεδιασμός κρυπτογραφικών συστημάτων δημοσίου κλειδιού
… fields are the prime fields or GF(p) and the binary extension fields or GF(2ᵏ). Concerning GF(p) arithmetic an optimized version of Montgomery modulo multiplication algorithm is proposed for performing modular multiplication that employs Carry Save redundant logic and value precomputation. The …
-
RESOURCE EFFICIENT DESIGN OF QUANTUM CIRCUITS FOR CRYPTANALYSIS AND SCIENTIFIC COMPUTING APPLICATIONS
… circuits for squaring and exponentiation over binary extension fields (Galois fields of form GF(2 m )). The proposed circuits are shown to have lower depth, qubit and gate cost to existing work. We also present quantum circuits for the core operations of multiplication and division which enjoy …
-
Zpřístupnění funkcí CLIPS z jazyka Ruby
Tato práce popisuje knihovnu rbClips, která zpřístup\v{n}uje funkce CLIPS v jazyce Ruby. CLIPS je software pro tvorbu expertních systémů původně vyvinutý v NASA na začátku 90. let. Nástroj je napsán v jazyce C a jeho uživatelské rozhraní je velice podobné jazyku Lisp. Ruby je moderní dynamický …
-
Accelerating Post-Quantum Secure zkSNARKs and Privacy-Preserving Frameworks
… post-quantum secure zkSNARKs operating over binary extension fields. By adopting this basis, the additive fast Fourier transform (FFT) algorithm employed in Aurora (Ben-Sasson et al., 2019), a plausible post-quantum secure zkSNARK, is optimized by replacing the previously utilized Gao-Mateer …