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:(Cryptography). Showing records 1 – 30 of 1387 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Anna University

1. Latha Shanmuga Vadivu, S. Architecture of elliptic curve Cryptography using veriloghdl.

Degree: Information and Communication Engineering, 2014, Anna University

The expansion of the worldwide communication networks such as newlinethe internet and the increased dependency on digitized information in our newlinesociety makes information more vulnerable… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Latha Shanmuga Vadivu, S. (2014). Architecture of elliptic curve Cryptography using veriloghdl. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27232

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

Latha Shanmuga Vadivu, S. “Architecture of elliptic curve Cryptography using veriloghdl.” 2014. Thesis, Anna University. Accessed June 24, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/27232.

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

MLA Handbook (7th Edition):

Latha Shanmuga Vadivu, S. “Architecture of elliptic curve Cryptography using veriloghdl.” 2014. Web. 24 Jun 2019.

Vancouver:

Latha Shanmuga Vadivu S. Architecture of elliptic curve Cryptography using veriloghdl. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Jun 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27232.

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

Council of Science Editors:

Latha Shanmuga Vadivu S. Architecture of elliptic curve Cryptography using veriloghdl. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27232

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


University of Waterloo

2. Wu, Jiang. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.

Degree: 2009, University of Waterloo

 This thesis includes my research on efficient cryptographic protocols, sensor network key management, and radio frequency identification (RFID) authentication protocols. Key exchange, identification, and public… (more)

Subjects/Keywords: cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, J. (2009). Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4501

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

Wu, Jiang. “Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.” 2009. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/4501.

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

MLA Handbook (7th Edition):

Wu, Jiang. “Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.” 2009. Web. 24 Jun 2019.

Vancouver:

Wu J. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/4501.

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

Council of Science Editors:

Wu J. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4501

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


Delft University of Technology

3. Van Vliet, A.H.P. Secure Data Storage Outsourcing with Conjunctive Keyword Search:.

Degree: 2009, Delft University of Technology

 This thesis in the field of cryptography considers secure data storage outsourcing with keyword search capabilities. To ensure data confidentiality the data is stored in… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Vliet, A. H. P. (2009). Secure Data Storage Outsourcing with Conjunctive Keyword Search:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a

Chicago Manual of Style (16th Edition):

Van Vliet, A H P. “Secure Data Storage Outsourcing with Conjunctive Keyword Search:.” 2009. Masters Thesis, Delft University of Technology. Accessed June 24, 2019. http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a.

MLA Handbook (7th Edition):

Van Vliet, A H P. “Secure Data Storage Outsourcing with Conjunctive Keyword Search:.” 2009. Web. 24 Jun 2019.

Vancouver:

Van Vliet AHP. Secure Data Storage Outsourcing with Conjunctive Keyword Search:. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2019 Jun 24]. Available from: http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a.

Council of Science Editors:

Van Vliet AHP. Secure Data Storage Outsourcing with Conjunctive Keyword Search:. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a


University of Waterloo

4. Pawlega, Filip. Privately Constrained Testable Pseudorandom Functions.

Degree: 2018, University of Waterloo

 Privately Constrained Pseudorandom Functions allow a PRF key to be delegated to some evaluator in a constrained manner, such that the key’s functionality is restricted… (more)

Subjects/Keywords: cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pawlega, F. (2018). Privately Constrained Testable Pseudorandom Functions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13840

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

Pawlega, Filip. “Privately Constrained Testable Pseudorandom Functions.” 2018. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/13840.

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

MLA Handbook (7th Edition):

Pawlega, Filip. “Privately Constrained Testable Pseudorandom Functions.” 2018. Web. 24 Jun 2019.

Vancouver:

Pawlega F. Privately Constrained Testable Pseudorandom Functions. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/13840.

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

Council of Science Editors:

Pawlega F. Privately Constrained Testable Pseudorandom Functions. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13840

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


Tartu University

5. Ebrahimi, Ehsan. Post-quantum security in the presence of superposition queries .

Degree: 2018, Tartu University

 Teadlased ja insenerid on juba mõnda aega püüdnud ehitada kvantseadustel põhinevat arvutit. See uus masin (kvantarvuti) on võimeline lahendama arvutuslikult keerulisi ülesandeid, nagu näiteks täisarvude… (more)

Subjects/Keywords: cryptography; quantum cryptography; safety

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ebrahimi, E. (2018). Post-quantum security in the presence of superposition queries . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/62687

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

