{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:28:22Z","timestamp":1729668502474,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/iscc.2009.5202365","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:08:22Z","timestamp":1251126502000},"page":"200-205","source":"Crossref","is-referenced-by-count":3,"title":["A public key algorithm for optical communication based on lattice cryptography"],"prefix":"10.1109","author":[{"given":"Walid","family":"Abdallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Hamdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noureddine","family":"Boudriga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.07.026"},{"key":"16","article-title":"la cryptographie militaire","volume":"9","author":"kerckhoffs","year":"1883"},{"key":"13","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1109\/JLT.2003.814932","article-title":"novel combinatorial construction of optical orthogonal codes for incoherent optical cdma system","volume":"21","author":"ivan","year":"2003","journal-title":"Journal of Lightwave Technology"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"11","article-title":"a public-key cryptosystem with worstcase\/average-case equivalence","author":"ajtai","year":"1997","journal-title":"Proc IEEE Ann Symp Foundations of Computer Science (FOCS)"},{"key":"12","first-page":"99","article-title":"generating hard instances of lattice problems","author":"ajtai","year":"1996","journal-title":"Proc 28th ACM Symp on Theory of Computing"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1049\/el:20051830"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2005.844504"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2004.838844"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2008.4598751"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2008.4598368"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2008.4528656"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2006.215911"},{"key":"9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0054868","article-title":"ntru: a ring-based public key cryptosystern","volume":"1423","author":"hoffstein","year":"1998","journal-title":"Lecture Notes in Comput Sci Springer"},{"key":"8","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","article-title":"public-key cryptosystems from lattice reduction problems","volume":"1294","author":"goldreich 0","year":"1997","journal-title":"Lecture Notes in Comput Sci Springer"}],"event":{"name":"2009 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2009,7,5]]},"location":"Sousse, Tunisia","end":{"date-parts":[[2009,7,8]]}},"container-title":["2009 IEEE Symposium on Computers and Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179146\/5202209\/05202365.pdf?arnumber=5202365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:05:24Z","timestamp":1497827124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5202365\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/iscc.2009.5202365","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}