{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-project-5131"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-project-5131","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Quantum cryptography","abstract":"This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates.","abstract_html":"This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch&#x27;s problem which allows one to select from amongst the parallel paths a quantum computer calculates.","abstract_has_math":false,"creators":["Dinu, Razvan Augustin"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Freiling, Chris","Dunn, Correy","Trapp, Ronald, and Williams, Peter"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:08:39Z","subjects":["Cryptography","Quantum computers","Turing machines","Computational complexity","Quantum communication","Quantum theory","Coding theory","Computer algorithms","Information theory","Turing machines.","Information Security"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd-project/4047","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd-project/4047","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-project-5131","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Freiling, Chris","Dunn, Correy","Trapp, Ronald, and Williams, Peter"]},{"key":"dc:creator","label":"Author","values":["Dinu, Razvan Augustin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2013-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cryptography","Quantum computers","Turing machines","Computational complexity","Quantum communication","Quantum theory","Coding theory","Computer algorithms","Information theory","Turing machines.","Information Security"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd-project/4047"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates."]},{"key":"dc:title","label":"Title","values":["Quantum cryptography"]}]}],"canonical_facts":{"dc:contributor":["Freiling, Chris","Dunn, Correy","Trapp, Ronald, and Williams, Peter"],"dc:creator":["Dinu, Razvan Augustin"],"dc:date.created":["2013-01-01T08:00:00Z"],"dc:description.abstract":["This study builds a case for using a quantum computer for solving cryptographic problems. It looks at the quantum turing machine concept, explores why use quantum computers and presents Deutsch's problem which allows one to select from amongst the parallel paths a quantum computer calculates."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd-project/4047"],"dc:subject":["Cryptography","Quantum computers","Turing machines","Computational complexity","Quantum communication","Quantum theory","Coding theory","Computer algorithms","Information theory","Turing machines.","Information Security"],"dc:title":["Quantum cryptography"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:08:39Z"}