Ebrahimi, Ehsan. “Post-quantum security in the presence of superposition queries .” 2018. Thesis, Tartu University. Accessed June 24, 2019. http://hdl.handle.net/10062/62687.

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

MLA Handbook (7th Edition):

Ebrahimi, Ehsan. “Post-quantum security in the presence of superposition queries .” 2018. Web. 24 Jun 2019.

Vancouver:

Ebrahimi E. Post-quantum security in the presence of superposition queries . [Internet] [Thesis]. Tartu University; 2018. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10062/62687.

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

Council of Science Editors:

Ebrahimi E. Post-quantum security in the presence of superposition queries . [Thesis]. Tartu University; 2018. Available from: http://hdl.handle.net/10062/62687

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


Oregon State University

6. Park, Song Jun. Hardware design of scalable and unified modular division and Montgomery multiplication.

Degree: MS, Electrical and Computer Engineering, 2005, Oregon State University

 Modular arithmetic is a basic operation for many cryptography applications such as public key cryptography, key exchange algorithms, digital signatures, and elliptic curve cryptography. Therefore,… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, S. J. (2005). Hardware design of scalable and unified modular division and Montgomery multiplication. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/10220

Chicago Manual of Style (16th Edition):

Park, Song Jun. “Hardware design of scalable and unified modular division and Montgomery multiplication.” 2005. Masters Thesis, Oregon State University. Accessed June 24, 2019. http://hdl.handle.net/1957/10220.

MLA Handbook (7th Edition):

Park, Song Jun. “Hardware design of scalable and unified modular division and Montgomery multiplication.” 2005. Web. 24 Jun 2019.

Vancouver:

Park SJ. Hardware design of scalable and unified modular division and Montgomery multiplication. [Internet] [Masters thesis]. Oregon State University; 2005. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1957/10220.

Council of Science Editors:

Park SJ. Hardware design of scalable and unified modular division and Montgomery multiplication. [Masters Thesis]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/10220

7. Maeda, Masaya. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maeda, M. (n.d.). A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/2113

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maeda, Masaya. “A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed June 24, 2019. http://hdl.handle.net/10061/2113.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maeda, Masaya. “A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.” Web. 24 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Maeda M. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10061/2113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Maeda M. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/2113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Oregon State University

8. Todorov, Georgi. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.

Degree: MS, Electrical and Computer Engineering, 2000, Oregon State University

 Modular multiplication is a widely used operation in cryptography. Several well-known applications, such as the decipherment operation of the RSA algorithm, the Diffie-Hellman key exchange… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Todorov, G. (2000). ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/32914

Chicago Manual of Style (16th Edition):

Todorov, Georgi. “ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.” 2000. Masters Thesis, Oregon State University. Accessed June 24, 2019. http://hdl.handle.net/1957/32914.

MLA Handbook (7th Edition):

Todorov, Georgi. “ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.” 2000. Web. 24 Jun 2019.

Vancouver:

Todorov G. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1957/32914.

Council of Science Editors:

Todorov G. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/32914


Oregon State University

9. Sunar, Berk. Fast Galois field arithmetic for elliptic curve cryptography and error control codes.

Degree: PhD, Electrical and Computer Engineering, 1998, Oregon State University

 Today's computer and network communication systems rely on authenticated and secure transmission of information, which requires computationally efficient and low bandwidth cryptographic algorithms. Among these… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sunar, B. (1998). Fast Galois field arithmetic for elliptic curve cryptography and error control codes. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/33927

Chicago Manual of Style (16th Edition):

Sunar, Berk. “Fast Galois field arithmetic for elliptic curve cryptography and error control codes.” 1998. Doctoral Dissertation, Oregon State University. Accessed June 24, 2019. http://hdl.handle.net/1957/33927.

MLA Handbook (7th Edition):

Sunar, Berk. “Fast Galois field arithmetic for elliptic curve cryptography and error control codes.” 1998. Web. 24 Jun 2019.

Vancouver:

Sunar B. Fast Galois field arithmetic for elliptic curve cryptography and error control codes. [Internet] [Doctoral dissertation]. Oregon State University; 1998. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1957/33927.

Council of Science Editors:

Sunar B. Fast Galois field arithmetic for elliptic curve cryptography and error control codes. [Doctoral Dissertation]. Oregon State University; 1998. Available from: http://hdl.handle.net/1957/33927


Oregon State University

10. Acar, Tolga. High-speed algorithms & architectures for number-theoretic cryptosystems.

Degree: PhD, Electrical and Computer Engineering, 1997, Oregon State University

 Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Acar, T. (1997). High-speed algorithms & architectures for number-theoretic cryptosystems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/33854

Chicago Manual of Style (16th Edition):

Acar, Tolga. “High-speed algorithms & architectures for number-theoretic cryptosystems.” 1997. Doctoral Dissertation, Oregon State University. Accessed June 24, 2019. http://hdl.handle.net/1957/33854.

MLA Handbook (7th Edition):

Acar, Tolga. “High-speed algorithms & architectures for number-theoretic cryptosystems.” 1997. Web. 24 Jun 2019.

Vancouver:

Acar T. High-speed algorithms & architectures for number-theoretic cryptosystems. [Internet] [Doctoral dissertation]. Oregon State University; 1997. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1957/33854.

Council of Science Editors:

Acar T. High-speed algorithms & architectures for number-theoretic cryptosystems. [Doctoral Dissertation]. Oregon State University; 1997. Available from: http://hdl.handle.net/1957/33854


University of Ottawa

11. Lord, Sébastien. Uncloneable Quantum Encryption via Random Oracles .

Degree: 2019, University of Ottawa

 One of the key distinctions between classical and quantum information is given by the no-cloning theorem: unlike bits, arbitrary qubits cannot be perfectly copied. This… (more)

Subjects/Keywords: Quantum Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lord, S. (2019). Uncloneable Quantum Encryption via Random Oracles . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38855

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

Lord, Sébastien. “Uncloneable Quantum Encryption via Random Oracles .” 2019. Thesis, University of Ottawa. Accessed June 24, 2019. http://hdl.handle.net/10393/38855.

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

MLA Handbook (7th Edition):

Lord, Sébastien. “Uncloneable Quantum Encryption via Random Oracles .” 2019. Web. 24 Jun 2019.

Vancouver:

Lord S. Uncloneable Quantum Encryption via Random Oracles . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10393/38855.

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

Council of Science Editors:

Lord S. Uncloneable Quantum Encryption via Random Oracles . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/38855

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


California State Polytechnic University – Pomona

12. Figueroa-Hernandez, Jose Jr. A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard.

Degree: MS, Department of Computer Science, 2019, California State Polytechnic University – Pomona

 As the Internet has become a major part of a person???s daily life, the type of devices connected to the Internet has expanded. Network access,… (more)

Subjects/Keywords: lightweight cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Figueroa-Hernandez, J. J. (2019). A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard. (Masters Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/207843

Chicago Manual of Style (16th Edition):

Figueroa-Hernandez, Jose Jr. “A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard.” 2019. Masters Thesis, California State Polytechnic University – Pomona. Accessed June 24, 2019. http://hdl.handle.net/10211.3/207843.

MLA Handbook (7th Edition):

Figueroa-Hernandez, Jose Jr. “A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard.” 2019. Web. 24 Jun 2019.

Vancouver:

Figueroa-Hernandez JJ. A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard. [Internet] [Masters thesis]. California State Polytechnic University – Pomona; 2019. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10211.3/207843.

Council of Science Editors:

Figueroa-Hernandez JJ. A Comparison of Lightweight Ciphers Meeting NIST Lightweight Cryptography Requirements to the Advanced Encryption Standard. [Masters Thesis]. California State Polytechnic University – Pomona; 2019. Available from: http://hdl.handle.net/10211.3/207843


Rochester Institute of Technology

13. Delman, Bethany. Genetic algorithms in cryptography.

Degree: Computer Engineering, 2004, Rochester Institute of Technology

  Genetic algorithms (GAs) are a class of optimization algorithms. GAs attempt to solve problems through modeling a simplified version of genetic processes. There are… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Delman, B. (2004). Genetic algorithms in cryptography. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5456

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

Delman, Bethany. “Genetic algorithms in cryptography.” 2004. Thesis, Rochester Institute of Technology. Accessed June 24, 2019. https://scholarworks.rit.edu/theses/5456.

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

MLA Handbook (7th Edition):

Delman, Bethany. “Genetic algorithms in cryptography.” 2004. Web. 24 Jun 2019.

Vancouver:

Delman B. Genetic algorithms in cryptography. [Internet] [Thesis]. Rochester Institute of Technology; 2004. [cited 2019 Jun 24]. Available from: https://scholarworks.rit.edu/theses/5456.

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

Council of Science Editors:

Delman B. Genetic algorithms in cryptography. [Thesis]. Rochester Institute of Technology; 2004. Available from: https://scholarworks.rit.edu/theses/5456

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

14. Papamanthou, Charalampos. Cryptography for Efficiency: New Directions in Authenticated Data Structures.

Degree: PhD, Computer Science, 2011, Brown University

 Cloud computing has emerged as an important new computational andstorage medium and is increasingly being adopted both by companies and individuals as a means of… (more)

Subjects/Keywords: applied cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papamanthou, C. (2011). Cryptography for Efficiency: New Directions in Authenticated Data Structures. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11333/

Chicago Manual of Style (16th Edition):

Papamanthou, Charalampos. “Cryptography for Efficiency: New Directions in Authenticated Data Structures.” 2011. Doctoral Dissertation, Brown University. Accessed June 24, 2019. https://repository.library.brown.edu/studio/item/bdr:11333/.

MLA Handbook (7th Edition):

Papamanthou, Charalampos. “Cryptography for Efficiency: New Directions in Authenticated Data Structures.” 2011. Web. 24 Jun 2019.

Vancouver:

Papamanthou C. Cryptography for Efficiency: New Directions in Authenticated Data Structures. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Jun 24]. Available from: https://repository.library.brown.edu/studio/item/bdr:11333/.

