Abstract
In the paper, application of idempotent elements to construction of cryptographic systems has been presented. The public key cryptosystem bead on idempotent elements and the cryptographic transformation that preserves elementary arithmetic operatione have been described.
Chapter PDF
Similar content being viewed by others
5. References
Merkle R., Hellman M.E., Hiding Information and Receits in Trapdoor Knapsack, IEEE Trans. Inf. Theory, IT-24, September 1978, pp. 525–530
Narkiewicz W., The Numbers Theory, PWN, Warsaw, 1977
Pieprzyk J.P., Rutkowski D.A., Application of Public Key Cryptosystems to Data Security, Rozprawy Elektrotechniczne to be published
Pollard J.M., A Monte Carlo Method for Factorization, BIT 15, 1975, pp.331–334
Rivest R.L., Shamir A., Adleman L., A Method for Obtaining Digital Signatures and Public Key Cryptosystems, Communications of the ACM, Vol. 21, February 1978, pp.120–126
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J.P. (1985). Algebraical Structures of Cryptographic Transformations. In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive