{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:26:38Z","timestamp":1777645598470,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2016,12,24]]},"abstract":"<jats:p>\n                    We present a method of generating primes r \u2261 1 (mod n), q and a Weil q-number \u03c0 such that r divides \u03a6\n                    <jats:sub>n<\/jats:sub>\n                    ( q) and r divides | A(\ud835\udd3d\n                    <jats:sub>q<\/jats:sub>\n                    )|, where A\/\ud835\udd3d\n                    <jats:sub>q<\/jats:sub>\n                    is an ordinary abelian variety defined over a finite \ud835\udd3d\n                    <jats:sub>q<\/jats:sub>\n                    corresponding to \u03c0. Such primes can be used for implementing pairing-based cryptographic systems.\n                  <\/jats:p>","DOI":"10.3233\/fi-2016-1453","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T10:59:56Z","timestamp":1482836396000},"page":"385-400","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Pairing-Friendly Primes for Abelian Varieties"],"prefix":"10.1177","volume":"149","author":[{"given":"Maciej","family":"Grze\u015bkowiak","sequence":"first","affiliation":[{"name":"Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Umultowska 87, 61-614 Pozna\u0144, Poland."}]}],"member":"179","published-online":{"date-parts":[[2016,12,24]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1453","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2016-1453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:40Z","timestamp":1777444360000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2016-1453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,24]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12,24]]}},"alternative-id":["10.3233\/FI-2016-1453"],"URL":"https:\/\/doi.org\/10.3233\/fi-2016-1453","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,24]]}}}