A key exchange method based on boolean functions as subsets of columns
Articolul precedent
Articolul urmator
197 2
Ultima descărcare din IBN:
2023-05-06 09:55
Căutarea după subiecte
similare conform CZU
330.4:517.987.3 (1)
Economie matematică (126)
Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (242)
SM ISO690:2012
ZGUREANU, Aureliu. A key exchange method based on boolean functions as subsets of columns. In: Competitivitatea şi inovarea în economia cunoaşterii, Ed. 26, 23-24 septembrie 2022, Chişinău. Chişinău Republica Moldova: Departamentul Editorial-Poligrafic al ASEM, 2022, Ediţia a 26-a , pp. 321-331. ISBN 978-9975-3590-6-1. DOI: https://doi.org/10.53486/cike2022.39
EXPORT metadate:
Google Scholar

Dublin Core
Competitivitatea şi inovarea în economia cunoaşterii
Ediţia a 26-a , 2022
Conferința "Competitivitate şi inovare în economia cunoaşterii"
26, Chişinău, Moldova, 23-24 septembrie 2022

A key exchange method based on boolean functions as subsets of columns

CZU: 330.4:517.987.3
JEL: C61, C63

Pag. 321-331

Zgureanu Aureliu
Academy of Economic Studies of Moldova
Disponibil în IBN: 28 martie 2023


The representation of Boolean functions as subsets of columns and one of its possible applications is discussed in this paper. Depending on the area of application, different Boolean function representations are used. Boolean functions as subsets of columns were investigated by the author together with other colleagues and published in many scientific works, which allow to apply this kind of representation in different domains. Based on the properties of the subsets of columns of Boolean functions, an algorithm of encryption key exchange between two or more entities is proposed. The algorithm consists of a long-lived secret key which consist of a family of n Boolean functions. The session key kses is defined by a subset of column of the partial derivative of one of the Boolean functions, randomly chosen from the secret key. The parameters that uniquely determine the secret key are generated randomly by one of the parties and may be sent nonencrypted to all other who are involved in the communication session. The main advantage of the algorithm is that it doesn’t use public key cryptography, which is much more computationally demanding than calculation of the particular subset of column. The main challenge of the algorithm is choosing the correct type of functions that have as diverse subsets of columns as possible. The parameters of the table of partial derivatives of the Boolean functions also are very important and they need to best suit our purpose. These two particularities need further investigations.

Boolean function, subsets of column, Boolean function derivatives, key exchange, secret key, session key