{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:17:26Z","timestamp":1768267046557,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0304-3975(91)90074-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"83-98","source":"Crossref","is-referenced-by-count":27,"title":["The complexity of Grigorchuk groups with application to cryptography"],"prefix":"10.1016","volume":"88","author":[{"given":"Max","family":"Garzon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yechezkel","family":"Zalcstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90074-C_BIB1","first-page":"18","article-title":"Group languages","volume":"4","author":"Anisimov","year":"1971","journal-title":"Kibernetika"},{"key":"10.1016\/0304-3975(91)90074-C_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00263767","article-title":"Subrekursive komplexit\u00e4t bei gruppen","volume":"9","author":"Avenhaus","year":"1977","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0304-3975(91)90074-C_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = NP? question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90074-C_BIB4","first-page":"1","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986","journal-title":"Proc. 18th STOC"},{"key":"10.1016\/0304-3975(91)90074-C_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/1970530","article-title":"Word problems and recursively enumerable degrees of unsolvability","volume":"84","author":"Boone","year":"1966","journal-title":"Ann. of Math."},{"issue":"4","key":"10.1016\/0304-3975(91)90074-C_BIB6","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/358027.358052","article-title":"Digital signatures with RSA and other PKCs","volume":"27","author":"Denning","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(91)90074-C_BIB7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01388581","article-title":"The accessibility of finitely presented groups","volume":"81","author":"Dunwoody","year":"1985","journal-title":"Invent. Math."},{"key":"10.1016\/0304-3975(91)90074-C_BIB8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1070\/IM1985v025n02ABEH001281","article-title":"Degrees of growth of finitely generated groups and the theory of invariant means","volume":"25","author":"Grigorchuk","year":"1985","journal-title":"Math. USSR-Izv."},{"key":"10.1016\/0304-3975(91)90074-C_BIB9","series-title":"Introduction to Automata theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(91)90074-C_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1070\/IM1982v019n01ABEH001405","article-title":"A finitely presented group with unsolvable word problem","volume":"19","author":"Kharlampovich","year":"1982","journal-title":"Math. USSR-Izv."},{"key":"10.1016\/0304-3975(91)90074-C_BIB11","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/322017.322031","article-title":"Word problems solvable in logspace","volume":"24","author":"Lipton","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90074-C_BIB12","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"issue":"2","key":"10.1016\/0304-3975(91)90074-C_BIB13","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0217025","article-title":"The notion of security for probabilistic cryptosystems","volume":"17","author":"Micali","year":"1988","journal-title":"Siam J. Comput."},{"key":"10.1016\/0304-3975(91)90074-C_BIB14","first-page":"685","article-title":"Advanced Problem 3603","volume":"75","author":"Milnor","year":"1968","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(91)90074-C_BIB15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","article-title":"Groups, the theory of ends and context-free languages","volume":"26","author":"Muller","year":"1983","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(91)90074-C_BIB16","series-title":"Ph.D thesis","article-title":"Syntaxe des Langages de Chomsky","author":"Sakarovitch","year":"1979"},{"key":"10.1016\/0304-3975(91)90074-C_BIB17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between deterministic and nondeterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90074-C_BIB18","series-title":"Foundations of Computation Theory","first-page":"417","article-title":"Word problems for groups and context-free languages","author":"Simon","year":"1979"},{"key":"10.1016\/0304-3975(91)90074-C_BIB19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0021-8693(72)90058-0","article-title":"Free subgroups in linear groups","volume":"20","author":"Tits","year":"1972","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(91)90074-C_BIB20","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01069218","article-title":"Growth function of some classes of languages","volume":"17","author":"Trofimov","year":"1981","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(91)90074-C_BIB21","series-title":"Mathematical Foundations of Computer Science","first-page":"432","article-title":"On polynomial reducibility of word problems under embedding of recursively presented groups in finitely presented groups","volume":"Vol. 32","author":"Valiev","year":"1975"},{"key":"10.1016\/0304-3975(91)90074-C_BIB22","series-title":"Fundamentals of Computation Theory","first-page":"467","article-title":"Tape complexity of word problems (extended abstract)","volume":"Vol. 117","author":"Waack","year":"1981"},{"key":"10.1016\/0304-3975(91)90074-C_BIB23","series-title":"Tape Complexity of Word Problems","author":"Waack","year":"1981"},{"key":"10.1016\/0304-3975(91)90074-C_BIB24","series-title":"Proc. CRYPTO'84","first-page":"19","article-title":"A public-key cryptosystem based on the word problem","volume":"Vol. 196","author":"Wagner","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190074C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190074C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T16:37:57Z","timestamp":1681835877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190074C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["030439759190074C"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90074-c","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}