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:(Discrete logarithm). Showing records 1 – 22 of 22 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


California State University – San Bernardino

1. Lopez, Samuel. MODERN CRYPTOGRAPHY.

Degree: MAin Mathematics, Mathematics, 2018, California State University – San Bernardino

  We live in an age where we willingly provide our social security number, credit card information, home address and countless other sensitive information over… (more)

Subjects/Keywords: Cryptography; Data Encryption Standard; Advanced Encryption Standard; RSA; Discrete Logarithm Problem; Information Security; Number Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopez, S. (2018). MODERN CRYPTOGRAPHY. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/729

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):

Lopez, Samuel. “MODERN CRYPTOGRAPHY.” 2018. Thesis, California State University – San Bernardino. Accessed June 19, 2019. http://scholarworks.lib.csusb.edu/etd/729.

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

MLA Handbook (7th Edition):

Lopez, Samuel. “MODERN CRYPTOGRAPHY.” 2018. Web. 19 Jun 2019.

Vancouver:

Lopez S. MODERN CRYPTOGRAPHY. [Internet] [Thesis]. California State University – San Bernardino; 2018. [cited 2019 Jun 19]. Available from: http://scholarworks.lib.csusb.edu/etd/729.

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

Council of Science Editors:

Lopez S. MODERN CRYPTOGRAPHY. [Thesis]. California State University – San Bernardino; 2018. Available from: http://scholarworks.lib.csusb.edu/etd/729

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

2. Miele, Andrea. On the Analysis of Public-Key Cryptologic Algorithms.

Degree: 2015, EPFL

 The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC)… (more)

Subjects/Keywords: cryptology; cryptanalysis; public-key cryptography; integer factorization; elliptic curves; hyperelliptic curves; discrete logarithm problem; GPUs; FPGAs; complex multiplication method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miele, A. (2015). On the Analysis of Public-Key Cryptologic Algorithms. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/207710

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):

Miele, Andrea. “On the Analysis of Public-Key Cryptologic Algorithms.” 2015. Thesis, EPFL. Accessed June 19, 2019. http://infoscience.epfl.ch/record/207710.

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

MLA Handbook (7th Edition):

Miele, Andrea. “On the Analysis of Public-Key Cryptologic Algorithms.” 2015. Web. 19 Jun 2019.

Vancouver:

Miele A. On the Analysis of Public-Key Cryptologic Algorithms. [Internet] [Thesis]. EPFL; 2015. [cited 2019 Jun 19]. Available from: http://infoscience.epfl.ch/record/207710.

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

Council of Science Editors:

Miele A. On the Analysis of Public-Key Cryptologic Algorithms. [Thesis]. EPFL; 2015. Available from: http://infoscience.epfl.ch/record/207710

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

3. Wallet, Alexandre. Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties.

Degree: Docteur es, Informatique, 2016, Université Pierre et Marie Curie – Paris VI

Le problème du logarithme discret est une brique fondamentale de nombreux protocoles de communication sécurisée. Son instantiation sur les courbes elliptiques a permis, grâce à… (more)

Subjects/Keywords: Cryptanalyse algébrique; Logarithme discret; Calcul d'indice; Courbes algébriques; Systèmes polynomiaux; Bases de Gröbner; Algebraic curves; Discrete logarithm; Gröbner bases; 005.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wallet, A. (2016). Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066438

Chicago Manual of Style (16th Edition):

Wallet, Alexandre. “Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed June 19, 2019. http://www.theses.fr/2016PA066438.

MLA Handbook (7th Edition):

Wallet, Alexandre. “Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties.” 2016. Web. 19 Jun 2019.

Vancouver:

Wallet A. Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2016PA066438.

Council of Science Editors:

Wallet A. Le problème de décompositions de points dans les variétés Jacobiennes : The point decomposition problem in Jacobian varieties. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066438

4. Jalinière, Pierre. Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics.

Degree: Docteur es, Mathématiques, 2016, Université Pierre et Marie Curie – Paris VI