Council of Science Editors:

Papamanthou C. Cryptography for Efficiency: New Directions in Authenticated Data Structures. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11333/


University of Waikato

15. 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 June 24, 2019. http://hdl.handle.net/10289/4273.

MLA Handbook (7th Edition):

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

Vancouver:

Abdullah K. Comparison between the RSA cryptosystem and elliptic curve cryptography . [Internet] [Masters thesis]. University of Waikato; 2010. [cited 2019 Jun 24]. 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


Texas A&M University

16. Luh, William. Distributed secrecy for information theoretic sensor network models.

Degree: 2009, Texas A&M University

 This dissertation presents a novel problem inspired by the characteristics of sensor networks. The basic setup through-out the dissertation is that a set of sensor… (more)

Subjects/Keywords: information theory; cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luh, W. (2009). Distributed secrecy for information theoretic sensor network models. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2949

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

Luh, William. “Distributed secrecy for information theoretic sensor network models.” 2009. Thesis, Texas A&M University. Accessed June 24, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2949.

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

MLA Handbook (7th Edition):

Luh, William. “Distributed secrecy for information theoretic sensor network models.” 2009. Web. 24 Jun 2019.

Vancouver:

Luh W. Distributed secrecy for information theoretic sensor network models. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2949.

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

Council of Science Editors:

Luh W. Distributed secrecy for information theoretic sensor network models. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2949

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


University of KwaZulu-Natal

17. Mirza, Abdul R. Towards practical quantum cryptography.

Degree: Physics, 2009, University of KwaZulu-Natal

 The information society that presides today is dependent on the communication industry to facilitate unintelligible data transfers between authenticated parties. Such requirements have, to date,… (more)

Subjects/Keywords: Mathematics – Cryptography.; Physics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mirza, A. R. (2009). Towards practical quantum cryptography. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/456

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

Mirza, Abdul R. “Towards practical quantum cryptography. ” 2009. Thesis, University of KwaZulu-Natal. Accessed June 24, 2019. http://hdl.handle.net/10413/456.

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

MLA Handbook (7th Edition):

Mirza, Abdul R. “Towards practical quantum cryptography. ” 2009. Web. 24 Jun 2019.

Vancouver:

Mirza AR. Towards practical quantum cryptography. [Internet] [Thesis]. University of KwaZulu-Natal; 2009. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10413/456.

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

Council of Science Editors:

Mirza AR. Towards practical quantum cryptography. [Thesis]. University of KwaZulu-Natal; 2009. Available from: http://hdl.handle.net/10413/456

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


University of Hong Kong

18. Zhang, Ping, Echo. Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware.

Degree: PhD, 2012, University of Hong Kong

Secure Multi-party Computation (SMC) is one significant research area in information security. In SMC, multiple parties jointly work on some function and no parties take… (more)

