Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:( Elliptic Curve Cryptography)`

.
Showing records 1 – 30 of
4122 total matches.

◁ [1] [2] [3] [4] [5] … [138] ▶

Search Limiters

Dates

- 2015 – 2019 (1409)
- 2010 – 2014 (1672)
- 2005 – 2009 (848)
- 2000 – 2004 (243)
- 1995 – 1999 (76)
- 1990 – 1994 (45)
- 1985 – 1989 (23)
- 1980 – 1984 (20)
- 1975 – 1979 (20)
- 1970 – 1974 (10)

Universities

- Brno University of Technology (387)
- University of São Paulo (112)
- University of Waterloo (108)
- NSYSU (99)
- ETH Zürich (67)
- Rochester Institute of Technology (57)
- Virginia Tech (54)
- Texas A&M University (50)
- Georgia Tech (45)
- Universidade do Rio Grande do Sul (41)
- University of Illinois – Urbana-Champaign (39)
- Pontifical Catholic University of Rio de Janeiro (38)
- KTH (37)
- National University of Singapore (35)
- University of Florida (35)

Department

- Mathematics (131)
- Informatique (99)
- Electrical and Computer Engineering (61)
- Computer Science (58)
- Electrical Engineering (44)
- Economics (38)
- Mathématiques (35)
- Computer Science and Engineering (32)
- Mechanical Engineering (31)
- Mathematics and Statistics (29)
- Civil Engineering (27)
- Applied Mathematics (23)
- Physics (23)
- Mechanical and Electro-Mechanical Engineering (21)
- Computer Engineering (20)

Degrees

Languages

Country

- US (1196)
- Czech Republic (389)
- Brazil (346)
- Canada (323)
- France (317)
- Sweden (202)
- Greece (165)
- Australia (130)
- UK (106)
- Taiwan (99)
- Switzerland (93)
- India (86)
- Netherlands (86)
- South Africa (67)
- Japan (64)

▼ Search Limiters

University of Waikato

1.
Abdullah, Kamilah.
Comparison between the RSA cryptosystem and *elliptic* *curve* * cryptography*
.

Degree: 2010, University of Waikato

URL: http://hdl.handle.net/10289/4273

► In the globalization era, *cryptography* becomes more popular and powerful; in fact it is very important in many areas (i.e. mathematics, computer science, networks, etc).…
(more)

Subjects/Keywords: Cryptography; RSA cryptosystem; elliptic curve cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Abdullah, K. (2010). Comparison between the RSA cryptosystem and elliptic curve cryptography . (Masters Thesis). University of Waikato. Retrieved from http://hdl.handle.net/10289/4273

Chicago Manual of Style (16^{th} Edition):

Abdullah, Kamilah. “Comparison between the RSA cryptosystem and elliptic curve cryptography .” 2010. Masters Thesis, University of Waikato. Accessed October 18, 2019. http://hdl.handle.net/10289/4273.

MLA Handbook (7^{th} Edition):

Abdullah, Kamilah. “Comparison between the RSA cryptosystem and elliptic curve cryptography .” 2010. Web. 18 Oct 2019.

Vancouver:

Abdullah K. Comparison between the RSA cryptosystem and elliptic curve cryptography . [Internet] [Masters thesis]. University of Waikato; 2010. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10289/4273.

Council of Science Editors:

Abdullah K. Comparison between the RSA cryptosystem and elliptic curve cryptography . [Masters Thesis]. University of Waikato; 2010. Available from: http://hdl.handle.net/10289/4273

University of Waterloo

2.
Ismail, Marwa Nabil.
Towards Efficient Hardware Implementation of *Elliptic* and Hyperelliptic *Curve* * Cryptography*.

Degree: 2012, University of Waterloo

URL: http://hdl.handle.net/10012/6833

► Implementation of *elliptic* and hyperelliptic *curve* cryptographic algorithms has been the focus of a great deal of recent research directed at increasing efficiency. *Elliptic* *curve*…
(more)

Subjects/Keywords: Elliptic Curve Cryptography; Hyperelliptic Curve Cryptography; Hardware Implementation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ismail, M. N. (2012). Towards Efficient Hardware Implementation of Elliptic and Hyperelliptic Curve Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6833

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ismail, Marwa Nabil. “Towards Efficient Hardware Implementation of Elliptic and Hyperelliptic Curve Cryptography.” 2012. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/6833.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ismail, Marwa Nabil. “Towards Efficient Hardware Implementation of Elliptic and Hyperelliptic Curve Cryptography.” 2012. Web. 18 Oct 2019.

Vancouver:

Ismail MN. Towards Efficient Hardware Implementation of Elliptic and Hyperelliptic Curve Cryptography. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/6833.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ismail MN. Towards Efficient Hardware Implementation of Elliptic and Hyperelliptic Curve Cryptography. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6833

Not specified: Masters Thesis or Doctoral Dissertation

University of Washington

3.
Scholl, Travis.
Abelian Varieties with Small Isogeny Class and Applications to * Cryptography*.

Degree: PhD, 2018, University of Washington

URL: http://hdl.handle.net/1773/42458

► An *elliptic* *curve* E over a finite field \FF_{q} is called isolated if it admits few efficiently computable \FF_{q}-isogenies from E to a non-isomorphic *curve*.…
(more)

Subjects/Keywords: abelian varieties; elliptic curve cryptography; Mathematics; Mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Scholl, T. (2018). Abelian Varieties with Small Isogeny Class and Applications to Cryptography. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/42458

Chicago Manual of Style (16^{th} Edition):

Scholl, Travis. “Abelian Varieties with Small Isogeny Class and Applications to Cryptography.” 2018. Doctoral Dissertation, University of Washington. Accessed October 18, 2019. http://hdl.handle.net/1773/42458.

MLA Handbook (7^{th} Edition):

Scholl, Travis. “Abelian Varieties with Small Isogeny Class and Applications to Cryptography.” 2018. Web. 18 Oct 2019.

Vancouver:

Scholl T. Abelian Varieties with Small Isogeny Class and Applications to Cryptography. [Internet] [Doctoral dissertation]. University of Washington; 2018. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1773/42458.

Council of Science Editors:

Scholl T. Abelian Varieties with Small Isogeny Class and Applications to Cryptography. [Doctoral Dissertation]. University of Washington; 2018. Available from: http://hdl.handle.net/1773/42458

Dublin City University

4.
Javeed, Khalid.
Efficient hardware architecture for scalar multiplications on *elliptic* curves over prime field.

Degree: School of Electronic Engineering; Dublin City University. Research Institute for Networks and Communications Engineering (RINCE), 2016, Dublin City University

URL: http://doras.dcu.ie/21377/

► Suitable cryptographic protocols are required to meet the growing demands for data security in many different systems, ranging from large servers to small hand-held devices.…
(more)

Subjects/Keywords: Electronic engineering; Elliptic curve cryptography; ECC

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Javeed, K. (2016). Efficient hardware architecture for scalar multiplications on elliptic curves over prime field. (Thesis). Dublin City University. Retrieved from http://doras.dcu.ie/21377/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Javeed, Khalid. “Efficient hardware architecture for scalar multiplications on elliptic curves over prime field.” 2016. Thesis, Dublin City University. Accessed October 18, 2019. http://doras.dcu.ie/21377/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Javeed, Khalid. “Efficient hardware architecture for scalar multiplications on elliptic curves over prime field.” 2016. Web. 18 Oct 2019.

Vancouver:

Javeed K. Efficient hardware architecture for scalar multiplications on elliptic curves over prime field. [Internet] [Thesis]. Dublin City University; 2016. [cited 2019 Oct 18]. Available from: http://doras.dcu.ie/21377/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Javeed K. Efficient hardware architecture for scalar multiplications on elliptic curves over prime field. [Thesis]. Dublin City University; 2016. Available from: http://doras.dcu.ie/21377/

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

5. Leonardi, Christopher. Key Compression for Isogeny-Based Cryptosystems.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/10387

► We present a method for key compression in quantum-resistant isogeny-based cryptosystems, which reduces storage and transmission costs of per-party public information by a factor of…
(more)

Subjects/Keywords: Cryptography; Elliptic Curve; Isogeny; Key Compression

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Leonardi, C. (2016). Key Compression for Isogeny-Based Cryptosystems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10387

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Leonardi, Christopher. “Key Compression for Isogeny-Based Cryptosystems.” 2016. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/10387.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Leonardi, Christopher. “Key Compression for Isogeny-Based Cryptosystems.” 2016. Web. 18 Oct 2019.

Vancouver:

Leonardi C. Key Compression for Isogeny-Based Cryptosystems. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/10387.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leonardi C. Key Compression for Isogeny-Based Cryptosystems. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10387

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

6. Musleh, Yossef. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13889

► This thesis introduces a new Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic algorithm…
(more)

Subjects/Keywords: Drinfeld; Module; Elliptic; Curve; Cryptography; Algorithm; Randomized

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Musleh, Y. (2018). Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Web. 18 Oct 2019.

Vancouver:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

7. Głuszek, Gregory. Optimizing scalar multiplication for koblitz curves using hybrid FPGAs.

Degree: Computer Engineering, 2009, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/3203

► *Elliptic* *curve* *cryptography* (ECC) is a type of public-key cryptosystem which uses the additive group of points on a nonsingular *elliptic* *curve* as a…
(more)

Subjects/Keywords: Elliptic curve cryptography; Hybrid FPGA; Koblitz curves

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Głuszek, G. (2009). Optimizing scalar multiplication for koblitz curves using hybrid FPGAs. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/3203

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Głuszek, Gregory. “Optimizing scalar multiplication for koblitz curves using hybrid FPGAs.” 2009. Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/3203.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Głuszek, Gregory. “Optimizing scalar multiplication for koblitz curves using hybrid FPGAs.” 2009. Web. 18 Oct 2019.

Vancouver:

Głuszek G. Optimizing scalar multiplication for koblitz curves using hybrid FPGAs. [Internet] [Thesis]. Rochester Institute of Technology; 2009. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/3203.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Głuszek G. Optimizing scalar multiplication for koblitz curves using hybrid FPGAs. [Thesis]. Rochester Institute of Technology; 2009. Available from: https://scholarworks.rit.edu/theses/3203

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

8. LeGrow, Jason. Post-Quantum Security of Authenticated Key Establishment Protocols.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/10386

► We present a security model for authenticated key establishment that allows for quantum interactions between the adversary and quantum oracles that emulate classical parties, resulting…
(more)

Subjects/Keywords: Cryptography; Key Establishment; Elliptic Curve Cryptography; Post-Quantum Cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

LeGrow, J. (2016). Post-Quantum Security of Authenticated Key Establishment Protocols. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10386

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

LeGrow, Jason. “Post-Quantum Security of Authenticated Key Establishment Protocols.” 2016. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/10386.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

LeGrow, Jason. “Post-Quantum Security of Authenticated Key Establishment Protocols.” 2016. Web. 18 Oct 2019.

Vancouver:

LeGrow J. Post-Quantum Security of Authenticated Key Establishment Protocols. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/10386.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

LeGrow J. Post-Quantum Security of Authenticated Key Establishment Protocols. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10386

Not specified: Masters Thesis or Doctoral Dissertation

San Jose State University

9.
Vazquez, Senorina Ramos.
* Elliptic* Curves and

Degree: MS, Mathematics, 2010, San Jose State University

URL: https://doi.org/10.31979/etd.6fat-tnvm ; https://scholarworks.sjsu.edu/etd_theses/3794

► In this expository thesis we study *elliptic* curves and their role in *cryptography*. In doing so we examine an intersection of linear algebra, abstract…
(more)

Subjects/Keywords: Cryptography; Elliptic Curves; Group of an Elliptic Curve

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Vazquez, S. R. (2010). Elliptic Curves and Cryptography. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.6fat-tnvm ; https://scholarworks.sjsu.edu/etd_theses/3794

Chicago Manual of Style (16^{th} Edition):

Vazquez, Senorina Ramos. “Elliptic Curves and Cryptography.” 2010. Masters Thesis, San Jose State University. Accessed October 18, 2019. https://doi.org/10.31979/etd.6fat-tnvm ; https://scholarworks.sjsu.edu/etd_theses/3794.

MLA Handbook (7^{th} Edition):

Vazquez, Senorina Ramos. “Elliptic Curves and Cryptography.” 2010. Web. 18 Oct 2019.

Vancouver:

Vazquez SR. Elliptic Curves and Cryptography. [Internet] [Masters thesis]. San Jose State University; 2010. [cited 2019 Oct 18]. Available from: https://doi.org/10.31979/etd.6fat-tnvm ; https://scholarworks.sjsu.edu/etd_theses/3794.

Council of Science Editors:

Vazquez SR. Elliptic Curves and Cryptography. [Masters Thesis]. San Jose State University; 2010. Available from: https://doi.org/10.31979/etd.6fat-tnvm ; https://scholarworks.sjsu.edu/etd_theses/3794

Anna University

10.
Maria celestin vigila S.
Study and analysis of data security using *elliptic* *curve*
*cryptography* over prime field;.

Degree: Data security using elliptic curve cryptography over prime field, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/22907

►

The all pervading nature of communication networks has paved the way for the development of wireless and internet applications making communication possible all over the… (more)

Subjects/Keywords: Cryptography; Data security; Elliptic curve cryptography; Information and communication engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

S, M. c. v. (2014). Study and analysis of data security using elliptic curve cryptography over prime field;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22907

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

S, Maria celestin vigila. “Study and analysis of data security using elliptic curve cryptography over prime field;.” 2014. Thesis, Anna University. Accessed October 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/22907.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

S, Maria celestin vigila. “Study and analysis of data security using elliptic curve cryptography over prime field;.” 2014. Web. 18 Oct 2019.

Vancouver:

S Mcv. Study and analysis of data security using elliptic curve cryptography over prime field;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22907.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

S Mcv. Study and analysis of data security using elliptic curve cryptography over prime field;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22907

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

11.
Longa, Patrick.
High-Speed *Elliptic* *Curve* and Pairing-Based * Cryptography*.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/5857

► *Elliptic* *Curve* *Cryptography* (ECC), independently proposed by Miller [Mil86] and Koblitz [Kob87] in mid 80’s, is finding momentum to consolidate its status as the public-key…
(more)

Subjects/Keywords: Elliptic curve cryptography; Pairing-based cryptography; Efficient implementation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Longa, P. (2011). High-Speed Elliptic Curve and Pairing-Based Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5857

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Longa, Patrick. “High-Speed Elliptic Curve and Pairing-Based Cryptography.” 2011. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/5857.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Longa, Patrick. “High-Speed Elliptic Curve and Pairing-Based Cryptography.” 2011. Web. 18 Oct 2019.

Vancouver:

Longa P. High-Speed Elliptic Curve and Pairing-Based Cryptography. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/5857.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Longa P. High-Speed Elliptic Curve and Pairing-Based Cryptography. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5857

Not specified: Masters Thesis or Doctoral Dissertation

12.
Ridgdill, Penny Catherine.
On the Frequency of Finitely Anomalous *Elliptic* Curves.

Degree: PhD, Mathematics, 2010, U of Massachusetts : PhD

URL: https://scholarworks.umass.edu/open_access_dissertations/238

► Given an *elliptic* *curve* E over Q, we can then consider E over the finite field Fp. If Np is the number of points on…
(more)

Subjects/Keywords: Anomalous Primes; Elliptic Curve Cryptography; Elliptic Curves; Galois Representations; Number Theory; Mathematics; Statistics and Probability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ridgdill, P. C. (2010). On the Frequency of Finitely Anomalous Elliptic Curves. (Doctoral Dissertation). U of Massachusetts : PhD. Retrieved from https://scholarworks.umass.edu/open_access_dissertations/238

Chicago Manual of Style (16^{th} Edition):

Ridgdill, Penny Catherine. “On the Frequency of Finitely Anomalous Elliptic Curves.” 2010. Doctoral Dissertation, U of Massachusetts : PhD. Accessed October 18, 2019. https://scholarworks.umass.edu/open_access_dissertations/238.

MLA Handbook (7^{th} Edition):

Ridgdill, Penny Catherine. “On the Frequency of Finitely Anomalous Elliptic Curves.” 2010. Web. 18 Oct 2019.

Vancouver:

Ridgdill PC. On the Frequency of Finitely Anomalous Elliptic Curves. [Internet] [Doctoral dissertation]. U of Massachusetts : PhD; 2010. [cited 2019 Oct 18]. Available from: https://scholarworks.umass.edu/open_access_dissertations/238.

Council of Science Editors:

Ridgdill PC. On the Frequency of Finitely Anomalous Elliptic Curves. [Doctoral Dissertation]. U of Massachusetts : PhD; 2010. Available from: https://scholarworks.umass.edu/open_access_dissertations/238

13.
Lester, Jeremy W.
The *Elliptic* *Curve* Group Over Finite Fields: Applications in
* Cryptography*.

Degree: MSin Mathematics, Department of Mathematics and Statistics, 2012, Youngstown State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698

► It is the intent of this thesis to study the mathematics, and applications behind the *elliptic* *curve* group over Fp. Beginning with the definition of…
(more)

Subjects/Keywords: Elliptic Curve Group; Cryptography

…*elliptic* *curve* *cryptography* lies in what’s called a ”trap door func-
tion”. A trap door function… …*elliptic* *curve* E. Define the lines
l1 = P, Q,
l2 = ∞, Q + R,
l3 = R, P + Q
m1 = Q, R,
m2… …with E; R, (P + Q) and X. By the
denition of *elliptic* *curve* addition we have
X… …associativity holds as above.
Lemma 2.1. Let P1 , P2 be points on an *elliptic* *curve*. Then
(P1… …*elliptic* *curve* again at −(P1 + P2 ). So
to calculate −(P1 + P2 ) + P2 we…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lester, J. W. (2012). The Elliptic Curve Group Over Finite Fields: Applications in Cryptography. (Masters Thesis). Youngstown State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698

Chicago Manual of Style (16^{th} Edition):

Lester, Jeremy W. “The Elliptic Curve Group Over Finite Fields: Applications in Cryptography.” 2012. Masters Thesis, Youngstown State University. Accessed October 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698.

MLA Handbook (7^{th} Edition):

Lester, Jeremy W. “The Elliptic Curve Group Over Finite Fields: Applications in Cryptography.” 2012. Web. 18 Oct 2019.

Vancouver:

Lester JW. The Elliptic Curve Group Over Finite Fields: Applications in Cryptography. [Internet] [Masters thesis]. Youngstown State University; 2012. [cited 2019 Oct 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698.

Council of Science Editors:

Lester JW. The Elliptic Curve Group Over Finite Fields: Applications in Cryptography. [Masters Thesis]. Youngstown State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1348847698

Virginia Tech

14. Gaddam, Shravya. Design and Implementation of PUF Based Protocols for Remote Integrity Verification.

Degree: MS, Electrical and Computer Engineering, 2016, Virginia Tech

URL: http://hdl.handle.net/10919/71865

► In recent years, there has been a drastic increase in the prevalence of counterfeiting within the electronics supply chain. At the same time, high-end commercial…
(more)

Subjects/Keywords: Physical Unclonable Functions; ECDSA; Elliptic Curve Cryptography; Fuzzy Extraction; Strong Extraction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gaddam, S. (2016). Design and Implementation of PUF Based Protocols for Remote Integrity Verification. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/71865

Chicago Manual of Style (16^{th} Edition):

Gaddam, Shravya. “Design and Implementation of PUF Based Protocols for Remote Integrity Verification.” 2016. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/71865.

MLA Handbook (7^{th} Edition):

Gaddam, Shravya. “Design and Implementation of PUF Based Protocols for Remote Integrity Verification.” 2016. Web. 18 Oct 2019.

Vancouver:

Gaddam S. Design and Implementation of PUF Based Protocols for Remote Integrity Verification. [Internet] [Masters thesis]. Virginia Tech; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/71865.

Council of Science Editors:

Gaddam S. Design and Implementation of PUF Based Protocols for Remote Integrity Verification. [Masters Thesis]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/71865

Virginia Tech

15.
McGee, John J.
RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an *Elliptic* *Curve* over a Finite Field.

Degree: MS, Mathematics, 2006, Virginia Tech

URL: http://hdl.handle.net/10919/31911

► *Elliptic* curves have a rich mathematical history dating back to Diophantus (c. 250 C.E.), who used a form of these cubic equations to find right…
(more)

Subjects/Keywords: Elliptic Curve; Schoof; Cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

McGee, J. J. (2006). RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31911

Chicago Manual of Style (16^{th} Edition):

McGee, John J. “RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field.” 2006. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/31911.

MLA Handbook (7^{th} Edition):

McGee, John J. “RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field.” 2006. Web. 18 Oct 2019.

Vancouver:

McGee JJ. RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field. [Internet] [Masters thesis]. Virginia Tech; 2006. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/31911.

Council of Science Editors:

McGee JJ. RenÃ© Schoof's Algorithm for Determining the Order of the Group of Points on an Elliptic Curve over a Finite Field. [Masters Thesis]. Virginia Tech; 2006. Available from: http://hdl.handle.net/10919/31911

16. Josyula, Sai Prashanth. On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process.

Degree: 2015, , Department of Computer Science and Engineering

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820

► Context. Digital counterparts of handwritten signatures are known as Digital Signatures. The *Elliptic* *Curve* Digital Signature Algorithm (ECDSA) is an *Elliptic* *Curve* *Cryptography* (ECC)…
(more)

Subjects/Keywords: Digital signatures; Elliptic curve cryptography; GLV method; Side-channel attack

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Josyula, S. P. (2015). On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process. (Thesis). , Department of Computer Science and Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Josyula, Sai Prashanth. “On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process.” 2015. Thesis, , Department of Computer Science and Engineering. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Josyula, Sai Prashanth. “On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process.” 2015. Web. 18 Oct 2019.

Vancouver:

Josyula SP. On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process. [Internet] [Thesis]. , Department of Computer Science and Engineering; 2015. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Josyula SP. On the Applicability of a Cache Side-Channel Attack on ECDSA Signatures : The Flush+Reload attack on the point multiplication in ECDSA signature generation process. [Thesis]. , Department of Computer Science and Engineering; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10820

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

17. Hsieh, Chia-Chen. Leakage-resistant Key Distribution Mechanism in Software-Defined Network.

Degree: Master, Computer Science and Engineering, 2018, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729118-005526

► Software-Defined Network (SDN) is a new concept of network architecture. Due to the properties of SDN, managing and monitoring an entire network is easier than…
(more)

Subjects/Keywords: Symmetric cryptosystems; Elliptic curve cryptography; Key distribution mechanism; Software-Defined network

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hsieh, C. (2018). Leakage-resistant Key Distribution Mechanism in Software-Defined Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729118-005526

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hsieh, Chia-Chen. “Leakage-resistant Key Distribution Mechanism in Software-Defined Network.” 2018. Thesis, NSYSU. Accessed October 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729118-005526.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hsieh, Chia-Chen. “Leakage-resistant Key Distribution Mechanism in Software-Defined Network.” 2018. Web. 18 Oct 2019.

Vancouver:

Hsieh C. Leakage-resistant Key Distribution Mechanism in Software-Defined Network. [Internet] [Thesis]. NSYSU; 2018. [cited 2019 Oct 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729118-005526.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hsieh C. Leakage-resistant Key Distribution Mechanism in Software-Defined Network. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729118-005526

Not specified: Masters Thesis or Doctoral Dissertation

University of Windsor

18.
Leboeuf, Karl Bernard.
GPU and ASIC Acceleration of *Elliptic* *Curve* Scalar Point Multiplication.

Degree: PhD, Electrical and Computer Engineering, 2012, University of Windsor

URL: https://scholar.uwindsor.ca/etd/5367

► As public information is increasingly communicated across public networks such as the internet, the use of public key *cryptography* to provide security services such…
(more)

Subjects/Keywords: ASIC; Cryptography; Elliptic Curve; Finite Field; GPU; Public Key

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Leboeuf, K. B. (2012). GPU and ASIC Acceleration of Elliptic Curve Scalar Point Multiplication. (Doctoral Dissertation). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5367

Chicago Manual of Style (16^{th} Edition):

Leboeuf, Karl Bernard. “GPU and ASIC Acceleration of Elliptic Curve Scalar Point Multiplication.” 2012. Doctoral Dissertation, University of Windsor. Accessed October 18, 2019. https://scholar.uwindsor.ca/etd/5367.

MLA Handbook (7^{th} Edition):

Leboeuf, Karl Bernard. “GPU and ASIC Acceleration of Elliptic Curve Scalar Point Multiplication.” 2012. Web. 18 Oct 2019.

Vancouver:

Leboeuf KB. GPU and ASIC Acceleration of Elliptic Curve Scalar Point Multiplication. [Internet] [Doctoral dissertation]. University of Windsor; 2012. [cited 2019 Oct 18]. Available from: https://scholar.uwindsor.ca/etd/5367.

Council of Science Editors:

Leboeuf KB. GPU and ASIC Acceleration of Elliptic Curve Scalar Point Multiplication. [Doctoral Dissertation]. University of Windsor; 2012. Available from: https://scholar.uwindsor.ca/etd/5367

19. Hamilton, Mark. Cryptographic coprocessors for embedded systems.

Degree: 2014, University College Cork

URL: http://hdl.handle.net/10468/1770

► In the field of embedded systems design, coprocessors play an important role as a component to increase performance. Many embedded systems are built around a…
(more)

Subjects/Keywords: FPGA; Elliptic curve cryptography (ECC); TRNG; Hash functions; AES; SSL/TLS; Cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hamilton, M. (2014). Cryptographic coprocessors for embedded systems. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/1770

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hamilton, Mark. “Cryptographic coprocessors for embedded systems.” 2014. Thesis, University College Cork. Accessed October 18, 2019. http://hdl.handle.net/10468/1770.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hamilton, Mark. “Cryptographic coprocessors for embedded systems.” 2014. Web. 18 Oct 2019.

Vancouver:

Hamilton M. Cryptographic coprocessors for embedded systems. [Internet] [Thesis]. University College Cork; 2014. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10468/1770.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hamilton M. Cryptographic coprocessors for embedded systems. [Thesis]. University College Cork; 2014. Available from: http://hdl.handle.net/10468/1770

Not specified: Masters Thesis or Doctoral Dissertation

Case Western Reserve University

20. Leinweber, Lawrence. Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems.

Degree: PhD, EECS - Computer Engineering, 2009, Case Western Reserve University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=case1238734353

► In order to provide security in ubiquitous, passively powered systems, especially RFID tags in the supply chain, improved asymmetric key cryptographic processors are presented, tested…
(more)

Subjects/Keywords: Computer Science; Electrical Engineering; Cryptography; elliptic curve cryptography; power management; RFID; embedded systems

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Leinweber, L. (2009). Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1238734353

Chicago Manual of Style (16^{th} Edition):

Leinweber, Lawrence. “Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems.” 2009. Doctoral Dissertation, Case Western Reserve University. Accessed October 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1238734353.

MLA Handbook (7^{th} Edition):

Leinweber, Lawrence. “Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems.” 2009. Web. 18 Oct 2019.

Vancouver:

Leinweber L. Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems. [Internet] [Doctoral dissertation]. Case Western Reserve University; 2009. [cited 2019 Oct 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1238734353.

Council of Science Editors:

Leinweber L. Improved Cryptographic Processor Designs for Security in RFID and Other Ubiquitous Systems. [Doctoral Dissertation]. Case Western Reserve University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1238734353

Texas A&M University

21. Pu, Shi. GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151845

► In (two-party) privacy-preserving-based applications, two users use encrypted inputs to compute a function without giving out plaintext of their input values. Privacy-preserving computing algorithms have…
(more)

Subjects/Keywords: Privacy-preserving computing; Secure Function Evaluation; Dynamic Programming; Elliptic Curve Cryptography; GPU

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pu, S. (2013). GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151845

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Pu, Shi. “GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols.” 2013. Thesis, Texas A&M University. Accessed October 18, 2019. http://hdl.handle.net/1969.1/151845.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pu, Shi. “GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols.” 2013. Web. 18 Oct 2019.

Vancouver:

Pu S. GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1969.1/151845.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pu S. GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151845

Not specified: Masters Thesis or Doctoral Dissertation

22.
Islam, SK Hafizul.
*Elliptic**curve* *cryptography* based techniques for
information and network security; -.

Degree: COMPUTER SCIENCE and ENGINEERING, 2013, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/33020

Abstract avalibal

Reference p.181 - 207 and Bibliography given

Subjects/Keywords: cryptography; Elliptic curve; network security; techniques

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Islam, S. H. (2013). Elliptic curve cryptography based techniques for information and network security; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/33020

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Islam, SK Hafizul. “Elliptic curve cryptography based techniques for information and network security; -.” 2013. Thesis, INFLIBNET. Accessed October 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/33020.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Islam, SK Hafizul. “Elliptic curve cryptography based techniques for information and network security; -.” 2013. Web. 18 Oct 2019.

Vancouver:

Islam SH. Elliptic curve cryptography based techniques for information and network security; -. [Internet] [Thesis]. INFLIBNET; 2013. [cited 2019 Oct 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33020.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Islam SH. Elliptic curve cryptography based techniques for information and network security; -. [Thesis]. INFLIBNET; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33020

Not specified: Masters Thesis or Doctoral Dissertation

Anna University

23.
Prabu M.
Performance analysis of hardware design and
implementation of *elliptic* *curve* Montgomery scalar multiplication
algorithm using FPGA;.

Degree: Elliptic curve Montgomery scalar multiplication algorithm using FPGA, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/24003

►

In this electronic world *cryptography* has been widely used as a means of information security Lot of issue arises in security environment and this can…
(more)

Subjects/Keywords: Algorithm; Cryptographic; Elliptic Curve Cryptography; FPGA; Information and communication engineering; Montgomery Scalar Multiplication

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

M, P. (2014). Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24003

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

M, Prabu. “Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA;.” 2014. Thesis, Anna University. Accessed October 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/24003.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

M, Prabu. “Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA;.” 2014. Web. 18 Oct 2019.

Vancouver:

M P. Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24003.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

M P. Performance analysis of hardware design and implementation of elliptic curve Montgomery scalar multiplication algorithm using FPGA;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24003

Not specified: Masters Thesis or Doctoral Dissertation

24.
Fotiadis, Georgios.
Constructing suitable parameters for pairing-based * cryptography*.

Degree: 2017, University of the Aegean; Πανεπιστήμιο Αιγαίου

URL: http://hdl.handle.net/10442/hedi/41018

►

Pairings were introduced by André Weil back in 1940 and they were initially viewed as a tool for attacking the *elliptic* *curve* discrete logarithm problem.…
(more)

Subjects/Keywords: Ζευγισμός; Ελλειπτική Καμπύλη; Αβελιανή Ποικιλία; Κρυπτογραφία Ζευγισμών; Pairing; Elliptic Curve; Abelian Variety; Pairing-Based Cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Fotiadis, G. (2017). Constructing suitable parameters for pairing-based cryptography. (Thesis). University of the Aegean; Πανεπιστήμιο Αιγαίου. Retrieved from http://hdl.handle.net/10442/hedi/41018

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Fotiadis, Georgios. “Constructing suitable parameters for pairing-based cryptography.” 2017. Thesis, University of the Aegean; Πανεπιστήμιο Αιγαίου. Accessed October 18, 2019. http://hdl.handle.net/10442/hedi/41018.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fotiadis, Georgios. “Constructing suitable parameters for pairing-based cryptography.” 2017. Web. 18 Oct 2019.

Vancouver:

Fotiadis G. Constructing suitable parameters for pairing-based cryptography. [Internet] [Thesis]. University of the Aegean; Πανεπιστήμιο Αιγαίου; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10442/hedi/41018.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fotiadis G. Constructing suitable parameters for pairing-based cryptography. [Thesis]. University of the Aegean; Πανεπιστήμιο Αιγαίου; 2017. Available from: http://hdl.handle.net/10442/hedi/41018

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

25.
Hariri, Arash.
Arithmetic Units for the *Elliptic* *Curve* *Cryptography* with Concurrent Error Detection Capability.

Degree: 2010, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/75

► The *elliptic* *curve* *cryptography* is an important branch in public-key *cryptography*. In this thesis, we consider the *elliptic* *curve* *cryptography* over binary extension fields from…
(more)

Subjects/Keywords: Finite Field Arithmetic; Elliptic Curve Cryptography; Montgomery Multiplication; VLSI and Circuits, Embedded and Hardware Systems

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hariri, A. (2010). Arithmetic Units for the Elliptic Curve Cryptography with Concurrent Error Detection Capability. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/75

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hariri, Arash. “Arithmetic Units for the Elliptic Curve Cryptography with Concurrent Error Detection Capability.” 2010. Thesis, University of Western Ontario. Accessed October 18, 2019. https://ir.lib.uwo.ca/etd/75.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hariri, Arash. “Arithmetic Units for the Elliptic Curve Cryptography with Concurrent Error Detection Capability.” 2010. Web. 18 Oct 2019.

Vancouver:

Hariri A. Arithmetic Units for the Elliptic Curve Cryptography with Concurrent Error Detection Capability. [Internet] [Thesis]. University of Western Ontario; 2010. [cited 2019 Oct 18]. Available from: https://ir.lib.uwo.ca/etd/75.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hariri A. Arithmetic Units for the Elliptic Curve Cryptography with Concurrent Error Detection Capability. [Thesis]. University of Western Ontario; 2010. Available from: https://ir.lib.uwo.ca/etd/75

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

26.
Morozov, Sergey Victorovich.
*Elliptic**Curve* *Cryptography* on Heterogeneous Multicore Platform.

Degree: MS, Electrical and Computer Engineering, 2010, Virginia Tech

URL: http://hdl.handle.net/10919/34872

► *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…
(more)

Subjects/Keywords: Binary Field; DSP; ARM; Cryptography; Elliptic Curve; Prime Field; Multiprocessor; Point Multiplication; Multicore

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Morozov, S. V. (2010). Elliptic Curve Cryptography on Heterogeneous Multicore Platform. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34872

Chicago Manual of Style (16^{th} Edition):

Morozov, Sergey Victorovich. “Elliptic Curve Cryptography on Heterogeneous Multicore Platform.” 2010. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/34872.

MLA Handbook (7^{th} Edition):

Morozov, Sergey Victorovich. “Elliptic Curve Cryptography on Heterogeneous Multicore Platform.” 2010. Web. 18 Oct 2019.

Vancouver:

Morozov SV. Elliptic Curve Cryptography on Heterogeneous Multicore Platform. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/34872.

Council of Science Editors:

Morozov SV. Elliptic Curve Cryptography on Heterogeneous Multicore Platform. [Masters Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/34872

Virginia Tech

27.
Pabbuleti, Krishna Chaitanya.
Performance Optimization of Public Key *Cryptography* on Embedded Platforms.

Degree: MS, Electrical and Computer Engineering, 2014, Virginia Tech

URL: http://hdl.handle.net/10919/48120

► Embedded systems are so ubiquitous that they account for almost 90% of all the computing devices. They range from very small scale devices with an…
(more)

Subjects/Keywords: Elliptic Curve Cryptography; Modular Arithmetic; SIMD; Hash-based Signatures; MSP430; Wireless Sensor Node

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pabbuleti, K. C. (2014). Performance Optimization of Public Key Cryptography on Embedded Platforms. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/48120

Chicago Manual of Style (16^{th} Edition):

Pabbuleti, Krishna Chaitanya. “Performance Optimization of Public Key Cryptography on Embedded Platforms.” 2014. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/48120.

MLA Handbook (7^{th} Edition):

Pabbuleti, Krishna Chaitanya. “Performance Optimization of Public Key Cryptography on Embedded Platforms.” 2014. Web. 18 Oct 2019.

Vancouver:

Pabbuleti KC. Performance Optimization of Public Key Cryptography on Embedded Platforms. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/48120.

Council of Science Editors:

Pabbuleti KC. Performance Optimization of Public Key Cryptography on Embedded Platforms. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/48120

McMaster University

28. Gorrie, Robert W.V. Advances Towards Practical Implementations of Isogeny Based Signatures.

Degree: MSc, 2019, McMaster University

URL: http://hdl.handle.net/11375/24031

►

Progress in the field of quantum computing has shown that, should construction of a sufficiently powerful quantum computer become feasible, much of the *cryptography* used…
(more)

Subjects/Keywords: isogeny; cryptography; elliptic curve; SIDH; signature; optimization; efficient; post-quantum; quantum-safe

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gorrie, R. W. V. (2019). Advances Towards Practical Implementations of Isogeny Based Signatures. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/24031

Chicago Manual of Style (16^{th} Edition):

Gorrie, Robert W V. “Advances Towards Practical Implementations of Isogeny Based Signatures.” 2019. Masters Thesis, McMaster University. Accessed October 18, 2019. http://hdl.handle.net/11375/24031.

MLA Handbook (7^{th} Edition):

Gorrie, Robert W V. “Advances Towards Practical Implementations of Isogeny Based Signatures.” 2019. Web. 18 Oct 2019.

Vancouver:

Gorrie RWV. Advances Towards Practical Implementations of Isogeny Based Signatures. [Internet] [Masters thesis]. McMaster University; 2019. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11375/24031.

Council of Science Editors:

Gorrie RWV. Advances Towards Practical Implementations of Isogeny Based Signatures. [Masters Thesis]. McMaster University; 2019. Available from: http://hdl.handle.net/11375/24031

University of Waterloo

29.
Mostafa, Mohannad.
Using Random Digit Representation for *Elliptic* *Curve* Scalar Multiplication.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13839

► *Elliptic* *Curve* *Cryptography* (ECC) was introduced independently by Miller and Koblitz in 1986. Compared to the integer factorization based Rivest-Shamir-Adleman (RSA) cryptosystem, ECC provides shorter…
(more)

Subjects/Keywords: ECC; Elliptic Curve Cryptography; Random Number; NAF; Non Adjacent Form; RDR; wNAF

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mostafa, M. (2018). Using Random Digit Representation for Elliptic Curve Scalar Multiplication. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13839

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mostafa, Mohannad. “Using Random Digit Representation for Elliptic Curve Scalar Multiplication.” 2018. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/13839.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mostafa, Mohannad. “Using Random Digit Representation for Elliptic Curve Scalar Multiplication.” 2018. Web. 18 Oct 2019.

Vancouver:

Mostafa M. Using Random Digit Representation for Elliptic Curve Scalar Multiplication. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/13839.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mostafa M. Using Random Digit Representation for Elliptic Curve Scalar Multiplication. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13839

Not specified: Masters Thesis or Doctoral Dissertation

University of Windsor

30. Lalonde, Dylan Roderick. Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems.

Degree: MA, Electrical and Computer Engineering, 2017, University of Windsor

URL: https://scholar.uwindsor.ca/etd/5995

► Modern side-channel attacks (SCA) have the ability to reveal sensitive data from non-protected hardware implementations of cryptographic accelerators whether they be private or public-key systems.…
(more)

Subjects/Keywords: differential power analysis; elliptic curve cryptography; hardware; scalar point multiplication; security; side-channel attack

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lalonde, D. R. (2017). Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5995

Chicago Manual of Style (16^{th} Edition):

Lalonde, Dylan Roderick. “Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems.” 2017. Masters Thesis, University of Windsor. Accessed October 18, 2019. https://scholar.uwindsor.ca/etd/5995.

MLA Handbook (7^{th} Edition):

Lalonde, Dylan Roderick. “Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems.” 2017. Web. 18 Oct 2019.

Vancouver:

Lalonde DR. Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems. [Internet] [Masters thesis]. University of Windsor; 2017. [cited 2019 Oct 18]. Available from: https://scholar.uwindsor.ca/etd/5995.

Council of Science Editors:

Lalonde DR. Private and Public-Key Side-Channel Threats Against Hardware Accelerated Cryptosystems. [Masters Thesis]. University of Windsor; 2017. Available from: https://scholar.uwindsor.ca/etd/5995