Cette thèse comporte trois volets indépendants en cryptographie, en théorie de Hodge p-adique et en analyse numérique.La première partie consiste en l'étude d'algorithmes performants de… (more)

Subjects/Keywords: Cryptographie; Logarithme discret; Polynômes; Représentations galoisiennes; Théorie de Hodge p-adique; Schémas numériques; Cryptography; Discrete logarithm; Galois representations; 513.1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jalinière, P. (2016). Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066113

Chicago Manual of Style (16th Edition):

Jalinière, Pierre. “Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed June 19, 2019. http://www.theses.fr/2016PA066113.

MLA Handbook (7th Edition):

Jalinière, Pierre. “Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics.” 2016. Web. 19 Jun 2019.

Vancouver:

Jalinière P. Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2016PA066113.

Council of Science Editors:

Jalinière P. Arithmétrique en différentes caractéristiques : Arithmetic in different characteristics. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066113


Indian Institute of Science

5. Vivek, Srinivas V. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.

Degree: 2010, Indian Institute of Science

 There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard… (more)

Subjects/Keywords: Computational Mathematics; Computational Number Theory; Number Theory; Cubic Sieve Congruence (CSC); Discrete Logarithm Problem (DLP); Cryptanalysis; Diophantine Equation; Continued Fraction; Fractional Part Inequality; Fractional Part Sequences; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vivek, S. V. (2010). On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1996

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):

Vivek, Srinivas V. “On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.” 2010. Thesis, Indian Institute of Science. Accessed June 19, 2019. http://hdl.handle.net/2005/1996.

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

MLA Handbook (7th Edition):

Vivek, Srinivas V. “On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.” 2010. Web. 19 Jun 2019.

Vancouver:

Vivek SV. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2005/1996.

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

Council of Science Editors:

Vivek SV. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. [Thesis]. Indian Institute of Science; 2010. Available from: http://hdl.handle.net/2005/1996

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

6. Pierrot, Cécile. Le logarithme discret dans les corps finis : Discrete logarithm in finite fields.

Degree: Docteur es, Informatique, 2016, Université Pierre et Marie Curie – Paris VI

La cryptologie consiste en l’étude des techniques utilisées par deux entités pour communiquer en secret en présence d’une troisième. Les propriétés mathématiques qui sous-tendent ces… (more)

Subjects/Keywords: Cryptanalyse; Logarithme discret; Corps finis; Calcul d’indice; Représentation de Frobenius; Crible par corps de nombres; Cryptanalysis; Discrete logarithm; Finite fields; Index Calculus; Frobenius representation; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pierrot, C. (2016). Le logarithme discret dans les corps finis : Discrete logarithm in finite fields. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066495

Chicago Manual of Style (16th Edition):

Pierrot, Cécile. “Le logarithme discret dans les corps finis : Discrete logarithm in finite fields.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed June 19, 2019. http://www.theses.fr/2016PA066495.

MLA Handbook (7th Edition):

Pierrot, Cécile. “Le logarithme discret dans les corps finis : Discrete logarithm in finite fields.” 2016. Web. 19 Jun 2019.

Vancouver:

Pierrot C. Le logarithme discret dans les corps finis : Discrete logarithm in finite fields. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2016PA066495.

Council of Science Editors:

Pierrot C. Le logarithme discret dans les corps finis : Discrete logarithm in finite fields. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066495

7. Padmavathy, R. Computational studies on discrete logarithm problem; -.

Degree: Computer and Information science, 2009, University of Hyderabad

None

list of figures and maps given

Advisors/Committee Members: Bhagavati, Chakravarthy.

Subjects/Keywords: computer and information science; Computational studies; discrete logarithm problem; linear siev method; DLP

Page 1 Page 2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Padmavathy, R. (2009). Computational studies on discrete logarithm problem; -. (Thesis). University of Hyderabad. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26718

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):

Padmavathy, R. “Computational studies on discrete logarithm problem; -.” 2009. Thesis, University of Hyderabad. Accessed June 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/26718.

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

