Поиск

Автор

Ключевое слово

Тип статьи

DOI

ORCID

Дополнительно:

Период публикации

Репозиторий

По вашему запросу найдено документов: 6447

Страница 5 из 645

Boolean algebras and closed under the symmetric difference.

for polymodal algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class

algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class of polymodal

and obtain that the minimal Lee distance between them is equal to q ■ 2n-3. For Boolean case

and Feistel networks. Mathematically, S-box is a vectorial Boolean function F : Fn Fm that should satisfy

We propose a simple method of constructing S-boxes using Boolean functions and permutations. Let n

. Those gates are AND, OR, NAND and NOR. A method for solving this problem by means of Boolean functions

as an optimization problem. The resulting optimization model represents a problem of conditional pseudo-Boolean

Boolean algebras and closed under the symmetric difference.

algebras (i.e., Boolean algebras with distinguished modalities). We prove that the class of polymodal

Страница 5 из 645