Toward a theory of one -way functions via gate complexity of Boolean functions
One of the most important properties of a cryptographic system is a proof of its security. There are two types of security: information (or theoretical) security and computational (or practical) security. The focus of this work is on provable computational security via gate (or circuit) complexity o...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
ProQuest Dissertations & Theses
01.01.2006
|
| Subjects: | |
| ISBN: | 9780542377037, 0542377039 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | One of the most important properties of a cryptographic system is a proof of its security. There are two types of security: information (or theoretical) security and computational (or practical) security. The focus of this work is on provable computational security via gate (or circuit) complexity of Boolean functions. The computational security of public-key cryptographic systems depends fundamentally on trapdoor one-way functions. However, the existence of such functions has yet to be proved. Informally speaking, a trapdoor one-way function is an efficiently-computable function such that there are no efficient algorithms for inverting it unless some extra information, known as trapdoor information, is available. It is important to realize that the so-called "trapdoor one-way functions" used in modern cryptographic systems (to perform financial transactions over the Internet, for example) are good candidates, at best. There is no formal proof that these candidates are de facto trapdoor one-way functions. For example, security proofs for one of the most widely used public-key cryptographic systems, namely, the RSA, are based on the unproven assumption that large numbers cannot be factored efficiently. Therefore, it is not safe to base the security of large economic systems on such assumptions. Thus, from a cryptographical point of view, the crucial problem in gate complexity theory is to prove nontrivial lower bounds on the complexity of breaking practical cryptographic systems, for example, one-way functions. In this work we argue that the theory of circuit complexity of Boolean functions provides the mathematical background to achieve provable computational security. Among computational models, the circuit model has an especially simple definition and may be more amenable to combinatorial analysis. The gate complexity of permutations of GF(2 n) and of linear and quadratic Boolean functions is studied by deriving bounds on the number of modulo-two additions and multiplications necessary to realize them. |
|---|---|
| AbstractList | One of the most important properties of a cryptographic system is a proof of its security. There are two types of security: information (or theoretical) security and computational (or practical) security. The focus of this work is on provable computational security via gate (or circuit) complexity of Boolean functions. The computational security of public-key cryptographic systems depends fundamentally on trapdoor one-way functions. However, the existence of such functions has yet to be proved. Informally speaking, a trapdoor one-way function is an efficiently-computable function such that there are no efficient algorithms for inverting it unless some extra information, known as trapdoor information, is available. It is important to realize that the so-called "trapdoor one-way functions" used in modern cryptographic systems (to perform financial transactions over the Internet, for example) are good candidates, at best. There is no formal proof that these candidates are de facto trapdoor one-way functions. For example, security proofs for one of the most widely used public-key cryptographic systems, namely, the RSA, are based on the unproven assumption that large numbers cannot be factored efficiently. Therefore, it is not safe to base the security of large economic systems on such assumptions. Thus, from a cryptographical point of view, the crucial problem in gate complexity theory is to prove nontrivial lower bounds on the complexity of breaking practical cryptographic systems, for example, one-way functions. In this work we argue that the theory of circuit complexity of Boolean functions provides the mathematical background to achieve provable computational security. Among computational models, the circuit model has an especially simple definition and may be more amenable to combinatorial analysis. The gate complexity of permutations of GF(2 n) and of linear and quadratic Boolean functions is studied by deriving bounds on the number of modulo-two additions and multiplications necessary to realize them. |
| Author | Interlando, J Carmelo |
| Author_xml | – sequence: 1 givenname: J surname: Interlando middlename: Carmelo fullname: Interlando, J Carmelo |
| BookMark | eNpFjctOwzAQRS0BElDyDxb7SGOPE8dLqHhJFWyyr-xk3KYKdokdSv-eCpBYnc05916z8xADnbHC6AYqJVFrQH3JipQGBwAGEZS8Yq9tPNip55bnLcXpyKPnp5CXB3vkfg5dHmJI_HOwfGMz8S6-70f6GvKPeR_jSDb8izfswtsxUfHHBWsfH9rlc7l6e3pZ3q3Kbd3IUhtBplMKetFZMNQYEIL6zmFFApSRziNZclJZlLVD39cVNUIL41XtBOKC3f7O7qf4MVPK612cp3B6XCNUCKBR4jdHW0v7 |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH 0ON ABQRF AFLLJ AFOKG ARAPS BGLVJ CBPLH EU9 G20 HCIFZ M8- PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional Dissertations & Theses @ University of Notre Dame Technology Collection - hybrid linking SciTech Premium Collection - hybrid linking Advanced Technologies & Aerospace Collection - hybrid linking Advanced Technologies & Computer Science Collection ProQuest Technology Collection ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global SciTech Premium Collection ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Advanced Technologies & Aerospace Collection Technology Collection ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global Dissertations & Theses Europe Full Text: Science & Technology ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition Dissertations & Theses @ University of Notre Dame ProQuest Central (New) ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) |
| DatabaseTitleList | Advanced Technologies & Aerospace Collection |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| ExternalDocumentID | 1014335661 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BD 0BH 0ON ALMA_UNASSIGNED_HOLDINGS ARAPS BGLVJ CBPLH EU9 G20 HCIFZ M8- PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI |
| ID | FETCH-LOGICAL-h682-791e9c440d1ca09e89011edcb35e10492bf3eaeb24a326b3fd65e81719f46b133 |
| IEDL.DBID | G20 |
| ISBN | 9780542377037 0542377039 |
| IngestDate | Mon Jun 30 05:12:18 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h682-791e9c440d1ca09e89011edcb35e10492bf3eaeb24a326b3fd65e81719f46b133 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 305300732 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_305300732 |
| PublicationCentury | 2000 |
| PublicationDate | 20060101 |
| PublicationDateYYYYMMDD | 2006-01-01 |
| PublicationDate_xml | – month: 01 year: 2006 text: 20060101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2006 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib000933042 ssib016427513 |
| Score | 1.4330006 |
| Snippet | One of the most important properties of a cryptographic system is a proof of its security. There are two types of security: information (or theoretical)... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Electrical engineering Mathematics |
| Title | Toward a theory of one -way functions via gate complexity of Boolean functions |
| URI | https://www.proquest.com/docview/305300732 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwED1BYQAGvgUUkAdWizhxnHhC4qNiIWLo0K1ynLOohBJo2kL_PbabtJWQWBiteLCc8_ne3Ts_gBsVhIohM9Spc1NuUNBcCEdcYwZjJgRq5cUmkixLBwP52nBz6oZW2fpE76iLSrsc-a21y8iVlcK7j0_qRKNccbVR0NiELddc63t916OfBVhvxxYYhMlCadDGKWGUWGOXzRs87Tj55ZL9PdPb_-cKD2Dvca2-fggbWB7B7svyadb6GLK-J8oSRXwP45xUhlQlEvql5sTdct4QyWykiMuwEc85x28brLuZ91X1jqpcTTyBfu-p__BMG1EF-iZcMC0ZSs15UDCtAompaz3FQudRjBaZyTA3ESoLt7mygV0emULEmLKEScNFbgHtKXRKu6ozIBxjFUfCwusg5ToREjFPY11YFyEKE6bn0G33adgcjHq43KSLP792YWeV67iEzmQ8xSvY1rPJqB5f-9_8A-jIryc |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwELaqgsRj4C2gPDzAGFE7iRMPCAlK1aptxJChW-Q4F1EJJdCUlv4nfiS227SVkNg6MFr2kPje57v7ELoRdSoIkNTS6NyWkwKzYsZ04RpJwSWMgRQGbMILAr_f5y8V9F32wuiyylInGkWd5FLnyO8UX9r6WYk-vH9YGjRKP66WCBozrujAdKIituK-3VDkvaW0-Rw-taw5qID1yrQzyQlw6Tj1hEhR5-Dr1ktIZGy7oCITTuPUBqHCTUcoxya204S54BOP8NRhMdHpT6XwNxw96E63Fq86W7PcQLlWcQj1ZsCGyi2itqdki89H_pRr75cFMGatufe_LmQf7TZWqgcOUAWyQ7TTWwyeLY5QEJoyYCyw6dCc4jzFeQbYmogp1jbciBkeDwTW-UNsKurhS4Ui-uRjnr-ByJYHj1G4jp85QdVMfdUpwg64wrUZ4xpxQHqMA8S-KxOlAFmSUv8M1UqyRHOxL6IFTc7_3L1GW62w14267aBTQ9vLrM4Fqo6Gn3CJNuV4NCiGV4bDMIrWTMAfo0gKaA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Toward+a+theory+of+one+-way+functions+via+gate+complexity+of+Boolean+functions&rft.DBID=053%3B0BH%3B0ON%3BABQRF%3BAFLLJ%3BAFOKG%3BARAPS%3BBGLVJ%3BCBPLH%3BEU9%3BG20%3BHCIFZ%3BM8-%3BPHGZM%3BPHGZT%3BPKEHL%3BPQEST%3BPQGLB%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Interlando%2C+J+Carmelo&rft.date=2006-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9780542377037&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=1014335661 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780542377037/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780542377037/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780542377037/sc.gif&client=summon&freeimage=true |