Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts
From MaRDI portal
Publication:896120
DOI10.1016/j.tcs.2015.07.053zbMath1332.05024OpenAlexW1113301385MaRDI QIDQ896120
Cong Tian, Jin Liu, Zhenhua Duan, Jie Li
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.053
Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A note on optical network with nonsplitting nodes
- The Jordan pair content of the magic square and the geometry of the scalars in \(N=2\) supergravity
- Random matrices, magic squares and matching polynomials
- Improved construction for pooling design
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Vector Spaces of Magic Squares
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts