Abstract
We introduce a class of matrices W m = P m U m of order m by m, where m is a positive integer, P m is a diagonal matrix and Um is a sparse matrix. We prove that the Riesz product of the matrix U m is invertible and we simplify the invertible formulas of the Riesz product of the matrices W m and U m . We use the Riesz product to present a new cipher that can't be easily compromised.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
