{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:52:39Z","timestamp":1725547959021},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1109\/glocom.2009.5425773","type":"proceedings-article","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T16:49:02Z","timestamp":1268066942000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A New Construction of Knapsack Pkc by Using a Random Sequence"],"prefix":"10.1109","author":[{"given":"Yasuyuki","family":"Murakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"207","article-title":"Knapsack Public-Key Cryptosystem using Chinese Remainder Theorem","author":"murakami","year":"2006","journal-title":"Proc 29th Symposium on Information Theory and Its Applications SITA2006"},{"key":"ref11","first-page":"1","article-title":"A New Construction of Knapsack Cryptosystem","author":"kasahara","year":"2007","journal-title":"IEICE Technical Report ISEC2007&#x2013;89"},{"key":"ref12","first-page":"1","article-title":"A Note on Security on KMN PKC and Presentation of Challenge Problems","author":"kasahara","year":"2008","journal-title":"IEICE Technical Report ISEC 2008&#x2013;16"},{"key":"ref13","article-title":"Knapsack Public-Key Cryptosystems with Cyclic Code over Finite Field","author":"nasako","year":"2008","journal-title":"Proc 31th Symposium on Information Theory and Its Applications SITA2008"},{"key":"ref4","article-title":"Use of Elliptic Curves in Cryptography","author":"miller","year":"1985","journal-title":"Proc CRYPTO'85"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055927"},{"journal-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","year":"1994","author":"shor","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2461"},{"key":"ref7","first-page":"279","author":"shamir","year":"1982","journal-title":"Proc Crypto'82"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_4"}],"event":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","start":{"date-parts":[[2009,11,30]]},"location":"Honolulu, Hawaii","end":{"date-parts":[[2009,12,4]]}},"container-title":["GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5425207\/5425208\/05425773.pdf?arnumber=5425773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T04:55:40Z","timestamp":1489899340000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5425773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/glocom.2009.5425773","relation":{},"subject":[],"published":{"date-parts":[[2009,11]]}}}