Subjects/Keywords: Computer security.; Cryptography.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Ping, E. (2012). Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. (Doctoral Dissertation). University of Hong Kong. Retrieved from Zhang, P. E. [张萍]. (2012). Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961789 ; http://dx.doi.org/10.5353/th_b4961789 ; http://hdl.handle.net/10722/180969

Chicago Manual of Style (16th Edition):

Zhang, Ping, Echo. “Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware.” 2012. Doctoral Dissertation, University of Hong Kong. Accessed June 24, 2019. Zhang, P. E. [张萍]. (2012). Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961789 ; http://dx.doi.org/10.5353/th_b4961789 ; http://hdl.handle.net/10722/180969.

MLA Handbook (7th Edition):

Zhang, Ping, Echo. “Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware.” 2012. Web. 24 Jun 2019.

Vancouver:

Zhang, Ping E. Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. [Internet] [Doctoral dissertation]. University of Hong Kong; 2012. [cited 2019 Jun 24]. Available from: Zhang, P. E. [张萍]. (2012). Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961789 ; http://dx.doi.org/10.5353/th_b4961789 ; http://hdl.handle.net/10722/180969.

Council of Science Editors:

Zhang, Ping E. Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. [Doctoral Dissertation]. University of Hong Kong; 2012. Available from: Zhang, P. E. [张萍]. (2012). Secure multi-party protocol using modern cryptographic technique and tamper resistant hardware. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961789 ; http://dx.doi.org/10.5353/th_b4961789 ; http://hdl.handle.net/10722/180969


University of Waterloo

19. Upadhyay, Jalaj. Generic Attacks on Hash Functions.

Degree: 2010, University of Waterloo

 The subject of this thesis is a security property of hash functions, called chosen-target forced-prefix preimage (CTFP) resistance and the generic attack on this property,… (more)

Subjects/Keywords: Hash Functions; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Upadhyay, J. (2010). Generic Attacks on Hash Functions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5527

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

Upadhyay, Jalaj. “Generic Attacks on Hash Functions.” 2010. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/5527.

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

MLA Handbook (7th Edition):

Upadhyay, Jalaj. “Generic Attacks on Hash Functions.” 2010. Web. 24 Jun 2019.

Vancouver:

Upadhyay J. Generic Attacks on Hash Functions. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/5527.

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

Council of Science Editors:

Upadhyay J. Generic Attacks on Hash Functions. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5527

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


University of Waterloo

20. Brydon, Dale. On the Security of Leakage Resilient Public Key Cryptography.

Degree: 2012, University of Waterloo

 Side channel attacks, where an attacker learns some physical information about the state of a device, are one of the ways in which cryptographic schemes… (more)

Subjects/Keywords: Cryptography; Leakage Resilient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brydon, D. (2012). On the Security of Leakage Resilient Public Key Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6676

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

Brydon, Dale. “On the Security of Leakage Resilient Public Key Cryptography.” 2012. Thesis, University of Waterloo. Accessed June 24, 2019. http://hdl.handle.net/10012/6676.

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

MLA Handbook (7th Edition):

Brydon, Dale. “On the Security of Leakage Resilient Public Key Cryptography.” 2012. Web. 24 Jun 2019.

Vancouver:

Brydon D. On the Security of Leakage Resilient Public Key Cryptography. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10012/6676.

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

Council of Science Editors:

Brydon D. On the Security of Leakage Resilient Public Key Cryptography. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6676

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


University of Ottawa

21. Pabstel, Melanie Anne. Parameter Constraints on Homomorphic Encryption Over the Integers .

Degree: 2017, University of Ottawa

 The research paper Fully Homomorphic Encryption over the Integers by van Dijk, Gentry, Halevi, and Vaikuntanathan [31] explores the construction of an encryption scheme over… (more)

Subjects/Keywords: homomorphic; encryption; cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pabstel, M. A. (2017). Parameter Constraints on Homomorphic Encryption Over the Integers . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/35977

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

Pabstel, Melanie Anne. “Parameter Constraints on Homomorphic Encryption Over the Integers .” 2017. Thesis, University of Ottawa. Accessed June 24, 2019. http://hdl.handle.net/10393/35977.

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

MLA Handbook (7th Edition):

Pabstel, Melanie Anne. “Parameter Constraints on Homomorphic Encryption Over the Integers .” 2017. Web. 24 Jun 2019.

Vancouver:

Pabstel MA. Parameter Constraints on Homomorphic Encryption Over the Integers . [Internet] [Thesis]. University of Ottawa; 2017. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10393/35977.

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

Council of Science Editors:

