Hill Cipher with r-Circulant Matrices
Abstract
Keywords
References
- [1] Hill, L., “Cryptography in an algebraic alphabet”, The American Mathematical Monthly 36(6) (1929) : 306-312.
- [2] Hill, L., “Concerning certain linear transformation apparatus in cryptography”, The Mathematical Monthly 38(3) (1931) : 135-154.
- [3] Christensen, C., “Review of codes, ciphers and spies: tales of military intelligence in world war i by John F. Dooley”, Cyrptologia 40(6) (2016) : 563-566.
- [4] Christensen, C., “Lester Hill Revisited”, Cryptologia 38(8) (2014) : 293-332.
- [5] Magamba, K., Kadaleka, S., Kasambara, A., “Variable-length hill cipher with MDS key matrix”, International Journal of Computer Applications 57(13) (2012) : 43-45.
- [6] Acharya, B., Rath, G.S., Patra, S.K., Panigrahy, S.K., “Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm”, International Journal of Security (IJS) 1(1) (2007) : 14-21.
- [7] Lin, C.H., Lee, C.Y., Lee, C.Y., “Comments on saeednia’s improved scheme for the hill cipher”, Journal of the Chinese Institute of Engineers 27(5) (2004) : 743-746.
- [8] Mahendran, R., Mani, K., “Generation of key matrix for hill cipher encryption using classical cipher” in 2017 World Congress on Computing and Communication Technologies (WCCCT) (2017).
Details
Primary Language
English
Subjects
Information Security and Cryptology, Algebra and Number Theory
Journal Section
Research Article
Authors
Şeyda Dalkılıç
*
0000-0002-3858-8351
Türkiye
Publication Date
April 29, 2025
Submission Date
July 15, 2024
Acceptance Date
February 25, 2025
Published in Issue
Year 2025 Volume: 10 Number: 1
Cited By
On properties of n-parametric and bi-geometric circulant matrices
Computational and Applied Mathematics
https://doi.org/10.1007/s40314-025-03511-5