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 16 of 16 for “"Finite Field Arithmetic"”.
-
Efficient finite field arithmetic with cryptographic applications
Finite field multiplication is one of the most useful arithmetic operations and has applications in many areas such as signal processing, coding theory and cryptography. However, it is also one of the most time consuming operations in both software and hardware, which makes it pertinent to develop …
-
Concurrent Error Detection in Finite Field Arithmetic Operations
… and digital signal processors usually contain finite field operations. Therefore, error detection and correction of such operations have become an important issue recently. In most of the work reported so far, error detection and correction are applied using redundancies in space (hardware), …
-
Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography
… and sufficient cryptographic strength. Finite fields are widely used in cryptography. Examples of algorithm design choices related to finite field arithmetic are the field size, which arithmetic operations to use, how to represent the field elements, etc. As there are many parameters to …
-
Efficient Hardware Constructions for Error Detection of Post-Quantum Cryptographic Schemes
… due to the complexity and large footprint of the finite field arithmetic architectures used in those architectures. In this dissertation, error detection schemes on various post-quantum cryptosystems that use finite fields are derived, proving the high efficiency and error coverage of such …
-
Hardware Obfuscation for Finite Field Algorithms
… obfuscation design through reconfigurable finite field arithmetic units, which can be employed in various error correction and cryptographic algorithms. The effectiveness and efficiency of the proposed methods are verified by an obfuscated Reformulated Inversion-less Berlekamp-Massey (RiBM) …
-
Optimization of RSA Cryptography for FPGA and ASIC Applications
… for encryption and decryption, and through non finite-field arithmetic. This thesis translates the RSA cryptosystem into the finite-field domain of arithmetic which greatly increases the range of encryption and decryption keys and replaces the MOD exponent with a multiplication. A new algorithm, …
-
The Role of Time in Cryptography: Play, Fast Forward, and Speed Up
… work are to conduct in-depth research in the field of delay-based cryptography and to improve the efficiency of evaluating ideal class group action, which serves as a building block in this area. Delay-based cryptographic primitives, such as time-lock puzzles and verifiable delay functions, …
-
Progressive product reduction for polynomial basis multiplication over GF(3m)
Galois fields are essential blocks of building many of cryptographic schemes. The main advantage of applying Galois fields over cryptographic applications are to reduce cost and increase the sufficiency of the performance. In past, they were interested in implement Galois field of characteristic 2 …
-
Σχεδιασμός κρυπτογραφικών συστημάτων δημοσίου κλειδιού
… attention is given in the optimization of finite field arithmetic operations employed in public key cryptography. The most widely used such 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 …
-
Elliptic Curve Arithmetic for Cryptography
… cryptography can be done by speeding up point arithmetic algorithms and by improving scalar multiplication algorithms. This thesis provides a speed up of some point arithmetic algorithms. The study of addition chains has been shown to be useful in improving scalar multiplication algorithms, …
-
Systolic design space exploration of EEA-based inversion over binary and ternary fields
… and its performance depends heavily on efficient finite field arithmetic hardware. Finding the multiplicative inverse (inversion) is the most expensive finite field operation in ECC. The two predominant algorithms for computing finite field inversion are Fermat’s Little Theorem (FLT) and Extended …
-
On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems
… The problems we are interested in include finite field arithmetic, primality testing, and elliptic curve arithmetic. We first present a novel idea to compute square roots over some families of finite fields. Our square root algorithm is deterministic polynomial-time and can be proved by …
-
Hardware Implementation of Barrett Reduction Exploiting Constant Multiplication
… can be improved by optimizing the underlying finite field arithmetic operations which are the most costly such as modular reduction. There are elliptic curves over prime fields for which very efficient reduction formulas are possible due to the special structure of the moduli. For prime moduli …
-
Hardware Implementations of Scalable and Unified Elliptic Curve Cryptosystem Processors
… efficient hardware for scalable and unified finite field arithmetic units that are used in the design of ECPs. In this thesis, scalability refers to the processor's ability to support multiple key sizes without the need to reconfigure the hardware. By doing so, the hardware does not need to …
-
Efficient hardware architecture for scalar multiplications on elliptic curves over prime field
… operation in all ECC based crypto-systems. Finite field arithmetic is the bottleneck in the computation of the EC scalar multiplication operation. Especially, finite field multiplication is the most time-critical operation in projective coordinates, a technique which eliminates modular …
-
Algorithms and Architectures for Training-Based Channel Characterization
… 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 between training sequences in higher-order …