MLA Handbook (7th Edition):

Padmavathy, R. “Computational studies on discrete logarithm problem; -.” 2009. Web. 19 Jun 2019.

Vancouver:

Padmavathy R. Computational studies on discrete logarithm problem; -. [Internet] [Thesis]. University of Hyderabad; 2009. [cited 2019 Jun 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26718.

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

Council of Science Editors:

Padmavathy R. Computational studies on discrete logarithm problem; -. [Thesis]. University of Hyderabad; 2009. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26718

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


Indian Institute of Science

8. Vivek, Srinivas V. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.

Degree: 2010, Indian Institute of Science

 There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard… (more)

Subjects/Keywords: Computational Mathematics; Computational Number Theory; Number Theory; Cubic Sieve Congruence (CSC); Discrete Logarithm Problem (DLP); Cryptanalysis; Diophantine Equation; Continued Fraction; Fractional Part Inequality; Fractional Part Sequences; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vivek, S. V. (2010). On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1996 ; http://etd.ncsi.iisc.ernet.in/abstracts/2584/G24423-Abs.pdf

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):

Vivek, Srinivas V. “On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.” 2010. Thesis, Indian Institute of Science. Accessed June 19, 2019. http://etd.iisc.ernet.in/handle/2005/1996 ; http://etd.ncsi.iisc.ernet.in/abstracts/2584/G24423-Abs.pdf.

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

MLA Handbook (7th Edition):

Vivek, Srinivas V. “On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem.” 2010. Web. 19 Jun 2019.

Vancouver:

Vivek SV. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Jun 19]. Available from: http://etd.iisc.ernet.in/handle/2005/1996 ; http://etd.ncsi.iisc.ernet.in/abstracts/2584/G24423-Abs.pdf.

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

Council of Science Editors:

Vivek SV. On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem. [Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ernet.in/handle/2005/1996 ; http://etd.ncsi.iisc.ernet.in/abstracts/2584/G24423-Abs.pdf

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


EPFL

9. Bos, Joppe Willem. On the Cryptanalysis of Public-Key Cryptography.

Degree: 2012, EPFL

 Nowadays, the most popular public-key cryptosystems are based on either the integer factorization or the discrete logarithm problem. The feasibility of solving these mathematical problems… (more)

Subjects/Keywords: cryptanalysis; public-key cryptography; integer factorization; elliptic curve discrete logarithm problem; arithmetic; cryptanalyse; cryptographie à clef publique; factorisation des entiers; problème de logarithme discret sur une courbe elliptique; arithmétique

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bos, J. W. (2012). On the Cryptanalysis of Public-Key Cryptography. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/170537

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):

Bos, Joppe Willem. “On the Cryptanalysis of Public-Key Cryptography.” 2012. Thesis, EPFL. Accessed June 19, 2019. http://infoscience.epfl.ch/record/170537.

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

MLA Handbook (7th Edition):

Bos, Joppe Willem. “On the Cryptanalysis of Public-Key Cryptography.” 2012. Web. 19 Jun 2019.

Vancouver:

Bos JW. On the Cryptanalysis of Public-Key Cryptography. [Internet] [Thesis]. EPFL; 2012. [cited 2019 Jun 19]. Available from: http://infoscience.epfl.ch/record/170537.

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

Council of Science Editors:

Bos JW. On the Cryptanalysis of Public-Key Cryptography. [Thesis]. EPFL; 2012. Available from: http://infoscience.epfl.ch/record/170537

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


Université de Lorraine

10. Grémy, Laurent. Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields.

Degree: Docteur es, Informatique, 2017, Université de Lorraine

La sécurité des systèmes cryptographiques à clef publique repose sur la difficulté de résoudre certains problèmes mathématiques, parmi lesquels se trouve le problème du logarithme… (more)

