Encryption schemes using Plotkin arrays

Koukouvinos, C; Simos, DE

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Simos, DE	en
dc.date.accessioned	2014-03-01T01:35:38Z
dc.date.available	2014-03-01T01:35:38Z
dc.date.issued	2011	en
dc.identifier.issn	1935-0090	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21133
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-84857131893&partnerID=40&md5=1b3f5fea98cac76d75d252427a4b9dbc	en
dc.subject	Cipher	en
dc.subject	Cryptography	en
dc.subject	Encryption	en
dc.subject	Orthogonal designs	en
dc.subject	Plotkin arrays	en
dc.title	Encryption schemes using Plotkin arrays	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	In this paper we propose a cipher similar to the One Time Pad and Hill cipher based on a subband coding scheme using Plotkin arrays. The encoding process is an approximation to the One Time Pad encryption scheme. We present experimental results which suggest that a brute force attack to the proposed scheme does not result in all possible plaintexts, as the One Time Pad does, but still the brute force attack does not compromise the system. © 2011 NSP.	en
heal.publisher	NATURAL SCIENCES PUBLISHING CORPORATION	en
heal.journalName	Applied Mathematics and Information Sciences	en
dc.identifier.isi	ISI:000295657900011	en
dc.identifier.volume	5	en
dc.identifier.issue	3	en
dc.identifier.spage	547	en
dc.identifier.epage	557	en