
-
Previous Article
Constructions of optimal low hit zone frequency hopping sequence sets with large family size
- AMC Home
- This Issue
-
Next Article
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
Online First articles are published articles within a journal that have not yet been assigned to a formal issue. This means they do not yet have a volume number, issue number, or page numbers assigned to them, however, they can still be found and cited using their DOI (Digital Object Identifier). Online First publication benefits the research community by making new scientific discoveries known as quickly as possible.
Readers can access Online First articles via the “Online First” tab for the selected journal.
Four by four MDS matrices with the fewest XOR gates based on words
1. | Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan 430062, China |
2. | State Key Laboratory of Information Security, Institute of Information Engineering, , University of Chinese Academy of Sciences, Beijing, China |
MDS matrices play an important role in the design of block ciphers, and constructing MDS matrices with fewer xor gates is of significant interest for lightweight ciphers. For this topic, Duval and Leurent proposed an approach to construct MDS matrices by using three linear operations in ToSC 2018. Taking words as elements, they found $ 16\times16 $ and $ 32\times 32 $ MDS matrices over $ \mathbb{F}_2 $ with only $ 35 $ xor gates and $ 67 $ xor gates respectively, which are also the best known implementations up to now. Based on the same observation as their work, we consider three linear operations as three kinds of elementary linear operations of matrices, and obtain more MDS matrices with $ 35 $ and $ 67 $ xor gates. In addition, some $ 16\times16 $ or $ 32\times32 $ involutory MDS matrices with only $ 36 $ or $ 72 $ xor gates over $ \mathbb{F}_2 $ are also proposed, which are better than previous results. Moreover, our method can be extended to general linear groups, and we prove that the lower bound of the sequential xor count based on words for $ 4 \times 4 $ MDS matrix over general linear groups is $ 8n+2 $.
References:
[1] |
R. Avanzi,
The QARMA block cipher family. Almost MDS matrices over rings with zero divisors, nearly symmetric even-mansour constructions with non-involutory central rounds, and search heuristics for low-latency s-boxes, IACR Trans. Symmetric Cryptol., 2017 (2017), 4-44.
doi: 10.46586/tosc.v2017.i1.4-44. |
[2] |
S. Banik, A. Bogdanov, T. Isobe, K. Shibutani, H. Hiwatari, T. Akishita and F. Regazzoni,
Midori: A block cipher for low energy (extended version), ASIACRYPT 2015, Lecture Notes in Computer Science, 9453 (2015), 411-436.
doi: 10.1007/978-3-662-48800-3_17. |
[3] |
S. Banik, Y. Funabiki and T. Isobe, More results on shortest linear programs, Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Lecture Notes in Computer Science, 11689 (2019), 109–128.
doi: 10.1007/978-3-030-26834-3_7. |
[4] |
S. Banik, S. K. Pandey, T. Peyrin, Y. Sasaki, S. M. Sim and Y. Todo, GIFT: A small present - towards reaching the limit of lightweight encryption, In: Cryptographic Hardware and Embedded Systems 2017, Lecture Notes in Computer Science, 10529 (2017), 321–345.
doi: 10.1007/978-3-319-66787-4\_16. |
[5] |
C. Beierle, T. Kranz and G. Leander,
Lightweight multiplication in ${\rm{GF}}(2^n)$ with applications to MDS matrices, CRYPTO 2016, Lecture Notes in Computer Science, 9814 (2016), 625-653.
doi: 10.1007/978-3-662-53018-4_23. |
[6] |
A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann, M. J. B. Robshaw, Y. Seurin and C. Vikkelsoe,
PRESENT: An ultra-lightweight block cipher, Cryptographic Hardware and Embedded Systems 2007, 4227 (2007), 450-466.
doi: 10.1007/978-3-540-74735-2_31. |
[7] |
J. Borghoff, A. Canteaut, T. Güneysu, E. B. Kavun, M. Knezevic, L. R. Knudsen, G. Leander, V. Nikov, C. Paar, C. Rechberger, P. Rombouts, S. S. Thomsen and T. Yalç,
PRINCE - A low-latency block cipher for pervasive computing applications - extended abstract, ASIACRYPT 2012, Lecture Notes in Computer Science, 7658 (2012), 208-225.
doi: 10.1007/978-3-642-34961-4\_14. |
[8] |
J. Boyar, P. Matthews and R. Peralta,
Logic minimization techniques with applications to cryptology, J. Cryptology, 26 (2013), 280-312.
doi: 10.1007/s00145-012-9124-7. |
[9] |
J. Daemen and V. Rijmen, The Design of Rijndael: AES - The Advanced Encryption Standard, Information Security and Cryptography. Springer, 2002.
doi: 10.1007/978-3-662-04722-4. |
[10] |
S. Duval and G. Leurent,
MDS matrices with lightweight circuits, IACR Trans. Symmetric Cryptol., 2018 (2018), 48-78.
doi: 10.13154/tosc.v2018.i2.48-78. |
[11] |
J. Guo, T. Peyrin and A. Poschmann,
The PHOTON family of lightweight hash functions, CRYPTO 2011, Lecture Notes in Computer Science, 6841 (2011), 222-239.
doi: 10.1007/978-3-642-22792-9_13. |
[12] |
J. Guo, T. Peyrin, A. Poschmann and M. J. B. Robshaw,
The LED block cipher, Cryptographic Hardware and Embedded Systems 2011, Lecture Notes in Computer Science, 6917 (2011), 326-341.
doi: 10.1007/978-3-642-23951-9_22. |
[13] |
J. Jean, T. Peyrin, S. M. Sim and J. Tourteaux,
Optimizing implementations of lightweight building blocks, IACR Trans. Symmetric Cryptol., 2017 (2017), 130-168.
doi: 10.13154/tosc.v2017.i4.130-168. |
[14] |
T. Kranz, G. Leander, K. Stoffelen and F. Wiemer,
Shorter linear straight-line programs for MDS matrices, IACR Trans. Symmetric Cryptol., 2017 (2017), 188-211.
doi: 10.46586/tosc.v2017.i4.188-211. |
[15] |
C. Li and Q. Wang,
Design of lightweight linear diffusion layers from near-mds matrices, IACR Trans. Symmetric Cryptol., 2017 (2017), 129-155.
doi: 10.13154/tosc.v2017.i1.129-155. |
[16] |
S. Li, S. Sun, C. Li, Z. Wei and L. Hu,
Constructing low-latency involutory MDS matrices with lightweight circuits, IACR Trans. Symmetric Cryptol., 2019 (2019), 84-117.
doi: 10.46586/tosc.v2019.i1.84-117. |
[17] |
Y. Li and M. Wang,
On the construction of lightweight circulant involutory MDS matrices, Fast Software Encryption 2016, Lecture Notes in Computer Science, 9783 (2016), 121-139.
doi: 10.1007/978-3-662-52993-5_7. |
[18] |
M. Liu and S. M. Sim,
Lightweight MDS generalized circulant matrices, Fast Software Encryption 2016, Lecture Notes in Computer Science, 9783 (2016), 101-120.
doi: 10.1007/978-3-662-52993-5_6. |
[19] |
F. J. Macwilliams and N. J. A. Sloane,
The theory of error correcting codes, North-Holland Mathematical Library, Amsterdam-New York Oxford: North-Holland Publishing Company, 16 (1977), 370-762.
|
[20] |
S. Sarkar and H. Syed,
Lightweight diffusion layer: Importance of toeplitz matrices, ACR Trans. Symmetric Cryptol., 2016 (2016), 95-113.
doi: 10.13154/tosc.v2016.i1.95-113. |
[21] |
S. M. Sim, K. Khoo, F. E. Oggier and T. Peyrin,
Lightweight MDS involution matrices, Fast Software Encryption 2015, 9054 (2015), 471-493.
doi: 10.1007/978-3-662-48116-5_23. |
[22] |
F. X. Standaert, G. Piret, G. Rouvroy, J. J. Quisquater and J. D. Legat,
ICEBERG: An involutional cipher effcient for block encryption in reconfigurable hardware, Fast Software Encryption 2004, 3017 (2004), 279-299.
|
[23] |
Q. Q Tan and T. Peyrin,
Improved heuristics for short linear programs, IACR Trans. Cryptogr., 2020 (2020), 203-230.
doi: 10.13154/tches.v2020.i1.203-230. |
[24] |
A. Visconti, C. V. Schiavo and R. Peralta,
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over ${\rm{GF}}(2)$, Information Processing Letters, 137 (2018), 1-5.
doi: 10.1016/j.ipl.2018.04.010. |
[25] |
S. Wu, M. Wang and W. Wu,
Recursive diffusion layers for (lightweight) block ciphers and hash functions, Selected Areas in Cryptography 2012, Lecture Notes in Computer Science, 7707 (2012), 355-371.
doi: 10.1007/978-3-642-35999-6_23. |
[26] |
Z. Xiang, X. Zeng, D. Lin, Z. Bao and S. Zhang,
Optimizing implementations of linear layers, IACR Trans. Symmetric Cryptol., 2020 (2020), 120-145.
doi: 10.46586/tosc.v2020.i2.120-145. |
[27] |
W. Zhang, Z. Bao, D. Lin, V. Rijmen, B. Yang and I. Verbauwhede,
RECTANGLE: A bit-slice lightweight block cipher suitable for multiple platforms, Science China Information Sciences, 58 (2015), 1-15.
doi: 10.1007/s11432-015-5459-7. |
[28] |
L. Zhou, L. Wang and Y. Sun,
On efficient constructions of lightweight MDS matrices, IACR Trans. Symmetric Cryptol., 2018 (2018), 180-200.
doi: 10.46586/tosc.v2018.i1.180-200. |
show all references
References:
[1] |
R. Avanzi,
The QARMA block cipher family. Almost MDS matrices over rings with zero divisors, nearly symmetric even-mansour constructions with non-involutory central rounds, and search heuristics for low-latency s-boxes, IACR Trans. Symmetric Cryptol., 2017 (2017), 4-44.
doi: 10.46586/tosc.v2017.i1.4-44. |
[2] |
S. Banik, A. Bogdanov, T. Isobe, K. Shibutani, H. Hiwatari, T. Akishita and F. Regazzoni,
Midori: A block cipher for low energy (extended version), ASIACRYPT 2015, Lecture Notes in Computer Science, 9453 (2015), 411-436.
doi: 10.1007/978-3-662-48800-3_17. |
[3] |
S. Banik, Y. Funabiki and T. Isobe, More results on shortest linear programs, Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Lecture Notes in Computer Science, 11689 (2019), 109–128.
doi: 10.1007/978-3-030-26834-3_7. |
[4] |
S. Banik, S. K. Pandey, T. Peyrin, Y. Sasaki, S. M. Sim and Y. Todo, GIFT: A small present - towards reaching the limit of lightweight encryption, In: Cryptographic Hardware and Embedded Systems 2017, Lecture Notes in Computer Science, 10529 (2017), 321–345.
doi: 10.1007/978-3-319-66787-4\_16. |
[5] |
C. Beierle, T. Kranz and G. Leander,
Lightweight multiplication in ${\rm{GF}}(2^n)$ with applications to MDS matrices, CRYPTO 2016, Lecture Notes in Computer Science, 9814 (2016), 625-653.
doi: 10.1007/978-3-662-53018-4_23. |
[6] |
A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann, M. J. B. Robshaw, Y. Seurin and C. Vikkelsoe,
PRESENT: An ultra-lightweight block cipher, Cryptographic Hardware and Embedded Systems 2007, 4227 (2007), 450-466.
doi: 10.1007/978-3-540-74735-2_31. |
[7] |
J. Borghoff, A. Canteaut, T. Güneysu, E. B. Kavun, M. Knezevic, L. R. Knudsen, G. Leander, V. Nikov, C. Paar, C. Rechberger, P. Rombouts, S. S. Thomsen and T. Yalç,
PRINCE - A low-latency block cipher for pervasive computing applications - extended abstract, ASIACRYPT 2012, Lecture Notes in Computer Science, 7658 (2012), 208-225.
doi: 10.1007/978-3-642-34961-4\_14. |
[8] |
J. Boyar, P. Matthews and R. Peralta,
Logic minimization techniques with applications to cryptology, J. Cryptology, 26 (2013), 280-312.
doi: 10.1007/s00145-012-9124-7. |
[9] |
J. Daemen and V. Rijmen, The Design of Rijndael: AES - The Advanced Encryption Standard, Information Security and Cryptography. Springer, 2002.
doi: 10.1007/978-3-662-04722-4. |
[10] |
S. Duval and G. Leurent,
MDS matrices with lightweight circuits, IACR Trans. Symmetric Cryptol., 2018 (2018), 48-78.
doi: 10.13154/tosc.v2018.i2.48-78. |
[11] |
J. Guo, T. Peyrin and A. Poschmann,
The PHOTON family of lightweight hash functions, CRYPTO 2011, Lecture Notes in Computer Science, 6841 (2011), 222-239.
doi: 10.1007/978-3-642-22792-9_13. |
[12] |
J. Guo, T. Peyrin, A. Poschmann and M. J. B. Robshaw,
The LED block cipher, Cryptographic Hardware and Embedded Systems 2011, Lecture Notes in Computer Science, 6917 (2011), 326-341.
doi: 10.1007/978-3-642-23951-9_22. |
[13] |
J. Jean, T. Peyrin, S. M. Sim and J. Tourteaux,
Optimizing implementations of lightweight building blocks, IACR Trans. Symmetric Cryptol., 2017 (2017), 130-168.
doi: 10.13154/tosc.v2017.i4.130-168. |
[14] |
T. Kranz, G. Leander, K. Stoffelen and F. Wiemer,
Shorter linear straight-line programs for MDS matrices, IACR Trans. Symmetric Cryptol., 2017 (2017), 188-211.
doi: 10.46586/tosc.v2017.i4.188-211. |
[15] |
C. Li and Q. Wang,
Design of lightweight linear diffusion layers from near-mds matrices, IACR Trans. Symmetric Cryptol., 2017 (2017), 129-155.
doi: 10.13154/tosc.v2017.i1.129-155. |
[16] |
S. Li, S. Sun, C. Li, Z. Wei and L. Hu,
Constructing low-latency involutory MDS matrices with lightweight circuits, IACR Trans. Symmetric Cryptol., 2019 (2019), 84-117.
doi: 10.46586/tosc.v2019.i1.84-117. |
[17] |
Y. Li and M. Wang,
On the construction of lightweight circulant involutory MDS matrices, Fast Software Encryption 2016, Lecture Notes in Computer Science, 9783 (2016), 121-139.
doi: 10.1007/978-3-662-52993-5_7. |
[18] |
M. Liu and S. M. Sim,
Lightweight MDS generalized circulant matrices, Fast Software Encryption 2016, Lecture Notes in Computer Science, 9783 (2016), 101-120.
doi: 10.1007/978-3-662-52993-5_6. |
[19] |
F. J. Macwilliams and N. J. A. Sloane,
The theory of error correcting codes, North-Holland Mathematical Library, Amsterdam-New York Oxford: North-Holland Publishing Company, 16 (1977), 370-762.
|
[20] |
S. Sarkar and H. Syed,
Lightweight diffusion layer: Importance of toeplitz matrices, ACR Trans. Symmetric Cryptol., 2016 (2016), 95-113.
doi: 10.13154/tosc.v2016.i1.95-113. |
[21] |
S. M. Sim, K. Khoo, F. E. Oggier and T. Peyrin,
Lightweight MDS involution matrices, Fast Software Encryption 2015, 9054 (2015), 471-493.
doi: 10.1007/978-3-662-48116-5_23. |
[22] |
F. X. Standaert, G. Piret, G. Rouvroy, J. J. Quisquater and J. D. Legat,
ICEBERG: An involutional cipher effcient for block encryption in reconfigurable hardware, Fast Software Encryption 2004, 3017 (2004), 279-299.
|
[23] |
Q. Q Tan and T. Peyrin,
Improved heuristics for short linear programs, IACR Trans. Cryptogr., 2020 (2020), 203-230.
doi: 10.13154/tches.v2020.i1.203-230. |
[24] |
A. Visconti, C. V. Schiavo and R. Peralta,
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over ${\rm{GF}}(2)$, Information Processing Letters, 137 (2018), 1-5.
doi: 10.1016/j.ipl.2018.04.010. |
[25] |
S. Wu, M. Wang and W. Wu,
Recursive diffusion layers for (lightweight) block ciphers and hash functions, Selected Areas in Cryptography 2012, Lecture Notes in Computer Science, 7707 (2012), 355-371.
doi: 10.1007/978-3-642-35999-6_23. |
[26] |
Z. Xiang, X. Zeng, D. Lin, Z. Bao and S. Zhang,
Optimizing implementations of linear layers, IACR Trans. Symmetric Cryptol., 2020 (2020), 120-145.
doi: 10.46586/tosc.v2020.i2.120-145. |
[27] |
W. Zhang, Z. Bao, D. Lin, V. Rijmen, B. Yang and I. Verbauwhede,
RECTANGLE: A bit-slice lightweight block cipher suitable for multiple platforms, Science China Information Sciences, 58 (2015), 1-15.
doi: 10.1007/s11432-015-5459-7. |
[28] |
L. Zhou, L. Wang and Y. Sun,
On efficient constructions of lightweight MDS matrices, IACR Trans. Symmetric Cryptol., 2018 (2018), 180-200.
doi: 10.46586/tosc.v2018.i1.180-200. |