Subjects/Keywords: Cryptographie; Logarithme discret; Corps finis; Algorithmes de crible; Moyenne caractéristique; Implémentation; Calculs records; Réseaux euclidiens; Cryptography; Discrete logarithm; Finite fields; Sieve algorithm; Medium characteristic; Implementation; Record computations; Lattice; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grémy, L. (2017). Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2017LORR0141

Chicago Manual of Style (16th Edition):

Grémy, Laurent. “Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields.” 2017. Doctoral Dissertation, Université de Lorraine. Accessed June 19, 2019. http://www.theses.fr/2017LORR0141.

MLA Handbook (7th Edition):

Grémy, Laurent. “Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields.” 2017. Web. 19 Jun 2019.

Vancouver:

Grémy L. Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields. [Internet] [Doctoral dissertation]. Université de Lorraine; 2017. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2017LORR0141.

Council of Science Editors:

Grémy L. Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique : Sieve algorithms for the discrete logarithm in medium characteristic finite fields. [Doctoral Dissertation]. Université de Lorraine; 2017. Available from: http://www.theses.fr/2017LORR0141


Linnaeus University

11. Falk, Jenny. On Pollard's rho method for solving the elliptic curve discrete logarithm problem.

Degree: Mathematics, 2019, Linnaeus University

      Cryptosystems based on elliptic curves are in wide-spread use, they are considered secure because of the difficulty to solve the elliptic curve discrete(more)

Subjects/Keywords: elliptic curves; Pollard's rho method; elliptic curve discrete logarithm problem; cryptography; adding walk; mixed walk; cycle-detecting algorithm; iterating function; random walk; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Falk, J. (2019). On Pollard's rho method for solving the elliptic curve discrete logarithm problem. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85516

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):

Falk, Jenny. “On Pollard's rho method for solving the elliptic curve discrete logarithm problem.” 2019. Thesis, Linnaeus University. Accessed June 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85516.

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

MLA Handbook (7th Edition):

Falk, Jenny. “On Pollard's rho method for solving the elliptic curve discrete logarithm problem.” 2019. Web. 19 Jun 2019.

Vancouver:

Falk J. On Pollard's rho method for solving the elliptic curve discrete logarithm problem. [Internet] [Thesis]. Linnaeus University; 2019. [cited 2019 Jun 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85516.

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

Council of Science Editors:

Falk J. On Pollard's rho method for solving the elliptic curve discrete logarithm problem. [Thesis]. Linnaeus University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85516

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


University of Manchester

12. Grymel, Martin-Thomas. Error control with binary cyclic codes.

Degree: PhD, 2013, University of Manchester

 Error-control codes provide a mechanism to increase the reliability of digital data being processed, transmitted, or stored under noisy conditions. Cyclic codes constitute an important… (more)

Subjects/Keywords: 621.39; Error Control; Error Detection; Error Correction; Cyclic Code; Cyclic Redundancy Checksum; CRC; Programmable; Parallel; Circuit; LFSR; Linear Feedback Shift Register; Discrete Logarithm; Algorithm; Generic; Deterministic; Polynomial Ring; Primitive Polynomial; Maximum Length Sequence; SpiNNaker

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grymel, M. (2013). Error control with binary cyclic codes. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/error-control-with-binary-cyclic-codes(a5750b4a-e4d6-49a8-915b-3e015387ad36).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570282

Chicago Manual of Style (16th Edition):

Grymel, Martin-Thomas. “Error control with binary cyclic codes.” 2013. Doctoral Dissertation, University of Manchester. Accessed June 19, 2019. https://www.research.manchester.ac.uk/portal/en/theses/error-control-with-binary-cyclic-codes(a5750b4a-e4d6-49a8-915b-3e015387ad36).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570282.

MLA Handbook (7th Edition):

Grymel, Martin-Thomas. “Error control with binary cyclic codes.” 2013. Web. 19 Jun 2019.

Vancouver:

Grymel M. Error control with binary cyclic codes. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2019 Jun 19]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/error-control-with-binary-cyclic-codes(a5750b4a-e4d6-49a8-915b-3e015387ad36).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570282.

Council of Science Editors:

Grymel M. Error control with binary cyclic codes. [Doctoral Dissertation]. University of Manchester; 2013. Available from: https://www.research.manchester.ac.uk/portal/en/theses/error-control-with-binary-cyclic-codes(a5750b4a-e4d6-49a8-915b-3e015387ad36).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570282


University of Waterloo

13. Alexander, Nicholas Charles. Algebraic Tori in Cryptography.

Degree: 2005, University of Waterloo

 Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require… (more)

Subjects/Keywords: Mathematics; cryptography; compression; finite field; extension field; discrete logarithm problem; tori; torus; algebraic; Rubin; Silverberg; Granger; Vercauteren; XTR; LUC; CEILIDH

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alexander, N. C. (2005). Algebraic Tori in Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1154

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):

Alexander, Nicholas Charles. “Algebraic Tori in Cryptography.” 2005. Thesis, University of Waterloo. Accessed June 19, 2019. http://hdl.handle.net/10012/1154.

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

MLA Handbook (7th Edition):

Alexander, Nicholas Charles. “Algebraic Tori in Cryptography.” 2005. Web. 19 Jun 2019.

Vancouver:

Alexander NC. Algebraic Tori in Cryptography. [Internet] [Thesis]. University of Waterloo; 2005. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10012/1154.

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

Council of Science Editors:

Alexander NC. Algebraic Tori in Cryptography. [Thesis]. University of Waterloo; 2005. Available from: http://hdl.handle.net/10012/1154

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


Université de Lorraine

14. Bouvier, Cyril. Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation.

Degree: Docteur es, Informatique, 2015, Université de Lorraine

Dans cette thèse, nous étudions les problèmes de la factorisation d'entier et de calcul de logarithme discret dans les corps finis. Dans un premier temps,… (more)

Subjects/Keywords: Algorithme; Factorisation; Logarithme discret; Corps fini; Courbe elliptique; Corps de nombre; Sélection polynomiale; Étape de filtrage; ECM; NFS; NFS-Dl; FFS; Algorithm; Factorization; Discrete logarithm; Finite field; Elliptic curve; Number field; Polynomial selection; Filtering step; ECM; NFS; NFS-Dl; FFS; 512.002 85; 512.942

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bouvier, C. (2015). Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2015LORR0053

Chicago Manual of Style (16th Edition):

Bouvier, Cyril. “Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation.” 2015. Doctoral Dissertation, Université de Lorraine. Accessed June 19, 2019. http://www.theses.fr/2015LORR0053.

MLA Handbook (7th Edition):

Bouvier, Cyril. “Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation.” 2015. Web. 19 Jun 2019.

Vancouver:

Bouvier C. Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation. [Internet] [Doctoral dissertation]. Université de Lorraine; 2015. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2015LORR0053.

Council of Science Editors:

Bouvier C. Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret : Algorithms for integer factorization and discrete logarithms computation. [Doctoral Dissertation]. Université de Lorraine; 2015. Available from: http://www.theses.fr/2015LORR0053

15. Dorey, Kristen. An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS.

Degree: 2017, University of Western Ontario

 Transport Layer Security (TLS) is a mature cryptographic protocol, but has flexibility during implementation which can introduce exploitable flaws. New vulnerabilities are routinely discovered that… (more)

Subjects/Keywords: Transport Layer Security; discrete logarithm problem; Diffie-Hellman; small subgroup attack; X.509 certificate; name mismatch error

…DHE Finite Field Diffie-Hellman (ephemeral) DL Discrete logarithm DLP Discrete… …exploiting poor parameter validation in discrete logarithm implementations. 2. We conducted an… …outlines and demonstrates the lack of parameter validation found in discrete logarithm… …g0 = 1. The concepts of generators, moduli, and Gq are used to shape the discrete logarithm… …problem. Discrete Logarithms over Finite Fields. The discrete logarithm (DL) of an… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dorey, K. (2017). An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/4792

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):

