Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( Elliptic Curve Cryptography). Showing records 1 – 30 of 4122 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Waikato

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

Degree: 2010, University of Waikato

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

Note: this citation may be lacking information needed for this citation format:
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

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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/.

Note: this citation may be lacking information needed for this citation format:
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/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

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

Degree: 2016, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


San Jose State University

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

Abstract avalibal

Reference p.181 - 207 and Bibliography given

Advisors/Committee Members: Biswas, G P.

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

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

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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 (7th 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

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

.