Size | Ring | Type | Best | Ref |
n=4 | non-involutory | [10] | ||
non-involutory | Section 4.2 | |||
involutory | [20] | |||
involutory | Section 4.3 | |||
n=8 | AES | [26] | ||
non-involutory | [10] | |||
non-involutory | Section 4.2 | |||
involutory | [14] | |||
involutory | [16] | |||
involutory | Section 4.3 |
Size | Ring | Type | Best | Ref |
n=4 | non-involutory | [10] | ||
non-involutory | Section 4.2 | |||
involutory | [20] | |||
involutory | Section 4.3 | |||
n=8 | AES | [26] | ||
non-involutory | [10] | |||
non-involutory | Section 4.2 | |||
involutory | [14] | |||
involutory | [16] | |||
involutory | Section 4.3 |
No. | Operation | No. | Operation | No. | Operation |
1 | 2 | 3 | |||
4 | 5 | 6 | |||
7 | 8 | 9 | |||
10 |
No. | Operation | No. | Operation | No. | Operation |
1 | 2 | 3 | |||
4 | 5 | 6 | |||
7 | 8 | 9 | |||
10 |
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
|
|
|
|
|
|
|
|
|
|
|
|
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(A)\overline{\mathbf{\mathbf{1}}}(\mathbf{1}) \overline{\mathbf{10}}(A)E_{(2)}(A)\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{\mathbf{1}0}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(A) \overline{\mathbf{\mathbf{1}0}}(A)E_{(3)}(A^{-1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(A^{-1}) \overline{\mathbf{10}}(A^{-1})E_{(3)}(A)\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(A^{-1})\overline{\mathbf{1}}(\mathbf{1}) \overline{\mathbf{10}}(A^{-1})E_{(3)}(A^{-1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{1}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ |
|
|
|
|
|
|
|
|
|
|
|
|
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(A)\overline{\mathbf{\mathbf{1}}}(\mathbf{1}) \overline{\mathbf{10}}(A)E_{(2)}(A)\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{\mathbf{1}0}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(A) \overline{\mathbf{\mathbf{1}0}}(A)E_{(3)}(A^{-1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(A^{-1}) \overline{\mathbf{10}}(A^{-1})E_{(3)}(A)\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{\mathbf{1}}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ | |
$\overline{\mathbf{10}}(\mathbf{1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{9}}(A^{-1})\overline{\mathbf{1}}(\mathbf{1}) \overline{\mathbf{10}}(A^{-1})E_{(3)}(A^{-1})\overline{\mathbf{5}}(\mathbf{1})\overline{\mathbf{1}}(\mathbf{1})\overline{\mathbf{9}}(\mathbf{1}) $ |
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
No. | ||||||||
|
||||||||
No. | ||||||||
|
||||||||
No. | ||||||||
|
||||||||
No. | ||||||||
|
||||||||
[1] |
Mohsen Mousavi, Ali Zaghian, Morteza Esmaeili. Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices. Advances in Mathematics of Communications, 2021, 15 (4) : 589-610. doi: 10.3934/amc.2020084 |
[2] |
Yaguang Huangfu, Guanqing Liang, Jiannong Cao. MatrixMap: Programming abstraction and implementation of matrix computation for big data analytics. Big Data & Information Analytics, 2016, 1 (4) : 349-376. doi: 10.3934/bdia.2016015 |
[3] |
Zhengshan Dong, Jianli Chen, Wenxing Zhu. Homotopy method for matrix rank minimization based on the matrix hard thresholding method. Numerical Algebra, Control and Optimization, 2019, 9 (2) : 211-224. doi: 10.3934/naco.2019015 |
[4] |
Iain Duff, Jonathan Hogg, Florent Lopez. Experiments with sparse Cholesky using a sequential task-flow implementation. Numerical Algebra, Control and Optimization, 2018, 8 (2) : 237-260. doi: 10.3934/naco.2018014 |
[5] |
Meijuan Shang, Yanan Liu, Lingchen Kong, Xianchao Xiu, Ying Yang. Nonconvex mixed matrix minimization. Mathematical Foundations of Computing, 2019, 2 (2) : 107-126. doi: 10.3934/mfc.2019009 |
[6] |
Paul Skerritt, Cornelia Vizman. Dual pairs for matrix groups. Journal of Geometric Mechanics, 2019, 11 (2) : 255-275. doi: 10.3934/jgm.2019014 |
[7] |
Adel Alahmadi, Hamed Alsulami, S.K. Jain, Efim Zelmanov. On matrix wreath products of algebras. Electronic Research Announcements, 2017, 24: 78-86. doi: 10.3934/era.2017.24.009 |
[8] |
Zhiyong Sun, Toshiharu Sugie. Identification of Hessian matrix in distributed gradient-based multi-agent coordination control systems. Numerical Algebra, Control and Optimization, 2019, 9 (3) : 297-318. doi: 10.3934/naco.2019020 |
[9] |
Jian Zhao, Fang Deng, Jian Jia, Chunmeng Wu, Haibo Li, Yuan Shi, Shunli Zhang. A new face feature point matrix based on geometric features and illumination models for facial attraction analysis. Discrete and Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1065-1072. doi: 10.3934/dcdss.2019073 |
[10] |
Gianluca D'Antonio, Paul Macklin, Luigi Preziosi. An agent-based model for elasto-plastic mechanical interactions between cells, basement membrane and extracellular matrix. Mathematical Biosciences & Engineering, 2013, 10 (1) : 75-101. doi: 10.3934/mbe.2013.10.75 |
[11] |
S. Sadeghi, H. Jafari, S. Nemati. Solving fractional Advection-diffusion equation using Genocchi operational matrix based on Atangana-Baleanu derivative. Discrete and Continuous Dynamical Systems - S, 2021, 14 (10) : 3747-3761. doi: 10.3934/dcdss.2020435 |
[12] |
Guimin Liu, Hongbin Lv. Bounds for spectral radius of nonnegative tensors using matrix-digragh-based approach. Journal of Industrial and Management Optimization, 2021 doi: 10.3934/jimo.2021176 |
[13] |
K. T. Arasu, Manil T. Mohan. Optimization problems with orthogonal matrix constraints. Numerical Algebra, Control and Optimization, 2018, 8 (4) : 413-440. doi: 10.3934/naco.2018026 |
[14] |
Shengxin Zhu, Tongxiang Gu, Xingping Liu. AIMS: Average information matrix splitting. Mathematical Foundations of Computing, 2020, 3 (4) : 301-308. doi: 10.3934/mfc.2020012 |
[15] |
Peizhao Yu, Guoshan Zhang, Yi Zhang. Decoupling of cubic polynomial matrix systems. Numerical Algebra, Control and Optimization, 2021, 11 (1) : 13-26. doi: 10.3934/naco.2020012 |
[16] |
Henry Adams, Lara Kassab, Deanna Needell. An adaptation for iterative structured matrix completion. Foundations of Data Science, 2021, 3 (4) : 769-791. doi: 10.3934/fods.2021028 |
[17] |
Lei Zhang, Anfu Zhu, Aiguo Wu, Lingling Lv. Parametric solutions to the regulator-conjugate matrix equations. Journal of Industrial and Management Optimization, 2017, 13 (2) : 623-631. doi: 10.3934/jimo.2016036 |
[18] |
Heide Gluesing-Luerssen, Fai-Lung Tsang. A matrix ring description for cyclic convolutional codes. Advances in Mathematics of Communications, 2008, 2 (1) : 55-81. doi: 10.3934/amc.2008.2.55 |
[19] |
Houduo Qi, ZHonghang Xia, Guangming Xing. An application of the nearest correlation matrix on web document classification. Journal of Industrial and Management Optimization, 2007, 3 (4) : 701-713. doi: 10.3934/jimo.2007.3.701 |
[20] |
Yuan Shen, Xin Liu. An alternating minimization method for matrix completion problems. Discrete and Continuous Dynamical Systems - S, 2020, 13 (6) : 1757-1772. doi: 10.3934/dcdss.2020103 |
2020 Impact Factor: 0.935
Tools
Metrics
Other articles
by authors
[Back to Top]