Dorey, Kristen. “An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS.” 2017. Thesis, University of Western Ontario. Accessed June 19, 2019. https://ir.lib.uwo.ca/etd/4792.

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

MLA Handbook (7th Edition):

Dorey, Kristen. “An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS.” 2017. Web. 19 Jun 2019.

Vancouver:

Dorey K. An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS. [Internet] [Thesis]. University of Western Ontario; 2017. [cited 2019 Jun 19]. Available from: https://ir.lib.uwo.ca/etd/4792.

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

Council of Science Editors:

Dorey K. An Internet-Wide Analysis of Diffie-Hellman Key Exchange and X.509 Certificates in TLS. [Thesis]. University of Western Ontario; 2017. Available from: https://ir.lib.uwo.ca/etd/4792

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


Brno University of Technology

16. Kříž, Jiří. Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu .

Degree: 2009, Brno University of Technology

 Potřeby mezilidské komunikace v současné době dospěly do stavu, kdy většina přenášených zpráv je důvěrné povahy a jejich přenos po sdílených nezabezpečených linkách v otevřené… (more)

Subjects/Keywords: Diskrétní logaritmus; cyklická grupa; asymetrický kryptosystém; NP problém; Diffie-Hellmanův protokol; DSA; ElGamal; hash; Discrete Logarithm; Cyclic Group; Asymmetric Cryptosystem; NP problem; Diffie-Hellman Protocol; DSA; ElGamal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kříž, J. (2009). Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/10956

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):

Kříž, Jiří. “Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu .” 2009. Thesis, Brno University of Technology. Accessed June 19, 2019. http://hdl.handle.net/11012/10956.

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

MLA Handbook (7th Edition):

Kříž, Jiří. “Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu .” 2009. Web. 19 Jun 2019.

Vancouver:

Kříž J. Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/11012/10956.

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

Council of Science Editors:

Kříž J. Softwarová podpora výuky kryptosystémů založených na problému diskrétního logaritmu . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/10956

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

17. Barzi, Behnaz Kouchaki. Points of High Order on Elliptic Curves : ECDSA.

Degree: Mathematics, 2016, Linnaeus University

  This master thesis is about Elliptic Curve Digital Signature Algorithm or ECDSA and two of the known attacks on this security system. The purpose… (more)

Subjects/Keywords: Digital signature (DS.); Elliptic Curve Digital Signature Algorithm (ECDSA); Elliptic Curve Discrete Logarithm Problem (ECDLP); Baby Step; Giant Step (Bs.Gs.); Pollard’s Rho

…Kouchaki Barzi 10 Master Thesis 2.2 The Discrete Logarithm Problem In order to explain the… …discrete logarithm problem, first we need to know some definitions and theorems. Theorem 1. [… …can define the discrete logarithm problem as the following: Definition 2.1. [13]… …The Discrete Logarithm. Let p be a prime number and g be a primitive root modulo p. The… …discrete logarithm modulo p of h is the smallest positive integer x satisfying g x ≡ h (mod… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barzi, B. K. (2016). Points of High Order on Elliptic Curves : ECDSA. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449

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):

Barzi, Behnaz Kouchaki. “Points of High Order on Elliptic Curves : ECDSA.” 2016. Thesis, Linnaeus University. Accessed June 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449.

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

MLA Handbook (7th Edition):

Barzi, Behnaz Kouchaki. “Points of High Order on Elliptic Curves : ECDSA.” 2016. Web. 19 Jun 2019.

Vancouver:

Barzi BK. Points of High Order on Elliptic Curves : ECDSA. [Internet] [Thesis]. Linnaeus University; 2016. [cited 2019 Jun 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449.

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

Council of Science Editors:

Barzi BK. Points of High Order on Elliptic Curves : ECDSA. [Thesis]. Linnaeus University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-58449

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


University of Pretoria

18. Abu-Mahfouz, Adnan Mohammed I. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices.

Degree: Electrical, Electronic and Computer Engineering, 2006, University of Pretoria

 Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy.… (more)

Subjects/Keywords: Ecc; Elliptic curve; Elgamal; Diffie-hellman; Discrete logarithm problem; Ecdh; Frobenius; Ecdlp; Itoh tsujii inversion; Karatsuba algorithm; Extended euclidean algorithm; Schoolbook method; Addition chain algorithm; Non-adjacent form; Quadratic residue; Legendre symbol; Embedded system; Oef; Finite field; Optimal extension field; Public-key; Cryptography; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abu-Mahfouz, A. M. (2006). Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/25330

Chicago Manual of Style (16th Edition):

Abu-Mahfouz, Adnan Mohammed. “Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices.” 2006. Masters Thesis, University of Pretoria. Accessed June 19, 2019. http://hdl.handle.net/2263/25330.

MLA Handbook (7th Edition):

Abu-Mahfouz, Adnan Mohammed. “Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices.” 2006. Web. 19 Jun 2019.

Vancouver:

Abu-Mahfouz AM. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices. [Internet] [Masters thesis]. University of Pretoria; 2006. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2263/25330.

Council of Science Editors:

Abu-Mahfouz AM. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices. [Masters Thesis]. University of Pretoria; 2006. Available from: http://hdl.handle.net/2263/25330


Queensland University of Technology

19. McCulloch, Catherine Margaret. Discrete logarithm problem over finite prime fields.

Degree: 1998, Queensland University of Technology

Subjects/Keywords: Logarithms; Finite fields (Algebra); cryptography; cryptology; digital signatures; discrete logarithm; general number field sieve; key exchange; key exhaustion; index calculus; Pollards rho algorithm; public key cryptology; Shank's baby-step giant-step algorithm; Silver Pohlig Hellman algorithm; thesis; masters

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McCulloch, C. M. (1998). Discrete logarithm problem over finite prime fields. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/36976/

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):

McCulloch, Catherine Margaret. “Discrete logarithm problem over finite prime fields.” 1998. Thesis, Queensland University of Technology. Accessed June 19, 2019. http://eprints.qut.edu.au/36976/.

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

MLA Handbook (7th Edition):

McCulloch, Catherine Margaret. “Discrete logarithm problem over finite prime fields.” 1998. Web. 19 Jun 2019.

Vancouver:

McCulloch CM. Discrete logarithm problem over finite prime fields. [Internet] [Thesis]. Queensland University of Technology; 1998. [cited 2019 Jun 19]. Available from: http://eprints.qut.edu.au/36976/.

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

Council of Science Editors:

McCulloch CM. Discrete logarithm problem over finite prime fields. [Thesis]. Queensland University of Technology; 1998. Available from: http://eprints.qut.edu.au/36976/

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


University of Pretoria

20. [No author]. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices .

Degree: 2006, University of Pretoria

 Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy.… (more)

Subjects/Keywords: Ecc; Elliptic curve; Elgamal; Diffie-hellman; Discrete logarithm problem; Ecdh; Frobenius; Ecdlp; Itoh tsujii inversion; Karatsuba algorithm; Extended euclidean algorithm; Schoolbook method; Addition chain algorithm; Non-adjacent form; Quadratic residue; Legendre symbol; Embedded system; Oef; Finite field; Optimal extension field; Public-key; Cryptography; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2006). Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-06082005-144557/

Chicago Manual of Style (16th Edition):

author], [No. “Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices .” 2006. Masters Thesis, University of Pretoria. Accessed June 19, 2019. http://upetd.up.ac.za/thesis/available/etd-06082005-144557/.

MLA Handbook (7th Edition):

author], [No. “Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices .” 2006. Web. 19 Jun 2019.

Vancouver:

author] [. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices . [Internet] [Masters thesis]. University of Pretoria; 2006. [cited 2019 Jun 19]. Available from: http://upetd.up.ac.za/thesis/available/etd-06082005-144557/.

Council of Science Editors:

author] [. Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices . [Masters Thesis]. University of Pretoria; 2006. Available from: http://upetd.up.ac.za/thesis/available/etd-06082005-144557/

21. Grymel, Martin-Thomas. Error Control With Binary Cyclic Codes.

Degree: 2013, University of Manchester

 Error-control codes provide a mechanism to increase the reliability of digital data being processed, transmitted, or stored under noisy conditions. Cyclic codes constitute an important… (more)

Subjects/Keywords: Error Control; Error Detection; Error Correction; Cyclic Code; Cyclic Redundancy Checksum; CRC; Programmable; Parallel; Circuit; LFSR; Linear Feedback Shift Register; Discrete Logarithm; Algorithm; Generic; Deterministic; Polynomial Ring; Primitive Polynomial; Maximum Length Sequence; SpiNNaker

…51 52 54 56 6.1 Discrete logarithm computation based on cyclotomic cosets. . . . . . 94… …equivalent to the solution of an instance of the discrete logarithm problem. A new approach is… …problem is equivalent to the computation of the discrete logarithm in finite cyclic groups, for… …devisable. This is one reason why the discrete logarithm forms the basis for many cryptographic… …been proven that the computation of the discrete logarithm is hard for all groups of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grymel, M. (2013). Error Control With Binary Cyclic Codes. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:189115

Chicago Manual of Style (16th Edition):

Grymel, Martin-Thomas. “Error Control With Binary Cyclic Codes.” 2013. Doctoral Dissertation, University of Manchester. Accessed June 19, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:189115.

MLA Handbook (7th Edition):

Grymel, Martin-Thomas. “Error Control With Binary Cyclic Codes.” 2013. Web. 19 Jun 2019.

Vancouver:

Grymel M. Error Control With Binary Cyclic Codes. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2019 Jun 19]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:189115.

Council of Science Editors:

Grymel M. Error Control With Binary Cyclic Codes. [Doctoral Dissertation]. University of Manchester; 2013. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:189115


Queensland University of Technology

22. Hitchcock, Yvonne Roslyn. Elliptic curve cryptography for lightweight applications.

Degree: 2003, Queensland University of Technology

 Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty… (more)

Subjects/Keywords: Elliptic curve (EC); elliptic curve cryptosystem (ECC); discrete logarithm problem (DLP); elliptic curve discrete logarithm problem (ECDLP); speed; code size; memory usage; ram usage; fixed curve; random curve; elliptic curve digital signature algorithm (ECDSA); Pollard's rho method; Shanks's baby-step giant-step method (BSGS); Canetti-Krawczyk proof model; key exchange protocols; security proof; tripartite key exchange; pairings; password-based authentication; point addition; projective coordinates; Jacobian coordinates; Chudnovsky Jacobian coordinates; modified Jacobian coordinates; binary method; simultaneous multiple exponentiation; two-in-one scalar multiplication; coprocessor; smart card; lightweight device; simple power analysis (spa); side channel attack; equivalent security.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hitchcock, Y. R. (2003). Elliptic curve cryptography for lightweight applications. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/15838/

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):

Hitchcock, Yvonne Roslyn. “Elliptic curve cryptography for lightweight applications.” 2003. Thesis, Queensland University of Technology. Accessed June 19, 2019. http://eprints.qut.edu.au/15838/.

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

MLA Handbook (7th Edition):

Hitchcock, Yvonne Roslyn. “Elliptic curve cryptography for lightweight applications.” 2003. Web. 19 Jun 2019.

Vancouver:

Hitchcock YR. Elliptic curve cryptography for lightweight applications. [Internet] [Thesis]. Queensland University of Technology; 2003. [cited 2019 Jun 19]. Available from: http://eprints.qut.edu.au/15838/.

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

Council of Science Editors:

Hitchcock YR. Elliptic curve cryptography for lightweight applications. [Thesis]. Queensland University of Technology; 2003. Available from: http://eprints.qut.edu.au/15838/

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

.