Abstract
The concept of dyadic matrix was initially proposed for the purpose of design orthogonal matrices and multi-valued codes with perfect autocorrelation property [1,2]. By now much work has been done in this area. In the following text we will show some other new results about the reversibility of dyadic metrices and their potential significance in cryptography.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Yang Yi Xian & Hu Zheng Ming, 1987 Int. Conference on Commun. Tech. (ICCT'87), Nanjing, 1987.
Hu Zheng Ming, 1988 Int. Sympo. on Inform. Theory, (ISIT'88) Japan, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xian, Y.Y. (1990). Dyadic matrices and their potential significance in cryptography (abstract). In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030370
Download citation
DOI: https://doi.org/10.1007/BFb0030370
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive