{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-5227"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-5227","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"A Survey of Code-Based Cryptography","abstract":"One of the biggest concerns of the digital era is to keep data secure. With the rise of quantum computers, some of the problems that were considered hard will be solved in polynomial time. Therefore, efforts are taken to design practical cryptosystems that will resist attacks from both classical computers and quantum computers. In this thesis, we analyze three quantum-resistant code-based cryptosystems. We propose a new type of attack based on mixed-integer non-convex programming for the NIST submission FuLeeca.","abstract_html":"One of the biggest concerns of the digital era is to keep data secure. With the rise of quantum computers, some of the problems that were considered hard will be solved in polynomial time. Therefore, efforts are taken to design practical cryptosystems that will resist attacks from both classical computers and quantum computers. In this thesis, we analyze three quantum-resistant code-based cryptosystems. We propose a new type of attack based on mixed-integer non-convex programming for the NIST submission FuLeeca.","abstract_has_math":false,"creators":["Rakotondrafara, Antsa"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"School of Mathematical and Statistical Sciences","degree_department":null,"school":null,"contributors":["Dr. Ryann Cartor","Dr. Shuhong Gao","Dr. Jim Coykendall","Dr. Rafael D’Oliveira","Dr. Felice Manganiello"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:31:12Z","subjects":["cryptography","mathematics","cryptanalysis","FuLeeca","McEliece"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/4163","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/4163","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://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-5227","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Ryann Cartor","Dr. Shuhong Gao","Dr. Jim Coykendall","Dr. Rafael D’Oliveira","Dr. Felice Manganiello"]},{"key":"dc:creator","label":"Author","values":["Rakotondrafara, Antsa"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-12-06T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2023-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["School of Mathematical and Statistical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["cryptography","mathematics","cryptanalysis","FuLeeca","McEliece"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/4163"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["One of the biggest concerns of the digital era is to keep data secure. With the rise of quantum computers, some of the problems that were considered hard will be solved in polynomial time. Therefore, efforts are taken to design practical cryptosystems that will resist attacks from both classical computers and quantum computers. In this thesis, we analyze three quantum-resistant code-based cryptosystems. We propose a new type of attack based on mixed-integer non-convex programming for the NIST submission FuLeeca."]},{"key":"dc:title","label":"Title","values":["A Survey of Code-Based Cryptography"]}]}],"canonical_facts":{"dc:contributor":["Dr. Ryann Cartor","Dr. Shuhong Gao","Dr. Jim Coykendall","Dr. Rafael D’Oliveira","Dr. Felice Manganiello"],"dc:creator":["Rakotondrafara, Antsa"],"dc:date.available":["2023-12-06T08:00:00Z"],"dc:date.created":["2023-12-01T08:00:00Z"],"dc:description.abstract":["One of the biggest concerns of the digital era is to keep data secure. With the rise of quantum computers, some of the problems that were considered hard will be solved in polynomial time. Therefore, efforts are taken to design practical cryptosystems that will resist attacks from both classical computers and quantum computers. In this thesis, we analyze three quantum-resistant code-based cryptosystems. We propose a new type of attack based on mixed-integer non-convex programming for the NIST submission FuLeeca."],"dc:identifier":["https://open.clemson.edu/all_theses/4163"],"dc:subject":["cryptography","mathematics","cryptanalysis","FuLeeca","McEliece"],"dc:title":["A Survey of Code-Based Cryptography"],"thesis:degree_discipline":["School of Mathematical and Statistical Sciences"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:31:12Z"}