Pabstel MA. Parameter Constraints on Homomorphic Encryption Over the Integers . [Thesis]. University of Ottawa; 2017. Available from: http://hdl.handle.net/10393/35977

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


Dublin City University

22. Benger, Naomi. Cryptographic Pairings: Efficiency and DLP security.

Degree: School of Computing, 2010, Dublin City University

 This thesis studies two important aspects of the use of pairings in cryptography, efficient algorithms and security. Pairings are very useful tools in cryptography, originally… (more)

Subjects/Keywords: Computer security; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benger, N. (2010). Cryptographic Pairings: Efficiency and DLP security. (Thesis). Dublin City University. Retrieved from http://doras.dcu.ie/15546/

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

Benger, Naomi. “Cryptographic Pairings: Efficiency and DLP security.” 2010. Thesis, Dublin City University. Accessed June 24, 2019. http://doras.dcu.ie/15546/.

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

MLA Handbook (7th Edition):

Benger, Naomi. “Cryptographic Pairings: Efficiency and DLP security.” 2010. Web. 24 Jun 2019.

Vancouver:

Benger N. Cryptographic Pairings: Efficiency and DLP security. [Internet] [Thesis]. Dublin City University; 2010. [cited 2019 Jun 24]. Available from: http://doras.dcu.ie/15546/.

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

Council of Science Editors:

Benger N. Cryptographic Pairings: Efficiency and DLP security. [Thesis]. Dublin City University; 2010. Available from: http://doras.dcu.ie/15546/

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


University of Toronto

23. Vahlis, Evgene. Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange.

Degree: 2010, University of Toronto

We study several basic problems in cryptography: Leakage resilient cryptography: cryptographic schemes are often broken through side-channel attacks on the devices that run them. Such… (more)

Subjects/Keywords: Cryptography; Theory; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vahlis, E. (2010). Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/26251

Chicago Manual of Style (16th Edition):

Vahlis, Evgene. “Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange.” 2010. Doctoral Dissertation, University of Toronto. Accessed June 24, 2019. http://hdl.handle.net/1807/26251.

MLA Handbook (7th Edition):

Vahlis, Evgene. “Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange.” 2010. Web. 24 Jun 2019.

Vancouver:

Vahlis E. Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange. [Internet] [Doctoral dissertation]. University of Toronto; 2010. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/1807/26251.

Council of Science Editors:

Vahlis E. Cryptography: Leakage Resilience, Black Box Separations, and Credential-free Key Exchange. [Doctoral Dissertation]. University of Toronto; 2010. Available from: http://hdl.handle.net/1807/26251


University of Texas – Austin

24. -4429-2872. Program obfuscation: new applications and constructions from standard assumptions.

Degree: Computer Sciences, 2018, University of Texas – Austin

 Code obfuscation has been one of the main focal points of cryptographic research over the last few years. This proposed thesis studies two different aspects… (more)

Subjects/Keywords: Code obfuscation; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-4429-2872. (2018). Program obfuscation: new applications and constructions from standard assumptions. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/69248

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

