Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-12-02T20:43:25.249Z Has data issue: false hasContentIssue false
  • English
  • Français

Cryptography based on algebraic perpendicularities

Published online by Cambridge University Press:  16 February 2023

Timo Tossavainen
Timo Tossavainen*
Affiliation:
Department of Health, Education and Technology, Lulea University of Technology, 97187 Lulea, Sweden e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Cryptography, the mathematics of protecting secret or sensitive information, is a continuously evolving area of interest. A concrete example of this is the fact that worldwide spending on information security and risk management technology and services has been estimated to reach over $150 billion in 2021. Modern cryptography is actually not a single separate domain of mathematics but an advanced encryption scheme can be based on applications of results in number theory, such as the Euler–Fermat Theorem, or involve the discrete logarithm problem using either a primitive root of a large prime or an element of an elliptic curve over a prime field. In the background, probability theory, statistics, studies on computational models and finite geometries, etc. play a major role. Recent research has considered even DNA-based molecular cryptography systems.

Type
Articles
Information
The Mathematical Gazette , Volume 107 , Issue 568 , March 2023 , pp. 65 - 69
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Mathematical Association

References

Reade, J. B., Modular arithmetic and cryptography, Math. Gaz. 72 (October 1988) pp. 198–202.10.2307/3618250CrossRefGoogle Scholar
Haukkanen, P., Mattila, M., Merikoski, J.K., and Tossavainen, T., Perpendicularity in an Abelian group, Internat. J. Math. Math. Sci. (2013), Article 983607.Google Scholar
Mattila, M., Haukkanen, P., Merikoski, J. K., and Tossavainen, T., Maximal perpendicularity in certain Abelian groups, Acta Univ. Sapientiae, Math. 9 (2017) pp. 235–247.Google Scholar
Lewand, R. E., The perfect cipher, Math. Gaz. 94 (November 2010), pp. 401–411.CrossRefGoogle Scholar