{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/266"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/266","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Design of a novel hybrid cryptographic processor","abstract":"A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems.","abstract_html":"A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems.","abstract_has_math":false,"creators":["Li, Jianzhou","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Li, Hua"],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005","date_published":"2005","updated_at":"2026-11-18T19:29:59Z","subjects":["Dissertations, Academic","Data encryption (Computer science)","Cryptogaphy -- Mathematics","Computer security"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/266"],"render_values":[{"text":"hdl:10133/266","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/266","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/266","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F266","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Li, Hua"]},{"key":"dc:creator","label":"Author","values":["Li, Jianzhou","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2007-05-17T14:49:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2007-05-17T14:49:40Z"]},{"key":"dc:date.issued","label":"Date","values":["2005"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Dissertations, Academic","Data encryption (Computer science)","Cryptogaphy -- Mathematics","Computer security"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:10133/266"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/266"]},{"key":"mods:identifier.uri","label":"Mods Identifier URI","values":["https://hdl.handle.net/10133/266"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["viii, 87 leaves : ill. (some col.) ; 28 cm."]},{"key":"dc:description.abstract","label":"Abstract","values":["A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems."]},{"key":"dc:description.other","label":"Dc Description Other","values":["A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems."]},{"key":"dc:title","label":"Title","values":["Design of a novel hybrid cryptographic processor"]},{"key":"mods:dateaccessioned","label":"Mods Dateaccessioned","values":["2007-05-17T14:49:40Z"]},{"key":"mods:dateavailable","label":"Mods Dateavailable","values":["2007-05-17T14:49:40Z"]},{"key":"mods:languageterm.rfc3066","label":"Mods Languageterm RFC 3066","values":["en_US"]},{"key":"mods:namepart","label":"Mods Namepart","values":["Li, Hua","Li, Jianzhou","University of Lethbridge. Faculty of Arts and Science"]},{"key":"mods:roleterm.text","label":"Mods Roleterm Text","values":["supervisor","author"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Li, Hua"],"dc:creator":["Li, Jianzhou","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2007-05-17T14:49:40Z"],"dc:date.available":["2007-05-17T14:49:40Z"],"dc:date.issued":["2005"],"dc:description":["viii, 87 leaves : ill. (some col.) ; 28 cm."],"dc:description.abstract":["A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems."],"dc:description.other":["A new multiplier that supports fields GF(p) and GF (2n) for the public-key cryptography, and fields GF (28) for the secret-key cryptography is proposed in this thesis. Based on the core multiplier and other extracted common operations, a novel hybrid crypto-processor is built which processes both public-key and secret-key cryptosystems. The corresponding instruction set is also presented. Three cryptographic algorithms: the Elliptic Curve Cryptography (ECC), AES and RC5 are focused to run in the processor. To compute scalar multiplication kP efficiently, a blend of efficient algorthms on elliptic curves and coordinates selections and of hardware architecture that supports arithmetic operations on finite fields is requried. The Nonadjacent Form (NAF) of k is used in Jacobian projective coordinates over GF(p); Montgomery scalar multiplication is utilized in projective coordinates over GF(2n). The dual-field multiplier is used to support multiplications over GF(p) and GF(2n) according to multiple-precision Montgomery multiplications algorithms. The design ideas of AES and RC5 are also described. The proposed hybrid crypto-processor increases the flexibility of security schemes and reduces the total cost of cryptosystems."],"dc:identifier":["hdl:10133/266"],"dc:identifier.uri":["https://hdl.handle.net/10133/266"],"dc:language.iso":["en_US"],"dc:publisher":["Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:subject":["Dissertations, Academic","Data encryption (Computer science)","Cryptogaphy -- Mathematics","Computer security"],"dc:title":["Design of a novel hybrid cryptographic processor"],"dc:type":["Thesis"],"mods:dateaccessioned":["2007-05-17T14:49:40Z"],"mods:dateavailable":["2007-05-17T14:49:40Z"],"mods:identifier.uri":["https://hdl.handle.net/10133/266"],"mods:languageterm.rfc3066":["en_US"],"mods:namepart":["Li, Hua","Li, Jianzhou","University of Lethbridge. Faculty of Arts and Science"],"mods:roleterm.text":["supervisor","author"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-18T19:29:59Z"}