Chicago Manual of Style (16th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Thesis, University of Texas – Austin. Accessed June 24, 2019. http://hdl.handle.net/2152/69248.

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

MLA Handbook (7th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Web. 24 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/2152/69248.

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

Council of Science Editors:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/69248

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


Tulane University

25. Fenske, Ellis. Anonymity and Linkability.

Degree: 2018, Tulane University

This thesis considers systems for anonymous communication between users of a cybersystem. Specifically, we consider the scenario where communications generated by the same user repeatedly… (more)

Subjects/Keywords: Anonymity; Privacy; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fenske, E. (2018). Anonymity and Linkability. (Thesis). Tulane University. Retrieved from https://digitallibrary.tulane.edu/islandora/object/tulane:79040

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

Fenske, Ellis. “Anonymity and Linkability.” 2018. Thesis, Tulane University. Accessed June 24, 2019. https://digitallibrary.tulane.edu/islandora/object/tulane:79040.

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

MLA Handbook (7th Edition):

Fenske, Ellis. “Anonymity and Linkability.” 2018. Web. 24 Jun 2019.

Vancouver:

Fenske E. Anonymity and Linkability. [Internet] [Thesis]. Tulane University; 2018. [cited 2019 Jun 24]. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:79040.

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

Council of Science Editors:

Fenske E. Anonymity and Linkability. [Thesis]. Tulane University; 2018. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:79040

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


University of Johannesburg

26. Van der Bank, Dirk Johannes. Die evaluering van 'n aantal kriptologiese algoritmes.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

The main themes of this thesis are the characteristics of natural language, cryptographic algorithms to encipher natural language and possible figures of… (more)

Subjects/Keywords: Cryptography - Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van der Bank, D. J. (2014). Die evaluering van 'n aantal kriptologiese algoritmes. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9730

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

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Thesis, University of Johannesburg. Accessed June 24, 2019. http://hdl.handle.net/10210/9730.

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

MLA Handbook (7th Edition):

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Web. 24 Jun 2019.

Vancouver:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10210/9730.

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

Council of Science Editors:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9730

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


University of Johannesburg

27. Herdan, David Errol. A cryptographically secure protocol for key exchange.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

Since the emergence of electronic communication, scientists have strived to make these communication systems as secure as possible. Classical cryptographical methods provided… (more)

Subjects/Keywords: Cryptography - Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Herdan, D. E. (2014). A cryptographically secure protocol for key exchange. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12037

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

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Thesis, University of Johannesburg. Accessed June 24, 2019. http://hdl.handle.net/10210/12037.

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

MLA Handbook (7th Edition):

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Web. 24 Jun 2019.

Vancouver:

Herdan DE. A cryptographically secure protocol for key exchange. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/10210/12037.

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

Council of Science Editors:

Herdan DE. A cryptographically secure protocol for key exchange. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12037

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


Rochester Institute of Technology

28. Snook, Michael. Integer-based fully homomorphic encryption.

Degree: School of Mathematical Sciences (COS), 2011, Rochester Institute of Technology

  The concept of fully homomorphic encryption has been considered the "holy grail" of cryptography since the discovery of secure public key cryptography in the… (more)

Subjects/Keywords: Cryptography; Encryption; Homomorphic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Snook, M. (2011). Integer-based fully homomorphic encryption. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/7018

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

Snook, Michael. “Integer-based fully homomorphic encryption.” 2011. Thesis, Rochester Institute of Technology. Accessed June 24, 2019. https://scholarworks.rit.edu/theses/7018.

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

MLA Handbook (7th Edition):

Snook, Michael. “Integer-based fully homomorphic encryption.” 2011. Web. 24 Jun 2019.

Vancouver:

Snook M. Integer-based fully homomorphic encryption. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2019 Jun 24]. Available from: https://scholarworks.rit.edu/theses/7018.

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

Council of Science Editors:

Snook M. Integer-based fully homomorphic encryption. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/7018

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


University of Oklahoma

29. Li, Yu-Hsin. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.

Degree: PhD, 2011, University of Oklahoma

 Key generation is an important part of symmetric-key encryption algorithms, such as AES. A key derivation function can be used to generate symmetric cipher session… (more)

Subjects/Keywords: Cryptography; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2011). FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319191

Chicago Manual of Style (16th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Doctoral Dissertation, University of Oklahoma. Accessed June 24, 2019. http://hdl.handle.net/11244/319191.

MLA Handbook (7th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Web. 24 Jun 2019.

Vancouver:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2011. [cited 2019 Jun 24]. Available from: http://hdl.handle.net/11244/319191.

Council of Science Editors:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Doctoral Dissertation]. University of Oklahoma; 2011. Available from: http://hdl.handle.net/11244/319191

30. Dai, Wei. Statistical Methods in Cryptography.

Degree: 2016, University of California – eScholarship, University of California

 Cryptographic assumptions and security goals are fundamentally distributional. As a result, statistical techniques are ubiquitous in cryptographic constructions and proofs. In this thesis, we build… (more)

Subjects/Keywords: Computer science; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dai, W. (2016). Statistical Methods in Cryptography. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/8j949628

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

Dai, Wei. “Statistical Methods in Cryptography.” 2016. Thesis, University of California – eScholarship, University of California. Accessed June 24, 2019. http://www.escholarship.org/uc/item/8j949628.

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

MLA Handbook (7th Edition):

Dai, Wei. “Statistical Methods in Cryptography.” 2016. Web. 24 Jun 2019.

Vancouver:

Dai W. Statistical Methods in Cryptography. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2019 Jun 24]. Available from: http://www.escholarship.org/uc/item/8j949628.

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

Council of Science Editors:

Dai W. Statistical Methods in Cryptography. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/8j949628

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

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

.