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 20 of 20 for “"Prime Field"”.

  1. Fast prime field arithmetic using novel large integer representation

    … key size and this becomes a limiting factor in prime finite field GF(p) arithmetic using large integers because operations on large integers suffer from the long carry propagation problem. Large integer representation has direct impact on the efficiency of the calculations and the hardware and …

    uvic Repository record for Fast prime field arithmetic using novel large integer representation (opens in a new tab)

  2. Efficient hardware architecture for scalar multiplications on elliptic curves over prime field

    … 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 …

    dcu Download PDF for Efficient hardware architecture for scalar multiplications on elliptic curves over prime field (opens in a new tab)

  3. Implementation of SCA-Resistant CPU and an ECDLP Engine on FPGA Platform

    … concern at both software and hardware level. The field of cryptography has been intensively researched for secure implementation techniques, methods to attack secure systems and countermeasures to avoid such attacks. In this thesis, we provide solutions for two interesting problems in the field of …

    vt Repository record for Implementation of SCA-Resistant CPU and an ECDLP Engine on FPGA Platform (opens in a new tab)

  4. Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography

    … in the set of points on an elliptic curve over a prime field. Scalar multiplication of the repeated addition of a fixed point, P , in the curve. Along with the infinity point, which serves as the identity of addition and the zero of scalar multiplication, this forms a vector space over the prime …

    mcmaster Repository record for Parallel Windowed Method for Scalar Multiplication in Elliptic Curve Cryptography (opens in a new tab)

  5. Explicit and quantitative results for abelian varieties over finite fields

    Let E be an ordinary elliptic curve over a prime field Fp. Attached to E is the characteristic polynomial of the Frobenius endomorphism, T2 − a1T + p, which controls several of the invariants of E, such as the point count and the size of the isogeny class. As we base change E over extensions Fpn, …

    colostate Repository record for Explicit and quantitative results for abelian varieties over finite fields (opens in a new tab)

  6. On the Invariant Rings of Modular Bireflection Groups with Applications of Macaulay's Double Annihilator Correspondence

    … representation of a finite group G over an odd prime field k, and S = k[V], the symmetric algebra on the dual V*. Chapter 2 shows how to find the invariant ring S^G when G is an abelian unipotent two-row group. The invariant rings are complete intersections. Chapter 3 shows an algorithm that …

    kent Download PDF for On the Invariant Rings of Modular Bireflection Groups with Applications of Macaulay's Double Annihilator Correspondence (opens in a new tab)

  7. Invariants of Modular Two-Row Groups

    … this conjecture in the case where the ground field is the prime field $\mathbb{F}_p$. We prove that all Abelian reflection two-row $p$-groups have complete intersection invariant rings. We show that all two-row groups with \textit{non-normal} Sylow $p$-subgroups have polynomial invariant …

    queens Repository record for Invariants of Modular Two-Row Groups (opens in a new tab)

  8. Counting isogeny classes of Drinfeld modules over finite fields via Frobenius distributions

    … polarized abelian variety -- over a finite field is given by a suitable class number. Gekeler expressed the size of an isogeny class of an elliptic curve over a prime field in terms of a product over all primes of local density functions. These local density functions are what one might …

    colostate Repository record for Counting isogeny classes of Drinfeld modules over finite fields via Frobenius distributions (opens in a new tab)

  9. A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences

    … this necessary condition to prove that if p is a prime congruent to 3 modulo 4, the multiplier group of an SLCE almost difference set over the prime field of order p must be trivial. Consequently, we obtain families of shift-inequivalent decimations of SLCE sequences.We also consider the problem …

    carleton Repository record for A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences (opens in a new tab)

  10. The Discrete Logarithm Problem in Finite Fields of Small Characteristic

    … public-key cryptosystems. In the case of finite fields of small characteristic, however, there has been tremendous progress recently, by which the complexity of the discrete logarithm problem (DLP) is considerably reduced. This habilitation thesis on the DLP in such fields deals with two …

    qucosa-diss

  11. A model-theoretic approach to the arithmetic of global fields

    <p>This thesis assembles some new results in the field arithmetic of various classes of fields, including global fields, models of the common first-order theory of algebraic extensions of global fields, and fields of finite transcendence degree over their prime field. Most of the results stem from …

    oxford Repository record for A model-theoretic approach to the arithmetic of global fields (opens in a new tab)

  12. Relative Springer isomorphisms and the conjugacy classes in Sylow p-subgroups of Chevalley groups

    … algebraic group over the algebraically closed field \(k\). Assume \(p\) = char \(k\) > 0 is good for \(G\) and that \(G\) is defined and split over the prime field \(\char{bbold10}{0x46}_p\). For a power \(q\) of \(p\), we write \(G(q)\) for the Chevalley group consisting of the …

    birmingham Download PDF for Relative Springer isomorphisms and the conjugacy classes in Sylow p-subgroups of Chevalley groups (opens in a new tab)

  13. Hardware Implementation of Barrett Reduction Exploiting Constant Multiplication

    … 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 of …

    waterloo Repository record for Hardware Implementation of Barrett Reduction Exploiting Constant Multiplication (opens in a new tab)

  14. Hardware Implementations of the WG-16 Stream Cipher with Composite Field Arithmetic

    … cipher. Five different representations of the field elements were analyzed, namely the polynomial basis representation, the normal basis representation and three isomorphic tower field constructions of F216: F(((22)2)2)2, F(24)4 and F(28)2. Each design option begins with an in-depth description …

    waterloo Repository record for Hardware Implementations of the WG-16 Stream Cipher with Composite Field Arithmetic (opens in a new tab)

  15. Energy-harvested Lightweight Cryptosystems

    … for 80-bit and 128-bit security-levels, for prime field curves secp160r1 and nistp256. Our results show that energy cost per authentication is minimized if a microcontroller is operated at the maximum possible frequency. This is because the energy consumed by leakage (i.e., static power …

    vt Repository record for Energy-harvested Lightweight Cryptosystems (opens in a new tab)

  16. Elliptic Curve Cryptography on Heterogeneous Multicore Platform

    Elliptic curve cryptography (ECC) is becoming the algorithm of choice for digital signature generation and authentication in embedded context. However, performance of ECC and the underlying modular arithmetic on embedded processors remains a concern. At the same time, more complex system-on-chip …

    vt Repository record for Elliptic Curve Cryptography on Heterogeneous Multicore Platform (opens in a new tab)

  17. Radical theory in categorical settings

    … is a twenty-one dimensional Lie algebra over the prime field of characteristic three. The motivation for this example comes from an example of Jacobson in "Lie Algebras", [3], With this example our treatment of the general properties of rings as found in Divinsky is complete, for we have been able …

    ubc Repository record for Radical theory in categorical settings (opens in a new tab) Download PDF for Radical theory in categorical settings (opens in a new tab)

  18. An Authenticated Key Agreement Scheme for Sensor Networks

    … the node's public keys operating over a small prime field, and then stored in a random order in the node. If these are captured, the private keys cannot be used directly as the adversary would first have to discover the PPMka. The analysis showed that, with suitable keying parameters, even if …

    auckland-tech Repository record for An Authenticated Key Agreement Scheme for Sensor Networks (opens in a new tab)

  19. Principal rank characteristic sequences

    … that are attainable by symmetric matrices over fields of characteristic $2$ are considered:</p> <p>For the prime field of order $2$, a complete characterization of these epr-sequences is obtained;</p> <p>and for more general fields of characteristic $2$, some restrictions are also obtained.</p> …

    iastate Repository record for Principal rank characteristic sequences (opens in a new tab)

  20. Design Methods for Cryptanalysis

    Security of cryptographic algorithms relies on the computational difficulty of deriving the secret key using public information. Cryptanalysis, including logical and implementation attacks, plays an important role in allowing the security community to estimate their cost, based on the computational …

    vt Repository record for Design Methods for Cryptanalysis (opens in a new tab)