Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Roberto Civino"'
Publikováno v:
Applied Sciences, Vol 13, Iss 24, p 13024 (2023)
While technological advancements and their deep integration in connected and automated vehicles is a central aspect in the evolving trend of automotive industry, they also depict a growing size attack surface for malicious actors: the latter ones typ
Externí odkaz:
https://doaj.org/article/3b79ce46299e41529d773f56c95450ba
Publikováno v:
Discrete Mathematics Letters, Vol 8, Pp 72-77 (2021)
Externí odkaz:
https://doaj.org/article/d62a86a41d99491398a8669e9e976f09
Autor:
Roberto Civino, Riccardo Longo
Publikováno v:
Advances in Mathematics of Communications. 17:562-571
Key assignment and key maintenance in encrypted networks of resource-limited devices may be a challenging task, due to the permanent need of replacing out-of-service devices with new ones and to the consequent need of updating the key information. Re
Publikováno v:
Aequationes mathematicae. 96:1339-1363
A partition into distinct parts is refinable if one of its parts a can be replaced by two different integers which do not belong to the partition and whose sum is a, and it is unrefinable otherwise. Clearly, the condition of being unrefinable imposes
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:735-746
Publikováno v:
Journal of Algebra
The affine general linear group acting on a vector space over a prime field is a well-understood mathematical object. Its elementary abelian regular subgroups have recently drawn attention in applied mathematics thanks to their use in cryptography as
Publikováno v:
Information Processing Letters. 181:106361
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller integers witho
Autor:
Roberto Civino, Riccardo Aragona
Publikováno v:
Mediterranean Journal of Mathematics. 18
In symmetric cryptography, the round functions used as building blocks for iterated block ciphers are obtained as the composition of different layers acting as a sequence of bijective transformations providing global increasing complexity. The study
Publikováno v:
Advances in Mathematics of Communications
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the composition of different layers which provide confusion and diffusion, and key a
The key-scheduling algorithm in the AES is the component responsible for selecting from the master key the sequence of round keys to be xor-ed to the partially encrypted state at each iteration. We consider here the group [Formula: see text] generate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1f830b28be5f215b38f311a4e864a54