Abstract
The main purpose of this paper is to examine applications of group theoretical concepts to cryptography. We construct a backward deterministic system employing the action of the modular group on the upper half plane and the amalgamated free product structure of the group. We invent a geometrical algorithm that finds the normal form of an element of the modular group effectively. This algorithm makes our backward deterministic system tractable. Using the backward deterministic system, we invent a public-key cryptosystem in terms of a functional cryptosystem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 266 November 11 (1994) 1021–1024
D.E. Cohen, Combinatorial Group Theory: A Topological Approach, (Cambridge University Press, Cambridge) (1989)
H. Cohen, A Course in Computational Algebraic Number Theory, Springer, New York, (1996)
J. Kari, A cryptoanalytic observation concerning systems based on language theory, Discr. Appl. Math. 21 (1988) 265–268
J. Kari, Observations concerning a public-key cryptosystem based on iterated morphisms, Theor. Compt. Sci. 66 (1989) 45–53
N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer, New York (1991)
R.C. Lyndon and P.E. Schupp, Combinatorial Group Theory, Springer, New York, (1976)
J.J. Rotman, An Introduction to Theory of Groups, Springer, New York (1995)
A. Salomaa, A public-key cryptosystem based on language theory, Computers and Security, 7 (1988) 83–87
A. Salomaa, Public-Key Cryptography, Springer, Berlin, (1990)
A. Salomaa and S. Yu, On a public-key cryptosystem based on iterated morphisms and substitutions, Theor. Compt. Sci. 48 (1986) 283–296
J-P. Serre, A Course in Arithmetic, Springer, New York (1973)
P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp. 26 (1997) 1484–1509
A. Yamamura, Public-key cryptosystems using the modular group, International Workshop on Practice and Theory in Public Key Cryptography, LNCS vol 1431, (1998) 203–216
G. Zémor, Hash functions and Cayley graphs, Designs, Codes and Cryptography 4 (1994) 381–394
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamura, A. (1999). A Functional Cryptosystem Using a Group Action. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol 1587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48970-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-48970-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65756-9
Online ISBN: 978-3-540-48970-2
eBook Packages: Springer Book Archive