Application of composition primitive polynomials for implementation of large-scale S-boxes

dc.contributor.author	Tho H.
dc.date.accessioned	2018-09-18T20:34:35Z
dc.date.available	2018-09-18T20:34:35Z
dc.date.issued	2013
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141305
dc.description.abstract	In this paper, the method of constructing algorithm for the implementation of large-scale S-box is proposed. Method is based on the composition primitive polynoms under GF(2) allowing to maximize the performance of S-box of a given implementation on different platforms, or to minimize the complexity of a given speed. © 2013 Pleiades Publishing, Ltd.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	Cryptography
dc.subject	Finite Fields
dc.subject	S-box
dc.title	Application of composition primitive polynomials for implementation of large-scale S-boxes
dc.type	Article
dc.relation.ispartofseries-issue	4
dc.relation.ispartofseries-volume	34
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	316
dc.source.id	SCOPUS19950802-2013-34-4-SID84891281131

Files in this item

Size: 43.52Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.