{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:43:45Z","timestamp":1776858225265,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_28","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"470-485","source":"Crossref","is-referenced-by-count":47,"title":["New Public Key Cryptosystem Using Finite Non Abelian Groups"],"prefix":"10.1007","author":[{"given":"Seong-Hun","family":"Paeng","sequence":"first","affiliation":[]},{"given":"Kil-Chan","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Jae Heon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Seongtaek","family":"Chee","sequence":"additional","affiliation":[]},{"given":"Choonsik","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"I. Anshel, M. Anshel, D. Goldfeld An algebraic method for public-key cryptography, Mathematical Research Letters 6 (1999), 1\u20135","journal-title":"Mathematical Research Letters"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"S. Blackburn, S. Galbraith Cryptanalysis of two cryptsystems based on group actions, Proc. ASIACRYPT\u2019 99 (2000), 52\u201361","DOI":"10.1007\/978-3-540-48000-6_6"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"A. E. Brower, R. Pellikaan, E. R. Verheul Doing more with fewer bits, Proc. ASIACRYPT\u2019 99 (2000), 321\u2013332","DOI":"10.1007\/978-3-540-48000-6_26"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coopersmith","year":"1986","unstructured":"D. Coopersmith, A. M. Odlzyko, R. Schroeppel Discrete logarithms in GF(p), Algorithmica, 1 (1986), 1\u201315","journal-title":"Algorithmica"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions andInformation Theory, 31 (1985), 469\u2013472","journal-title":"IEEE Transactions andInformation Theory"},{"key":"28_CR6","unstructured":"S. Flannery Cryptography:An investigation of a new algorithm vs. the RSA, http:\/\/cryptome.org\/flannery-cp.pdf , 1999"},{"key":"28_CR7","unstructured":"T. W. Hungerford Algebra, Springer-Verlag"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra, E. R. Verheul. The XTR public key system, Proc. Crypto 2000 (2000), 1\u201320","DOI":"10.1007\/3-540-44598-6_1"},{"key":"28_CR9","unstructured":"A. J. Menezes, P. C. Van Oorshot, S. A. Vanstone Handbook of applied cryptography, CRC press, 1997"},{"key":"28_CR10","unstructured":"R. Lidl, H. Niederreiter Introduction to finite fields and their application, Cambridge University press, 1986"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J.-S. Kang, C. Park New public-key cryptosystem using braid groups, Proc. Crypto 2000 (2000), 166\u2013184","DOI":"10.1007\/3-540-44598-6_10"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz Elliptic curve crypto systems, Mathematics of Computation, 48 (1987), 203\u2013209","journal-title":"Mathematics of Computation"},{"key":"28_CR13","first-page":"417","volume":"85","author":"V. Miller","year":"1986","unstructured":"V. Miller Use of elliptic curves in cryptography, Proc. Crypto 85 (1986), 417\u2013426","journal-title":"Proc. Crypto"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"K. Nyberg, R. Rueppel A new signature scheme based on DSA giving message recovery, 1st ACM Conference on Computer and Communications Security, (1993), 58\u201361","DOI":"10.1145\/168588.168595"},{"key":"28_CR15","unstructured":"S.-H. Paeng, J.-W. Han, B. E. Jung \u201cThe security of XTR in view of the determinant\u201d, preprint, 2001"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"S.-H. Paeng \u201cA provably secure public key cryptosystem using finite non abelian groups\u201d, preprint, 2001","DOI":"10.1007\/3-540-44647-8_28"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"23","author":"S. C. Pohlig","year":"1978","unstructured":"S. C. Pohlig, M. E. Hellman An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, 23 (1978), 106\u2013110","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard Monte Carlo methods for index computation (mod p), Mathematics of computation, 32 (1978), 918\u2013924","journal-title":"Mathematics of computation"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, L. M. Adleman A method for digital signature and public-key crypto systems, Communications of the ACM, 21 (1978), 120\u2013126","journal-title":"Communications of the ACM"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"A. Yamamura Public key cryptsystems using the modular group, PKC\u201998, 203\u2013216","DOI":"10.1007\/BFb0054026"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:10Z","timestamp":1556950930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}