• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 50
  • 6
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 58
  • 58
  • 32
  • 12
  • 10
  • 9
  • 9
  • 8
  • 8
  • 8
  • 8
  • 7
  • 7
  • 7
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Genus 2 curves in pairing-based cryptography and the minimal embedding field

Hitt, Laura Michelle, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
12

Counting points on elliptic curves over Zp /

Sundriyal, Suresh. January 2008 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. The p in the title is subscript. Includes bibliographical references (leaves 57-58).
13

Frequency domain finite field arithmetic for elliptic curve cryptography

Baktir, Selcuk. January 2008 (has links)
Thesis (Ph.D.)--Worcester Polytechnic Institute. / Keywords: discrete fourier transform; ECC; elliptic curve cryptography; inversion; finite fields; multiplication; DFT; number theoretic transform; NTT. Includes bibliographical references (leaves 78-85).
14

The average complexity of the Euclidean algorithm and hyperelliptic cryptography /

Savard, Stephen, January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2003. / Includes bibliographical references (p. 62-63). Also available in electronic format on the Internet.
15

Implementing efficient 384-bit NIST elliptic curves over prime fields on an ARM946E /

VanAmeron, Tracy. January 2008 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. Supplemental CD-ROM includes a Word document copy of the thesis and PDF copies of some of the references used. Includes bibliographical references (leaves 41-42).
16

Efficient and tamper-resilient architectures for pairing based cryptography

Ozturk, Erdinc. January 2009 (has links)
Dissertation (Ph.D.)--Worcester Polytechnic Institute. / Keywords: Pairing Based Cryptography; Identity Based Cryptography; Tate Pairing; Montgomery Multiplication; Robust Codes; Fault Detection; Tamper-Resilient Architecture. Includes bibliographical references (leaves 97-104).
17

Iwasawa theory for elliptic curves with cyclic isogenies /

Nichifor, Alexandra. January 2004 (has links)
Thesis (Ph. D.)--University of Washington, 2004. / Vita. Includes bibliographical references (p. 55-56).
18

Die Rankinsche L-Funktion und Heegner-Punkte für allgemeine Diskriminanten

Hayashi, Yoshiki. January 1994 (has links)
Thesis (doctoral)--Universität Bonn, 1993. / Includes bibliographical references (p. 155-157).
19

Integral solutions in arithmetic progression for elliptic curves.

Lee, June-Bok. January 1991 (has links)
Integral solutions to y² = X³ + k, where either the x's or the y's, or both, are in arithmetic progression are studied. When both the x's and the y's are in arithmetic progression, then this situation is completely solved. One set of solutions where the y's formed an arithmetic progression of length 4 have already been constructed. In this dissertation, we construct infinitely many set of solutions where there are 4 x's in arithmetic progression and we also disprove Mohanty's Conjecture[8] by constructing infinitely many set of solutions where there are 4, 5 and 6 y's in arithmetic progression.
20

Selmer groups of elliptic curves and Galois representations

Brau, Julio January 2015 (has links)
No description available.

Page generated in 0.0381 seconds