{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:55:02Z","timestamp":1794336902270,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540636960","type":"print"},{"value":"9783540696285","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0028492","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T03:09:54Z","timestamp":1132628994000},"page":"369-380","source":"Crossref","is-referenced-by-count":35,"title":["Asymmetric cryptography with S-Boxes Is it easier than expected to design efficient asymmetric cryptosystems?"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Eli Biham, Adi Shamir, Differential Cryptanalysis of the full 16-Round DES, CRYPTO'92, Springer-Verlag, pp. 487\u2013496.","DOI":"10.1007\/3-540-48071-4_34"},{"key":"36_CR2","unstructured":"Ian Blake, XuHong Gao, Ronald Mullin, Scott Vanstone, Tomik Yaghoobian, Applications of finite Fields, Kluwer Academic Publishers, p. 25."},{"key":"36_CR3","unstructured":"Matthew Dickerson, The functional Decomposition of Polynomials, Ph.D Thesis, TR 89-1023, Department of Computer Science, Cornell University, Ithaca, NY, July 1989."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Matthew Dickerson, The Inverse of an Automorphism in polynomial Time, IEEE 30th annual symposium on Foundations of Computer Science (FOGS), 1989, pp. 82\u201387.","DOI":"10.1109\/SFCS.1989.63459"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Harriet Fell and Whitfield Diffie, Analysis of a public Key Approach based on polynomial Substitutions, CRYPTO'85, Springer-Verlag, pp. 340\u2013349.","DOI":"10.1007\/3-540-39799-X_24"},{"key":"36_CR6","unstructured":"Michael Garey, David Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, Freeman, p. 251."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Henri Gilbert, Pascal Chauvaud, A chosen Plaintext Attack of the 16-Round Khufu Cryptosystem, CRYPTO'94, Springer-Verlag, pp. 359\u2013368.","DOI":"10.1007\/3-540-48658-5_33"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Joe Kilian, Phillip Rogaway, How to protect DES against eshaustive Key Search, CRYPTO'96, Springer-Verlag, pp. 252\u2013267.","DOI":"10.1007\/3-540-68697-5_20"},{"key":"36_CR9","unstructured":"Rudolf Lidl, Harald Niederreiter, Finite Fields, Encyclopedia of Mathematics and its applications, volume 20, Cambridge University Press, p. 287."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Tsutomu Matsumoto, Hideki Imai, Public quadratic polynomial-Tuples for efficient Signature-Verification and Message-Encryption, EUCROCRYPT'88, Springer-Verlag, pp. 419\u2013453.","DOI":"10.1007\/3-540-45961-8_39"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Cryptanalysis of the Matsumoto and Imai public Key Scheme of Eurocrypt'88, CRYPTO'95, Springer-Verlag, pp. 248\u2013261.","DOI":"10.1007\/3-540-44750-4_20"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of asymmetric Algorithms, EUROCRYPT'96, Springer-Verlag, pp. 33\u201348.","DOI":"10.1007\/3-540-68339-9_4"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Jacques Patarin, Asymmetric Cryptography with a hidden Monomial, CRYPTO'96, Springer-Verlag, pp. 45\u201360.","DOI":"10.1007\/3-540-68697-5_4"},{"key":"36_CR14","unstructured":"Jacques Patarin, Louis Goubin, Trapdoor one-way permutations and multivariate polynomials, IC ICS'97 (this conference)."},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0747-7171(08)80014-4","volume":"9","author":"J. Gathen von zur","year":"1990","unstructured":"Joachim von zur Gathen, Functional Decomposition of Polynomials: the tame Case, J. Symbolic Computation (1990), vol. 9, pp. 281\u2013299.","journal-title":"J. Symbolic Computation"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0747-7171(08)80054-5","volume":"10","author":"J. Gathen von zur","year":"1990","unstructured":"Joachim von zur Gathen, Functional Decomposition of Polynomials: the wild Case, J. Symbolic Computation (1990), vol. 10, pp. 437\u2013452.","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:58:33Z","timestamp":1586559513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540636960","9783540696285"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0028492","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0028456","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}