[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.14317/jami.2021.093

GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL

MATYSIAK, LUKASZ (Institute of Mathematics, Kazimierz Wielki University)

Publication Information

Journal of applied mathematics & informatics / v.39, no.1_2, 2021 , pp. 93-103 More about this Journal

Abstract

In this paper I am considering several cryptological threads. The problem of the RSA cipher, like the Diffie-Hellman protocol, is the use of finite sets. In this paper, I generalize the RSA cipher and DH protocol for infinite sets using monoids. In monoids we can not find the inverse, which makes it difficult. In the second part of the paper I show the applications in cryptology of polynomial composites and monoid domains. These are less known structures. In this work, I show different ways of encrypting messages based on infinite sets.

Keywords

cryptology; decryption; encryption; RSA; protocol;

Citations & Related Records

Reference

1	A. David, Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice, CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security 12 (2015), 5-17.
2	W. Diffie and M.E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory 22 (1976), 644-654. DOI
3	J.H. Ellis, The possibility of Non-Secret digital encryption, CESG Research Report Corpus ID: 18813089, 2014.
4	N. Koblitz, A Course in Number Theory and Cryptography, Graduate Texts in Math., Springer, ISBN 978-1-4419-8592-7.
5	M. Fontana and S. Kabbaj, On the Krull and valuative dimension of D+XDS[X] domains, J. Pure Appl. Algebra 63 (1990), 231-245. DOI
6	M.E. Hellman and E. Martin, An overview of public key cryptography, IEEE Communications Magazine 40 (2002), 42-49.
7	P. Jeffdrzejewicz, M. Marciniak, L. Matysiak and J. Zielinski, On properties of square-free elements in commutative cancellative monoids, Semigroup Forum 100 (2020), 850-870. DOI
8	S. McAdam and D.E. Rush, Schreier Rings, Bull. London Math. Soc. 10 (1978), 77-80. DOI
9	L. Matysiak, On properties of composites and monoid domains, Accepted for printing in Advances and Applications in Mathematical Sciences arXiv: 2006.14948, (2020).
10	L. Matysiak, ACCP and atomic properties of composites and monoid domains, Accepted for printing in Indian Journal of Mathematics http://lukmat.ukw.edu.pl/ACCP%20and%20atomic%20properties%20of%20composites%20and%20monoid%20domains.pdf, (2020).
11	Merkle and C. Ralph, Secure Communications Over Insecure Channels, Communications of the ACM 21 (1978), 294-299. DOI
12	G. Picavet, About GCD domains, Advances in commutative ring theory 205 (1999), 501-519.
13	D.D. Anderson, GCD domains, Gauss' Lemma and contents of polynomials, Non-Noetherian Commutative Ring Theory 520 (2000), 1-31.
14	M. Cozzens and S. J. Miller, The Mathematics of Encryption: An Elementary Introduction, American Mathematical Society, 2013.
15	D.D. Anderson and D.F. Anderson, Generalized GCD domains, Comment. Math. Univ. St. Pauli 28 (1979), 215-221.
16	D.D. Anderson, D.F. Anderson, and M. Zafrullah, Rings between D[X] and K[X], Houston J. of Mathematics 17 (1991), 109-129.
17	D.F. Anderson and A. Ryckaert, The class group of D + M, J. Pure Appl. Algebra 52 (1988), 199-212. DOI
18	J. Brewer and E. Rutter, D + M construction with general overrings, Mich. Math. J. 23 (1976), 33-42.
19	D. Costa, J. Mott, and M. Zafrullah, The construction D+XDS[X], J. Algebra 153 (1978), 423-439.
20	R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM 21 (1978), 120-126. DOI
21	N. Smart, Dr Clifford Cocks CB, Bristol University, (2008), Retrieved August 14, 2011.
22	M. Zafrullah, On a property of pre-Schreier domains, Comm. Algebra 15 (1987), 1895-1920. DOI
23	M. Zafrullah, The D + XDS[X] construction from GCD-domains, J. Pure Appl. Algebra 50 (1988), 93-107. DOI
24	Dr. Clifford Cocks CB, BBC News, https://www.bbc.com/news/uk-englandgloucestershire-11475101, 2010.