{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:41Z","timestamp":1753885001905,"version":"3.41.2"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","funder":[{"name":"TWAS UNESCO","award":["20-063 RG\/MATHS\/AF\/AC-I"],"award-info":[{"award-number":["20-063 RG\/MATHS\/AF\/AC-I"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> We propose in this work a Sieve algorithm that we called OrthogonalInteger sieve algorithm for some orthogonal integer lattices and particularly the case of integer lattices [Formula: see text], root lattices of type [Formula: see text] ([Formula: see text]) and of type [Formula: see text] ([Formula: see text]). In these cases, we use the famous [Formula: see text] algorithm to find the shortest vector of these lattices. Indeed, in general, a sieve algorithm builds a list of short random vectors which are not necessarily in the lattice, and try to produce short lattice vectors by taking linear combinations of the vectors in the list. But in our case, we built a list of short vectors in the lattice. From the first column of the [Formula: see text]-reduced basis of the considered basis, we have the list of at least [Formula: see text] and at most [Formula: see text] short vectors for the general case (where [Formula: see text] is the dimension of the lattice) of orthogonal integer lattices [Formula: see text]. For the lattices [Formula: see text], [Formula: see text] ([Formula: see text]) and [Formula: see text] ([Formula: see text]), we have, respectively, [Formula: see text], [Formula: see text] and [Formula: see text] short vectors. The proposed sieve algorithm for integer lattice [Formula: see text] runs in space [Formula: see text] and the OrthogonalInteger sieve algorithm performs [Formula: see text] arithmetic operations and is polynomial in space. <\/jats:p>","DOI":"10.1142\/s1793830922501518","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T13:24:26Z","timestamp":1661347466000},"source":"Crossref","is-referenced-by-count":0,"title":["Sieve algorithms for some orthogonal integer lattices"],"prefix":"10.1142","volume":"15","author":[{"given":"Arnaud Gires Fobasso","family":"Tchinda","sequence":"first","affiliation":[{"name":"Department of Mathematics, The University of Yaounde 1, P.O. Box 812 Yaounde Cameroon, Cameroon"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7729-0419","authenticated-orcid":false,"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Higher Teacher Training College, The University of Bamenda. P.O. Box 39 Bambili Cameroon, Cameroon"}]},{"given":"Celestin Nkuimi","family":"Jugnia","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The University of Yaounde 1, P.O. Box 812 Yaounde Cameroon, Cameroon"}]}],"member":"219","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"S1793830922501518BIB001","first-page":"601","volume-title":"Proc. 33rd Annual ACM Symp. Theory of Computing","author":"Ajtai M.","year":"2001"},{"key":"S1793830922501518BIB002","first-page":"711","volume-title":"Proc. 31 Annual ACM Symp. Theory of Computing","author":"Bl\u00f6mer J.","year":"1999"},{"issue":"2","key":"S1793830922501518BIB003","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.1137\/15M1054766","volume":"31","author":"Chandrasekaran K.","year":"2017","journal-title":"SIAM J. Discret. Math."},{"key":"S1793830922501518BIB004","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/3208976.3209013","volume-title":"Proc. 2018 ACM on Int. Symp. Symbolic and Algebraic Computation","author":"Chen J.","year":"2018"},{"key":"S1793830922501518BIB005","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups","volume":"290","author":"Conway J. H.","year":"1988"},{"key":"S1793830922501518BIB006","series-title":"Proceedings, Part II, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2020 \u2014 40th Annual Int. Cryptology Conference, CRYPTO 2020","volume":"12171","author":"Dachman-Soled D.","year":"2020"},{"issue":"5","key":"S1793830922501518BIB007","doi-asserted-by":"crossref","first-page":"3426","DOI":"10.1109\/TIT.2022.3143620","volume":"68","author":"Debris-Alazard T.","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"S1793830922501518BIB008","series-title":"2018 Proceedings, Part I, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2014EUROCRYPT 2018 \u2014 37th Annual Int. Conf. Theory and Applications of Cryptographic Techniques","volume":"10820","author":"Ducas L.","year":"2018"},{"key":"S1793830922501518BIB009","first-page":"322","volume":"11692","author":"Ducas L.","year":"2019","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"S1793830922501518BIB010","series-title":"Proceedings, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997, 17th Annual Int. Cryptology Conference","volume":"1294","author":"Goldreich O.","year":"1997"},{"issue":"3","key":"S1793830922501518BIB011","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"Kannan R.","year":"1987","journal-title":"Math. Oper. Res."},{"key":"S1793830922501518BIB012","first-page":"1468","volume-title":"Proc. 21 Annual ACM-SIAM Symp. Discrete Algorithms, SODA 2010","author":"Micciancio D.","year":"2010"},{"issue":"2","key":"S1793830922501518BIB013","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"Nguyen P. Q.","year":"2008","journal-title":"J. Math. Cryptol."},{"issue":"1","key":"S1793830922501518BIB014","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"Pohst M.","year":"1981","journal-title":"SIGSAM Bull."},{"issue":"5","key":"S1793830922501518BIB015","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"Shor P. W.","year":"1997","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:09:21Z","timestamp":1689930561000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":15,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501518"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501518","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,9,26]]},"article-number":"2250151"}}