<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">ntv</journal-id><journal-title-group><journal-title xml:lang="ru">Научно-технический вестник информационных технологий, механики и оптики</journal-title><trans-title-group xml:lang="en"><trans-title>Scientific and Technical Journal of Information Technologies, Mechanics and Optics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-1494</issn><issn pub-type="epub">2500-0373</issn><publisher><publisher-name>Университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/2226-1494-2022-22-4-674-680</article-id><article-id custom-type="elpub" pub-id-type="custom">ntv-179</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>КОМПЬЮТЕРНЫЕ СИСТЕМЫ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>COMPUTER SCIENCE</subject></subj-group></article-categories><title-group><article-title>Построение криптографических схем, основанных на эллиптических кривых над рациональными числами</article-title><trans-title-group xml:lang="en"><trans-title>Building cryptographic schemes based on elliptic curves over rational numbers</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5544-2434</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Давыдов</surname><given-names>В. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Davydov</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Давыдов Вадим Валерьевич — преподаватель</p><p>sc 57203909696</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Vadim V. Davydov — Lecturer</p><p>sc 57203909696</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">vvdavydov@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-4084-8829</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дакуо</surname><given-names>Ж.-М. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Dakuo</surname><given-names>J.-M. N.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Дакуо Жан-Мишель Никодэмович — студент,</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Jean-Michelle N. Dakuo — Student</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">jeandakuo@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0856-2249</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Иогансон</surname><given-names>И. Д.</given-names></name><name name-style="western" xml:lang="en"><surname>Ioganson</surname><given-names>I. D.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Иогансон Иван Дмитриевич — инженер</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Ivan D. Ioganson — Engineer</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">ivan.ioganson@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5494-7142</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Хуцаева</surname><given-names>А. Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>Khutsaeva</surname><given-names>A. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Хуцаева Алтана Феликсовна — инженер</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Altana F. Khutsaeva — Engineer</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">afkhutsaeva@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>14</day><month>12</month><year>2024</year></pub-date><volume>22</volume><issue>4</issue><fpage>674</fpage><lpage>680</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Давыдов В.В., Дакуо Ж.Н., Иогансон И.Д., Хуцаева А.Ф., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Давыдов В.В., Дакуо Ж.Н., Иогансон И.Д., Хуцаева А.Ф.</copyright-holder><copyright-holder xml:lang="en">Davydov V.V., Dakuo J.N., Ioganson I.D., Khutsaeva A.F.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ntv.elpub.ru/jour/article/view/179">https://ntv.elpub.ru/jour/article/view/179</self-uri><abstract><p>Предмет исследования. Исследована возможность использования в криптографических схемах эллиптических кривых над полем рациональных чисел ненулевого ранга. Метод. Впервые предложено построение криптосистем, безопасность которых основана на сложности решения математической задачи о рюкзаке на эллиптических кривых над рациональными числами ненулевых рангов. Основные результаты. Описан новый подход использования эллиптических кривых для криптографических схем. Выполнен ряд экспериментов для оценки поведения высот точек эллиптических кривых бесконечного порядка. Представлена модель криптосистемы, стойкой к вычислениям на квантовом компьютере и основанной на использовании рациональных точек кривой бесконечного порядка. Проведено исследование криптографической стойкости и эффективности предлагаемой схемы. Реализована атака на поиск секрета в криптосистеме, показано, что сложность атаки экспоненциальна. Практическая значимость. Рассмотренное решение может быть применено при построении реальных криптографических схем и протоколов.</p></abstract><trans-abstract xml:lang="en"><p>The possibility of using elliptic curves over the rational field of non-zero ranks in cryptographic schemes is studied. For the first time, the construction of cryptosystems is proposed the security of which is based on the complexity of solving the knapsack problem on elliptic curves over rational numbers of non-zero ranks. A new approach to the use of elliptic curves for cryptographic schemes is proposed. A few experiments have been carried out to estimate the heights characteristic of points on elliptic curves of infinite order. A model of a cryptosystem resistant to computations on a quantum computer and based on rational points of an infinite order curve is proposed. A study of the security and effectiveness of the proposed scheme has been carried out. An attack on the secret search in such a cryptosystem is implemented and it is shown that the complexity of the attack is exponential. The proposed solution can be applied in the construction of real cryptographic schemes as well as cryptographic protocols.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>эллиптические кривые</kwd><kwd>рациональные числа</kwd><kwd>ранг кривых</kwd><kwd>асимметричное шифрование</kwd><kwd>задача о рюкзаке</kwd></kwd-group><kwd-group xml:lang="en"><kwd>elliptic curves</kwd><kwd>rational numbers</kwd><kwd>curve rank</kwd><kwd>asymmetric encryption</kwd><kwd>knapsack problem</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена при поддержке программы «Приоритет 2030».</funding-statement><funding-statement xml:lang="en">This research was supported by Priority 2030 Federal Academic Leadership Program.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Koblitz N., Menezes A., Vanstone S. The state of elliptic curve cryptography // Designs, Codes and Cryptography. 2000. V. 19. N 2-3. P. 173–193. https://doi.org/10.1023/A:1008354106356</mixed-citation><mixed-citation xml:lang="en">Koblitz N., Menezes A., Vanstone S. The state of elliptic curve cryptography. Designs, Codes and Cryptography, 2000, vol. 19, no. 2-3, pp. 173–193. https://doi.org/10.1023/A:1008354106356</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Koblitz N. Elliptic curve cryptosystems // Mathematics of Computation. 1987. V. 48. N 177. P. 203–209. https://doi.org/10.1090/S0025-5718-1987-0866109-5</mixed-citation><mixed-citation xml:lang="en">Koblitz N. Elliptic curve cryptosystems. Mathematics of Computation, 1987, vol. 48, no. 177, pp. 203–209. https://doi.org/10.1090/S0025-5718-1987-0866109-5</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Washington L.C. Elliptic Curves: Number Theory and Cryptography. Chapman and Hall/CRC, 2008. 536 p.</mixed-citation><mixed-citation xml:lang="en">Washington L.C. Elliptic Curves: Number Theory and Cryptography. Chapman and Hall/CRC, 2008, 536 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Silverman J.H. The Arithmetic of Elliptic Curves. New York: Springer, 2009. 513 p. (Graduate Texts in Mathematics; V. 106).</mixed-citation><mixed-citation xml:lang="en">Silverman J.H. The Arithmetic of Elliptic Curves. New York, Springer, 2009, 513 p. Graduate Texts in Mathematics, vol. 106.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Mordell L. On the rational solutions of the indeterminate equation of the third and fourth degree // Proceedings Cambridge Philosophical Society. 1922. V. 21. P. 179–192.</mixed-citation><mixed-citation xml:lang="en">Mordell L. On the rational solutions of the indeterminate equation of the third and fourth degree. Proceedings Cambridge Philosophical Society, 1922, vol. 21, pp. 179–192.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Weil A. L'arithmétique sur les courbes algébriques // Acta Mathematica. 1929. V. 52. N 1. P. 281–315. https://doi.org/10.1007/BF02592688</mixed-citation><mixed-citation xml:lang="en">Weil A. L'arithmétique sur les courbes algébriques. Acta Mathematica, 1929, vol. 52, no. 1, pp. 281–315. https://doi.org/10.1007/BF02592688</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Silverman J.H. Heights and elliptic curves // Arithmetic Geometry. New York, NY: Springer, 1986. P. 253–265. https://doi.org/10.1007/978-1-4613-8655-1_10</mixed-citation><mixed-citation xml:lang="en">Silverman J.H. Heights and elliptic curves. Arithmetic Geometry. New York, NY, Springer, 1986, pp. 253–265. https://doi.org/10.1007/978-1-4613-8655-1_10</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Klagsbrun Z., Sherman T., Weigandt J. The Elkies curve has rank 28 subject only to GRH // Mathematics of Computation. 2019. V. 88. N 316. P. 837–846. https://doi.org/10.1090/mcom/3348</mixed-citation><mixed-citation xml:lang="en">Klagsbrun Z., Sherman T., Weigandt J. The Elkies curve has rank 28 subject only to GRH. Mathematics of Computation, 2019, vol. 88, no. 316, pp. 837–846. https://doi.org/10.1090/mcom/3348</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Menezes A.J., Van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. CRC press, 2018. 810 p.</mixed-citation><mixed-citation xml:lang="en">Menezes A.J., Van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. CRC press, 2018, 810 p.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Danzig T. Numbers: The Language of Science. Revised. Now York, Macmillan, 1933.</mixed-citation><mixed-citation xml:lang="en">Danzig T. Numbers: The Language of Science. Revised. Now York, Macmillan, 1933.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Mathews G.B. On the partition of numbers // Proceedings of the London Mathematical Society. 1896. V. 1. N 1. P. 486–490. https:// doi.org/10.1112/plms/s1-28.1.486</mixed-citation><mixed-citation xml:lang="en">Mathews G.B. On the partition of numbers. Proceedings of the London Mathematical Society, 1896, vol. 1, no. 1, pp. 486–490. https://doi.org/10.1112/plms/s1-28.1.486</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Diffie W., Hellman M. New directions in cryptography // IEEE Transactions on Information Theory. 1976. V. 22. N 6. P. 644–654. https://doi.org/10.1109/TIT.1976.1055638</mixed-citation><mixed-citation xml:lang="en">Diffie W., Hellman M. New directions in cryptography. IEEE Transactions on Information Theory, 1976, vol. 22, no. 6, pp. 644–654. https://doi.org/10.1109/TIT.1976.1055638</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Noro K., Kobayashi K. Knapsack cryptosystem on elliptic curves // Cryptology ePrint Archive. 2009. P. 2009/091.</mixed-citation><mixed-citation xml:lang="en">Noro K., Kobayashi K. Knapsack cryptosystem on elliptic curves. Cryptology ePrint Archive, 2009, pp. 2009/091.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Mazur B., Goldfeld D. Rational isogenies of prime degree // Inventiones Mathematicae. 1978. V. 44. N 2. P. 129–162. https://doi.org/10.1007/BF01390348</mixed-citation><mixed-citation xml:lang="en">Mazur B., Goldfeld D. Rational isogenies of prime degree. Inventiones Mathematicae, 1978, vol. 44, no. 2, pp. 129–162. https://doi.org/10.1007/BF01390348</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Lozano-Robledo Á. Elliptic curves, modular forms, and their L-functions // The Student Mathematical Library. 2011. V. 58. http://dx.doi.org/10.1090/stml/058</mixed-citation><mixed-citation xml:lang="en">Lozano-Robledo Á. Elliptic curves, modular forms, and their L-functions. The Student Mathematical Library, 2011, vol. 58. http://dx.doi.org/10.1090/stml/058</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
