共 35 条
- [2] Efficient algorithms for GCD and cubic residuosity in the ring of Eisenstein integers* FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 109 - 117
- [3] Two Fast Parallel GCD Algorithms of Many Integers PROCEEDINGS OF THE 2017 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC'17), 2017, : 397 - 404
- [4] A secret sharing scheme over the ring of Eisenstein integers Dong, X. (dongxuedong@sina.com), 2013, Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States (09):
- [5] Factor Rings and their decompositions in the Eisenstein integers Ring Z [omega] ARMENIAN JOURNAL OF MATHEMATICS, 2013, 5 (01): : 58 - 68
- [6] Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor 2014 9TH IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE (NAS), 2014, : 113 - 117
- [8] A cubic ring of integers with the smallest Pythagoras number Archiv der Mathematik, 2022, 118 : 39 - 48
- [9] Public Key Cryptosystem and Signature Schemes over the Ring of Eisenstein Integers PROCEEDINGS OF THE 2013 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT CONTROL AND INFORMATION PROCESSING (ICICIP), 2013, : 210 - 214