Abstract
An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory (1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel ofr>1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.J. Simmons,The prisoner's problem and subliminal channel, Proc. Crypto'83, 1983, andin Advances in Cryptology, Proc. Crypto'83, (Plenum Press, New York, 1984, 51–67)
R.S. Safavi-Naizi and J.R. Seberry,Error-correcting codes for authentication and subliminal channels, IEEE Trans.IT-37(1) (1991), 13–17
R. Lidl and H. Niederreiter,Introduction to finit fields and their applications, Cambridge Univ. Press, 1994
M.B. Monagan, K.O. Geddes, K.M. Heal and G. Labahn:“Maple 8: Introductory Programming Guide”, Maplesoft, a division of Waterloo Maple Inc., 2002
Author information
Authors and Affiliations
Corresponding author
Additional information
Kil-Chan Ha received his B.S. and M.S. from Seoul National University (SNU) and Ph. D at SNU under the direction of Seung-Hyeok Kye. He worked as a senior researcher at National Security Research Institute(NSRI) from 1999 to 2002, and in 2002 he joined the faculty of Sejong University. His current research interests include design and analysis of cryptographic protocols/algorithms, steganography, and quantum information theory.
Rights and permissions
About this article
Cite this article
Ha, KC. A class of binary matrices preserving rank under matrix addition and its application. JAMC 16, 105–113 (2004). https://doi.org/10.1007/BF02936154
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02936154