Encryption through square grid automata

Mary, Francis Remigius Perpetua; Shobana, Loganathan; Sujatha, Ramalingam

dc.contributor.author	Mary, Francis Remigius Perpetua	en_US
dc.contributor.author	Shobana, Loganathan	en_US
dc.contributor.author	Sujatha, Ramalingam	en_US
dc.date.accessioned	2023-01-04T18:26:31Z
dc.date.available	2023-01-04T18:26:31Z
dc.date.issued	2023-01
dc.identifier.citation	Mary, F. R. P., Shobana, L. & Sujatha, R. (2023). Encryption through square grid automata. TWMS Journal Of Applied And Engineering Mathematics, 13(1), 285-290.	en_US
dc.identifier.issn	2146-1147	en_US
dc.identifier.issn	2587-1013	en_US
dc.identifier.uri	https://hdl.handle.net/11729/5222
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/964
dc.description.abstract	In this paper, a new approach to encrypt and decrypt messages by implementing the concept of cordial words and cordial numbers to square grid automaton is being analyzed.	en_US
dc.language.iso	en	en_US
dc.publisher	Işık University Press	en_US
dc.relation.ispartof	TWMS Journal Of Applied And Engineering Mathematics	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Encryption	en_US
dc.subject	Decryption	en_US
dc.subject	Cordial words	en_US
dc.subject	Cordial numbers	en_US
dc.title	Encryption through square grid automata	en_US
dc.type	Article	en_US
dc.description.version	Publisher's Version	en_US
dc.identifier.volume	13
dc.identifier.issue	1
dc.identifier.startpage	285
dc.identifier.endpage	290
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US
dc.indekslendigikaynak	Emerging Sources Citation Index (ESCI)	en_US
dc.indekslendigikaynak	MathScinet	en_US
dc.indekslendigikaynak	Scopus	en_US