Articolul precedent 
Articolul urmator 
254 2 
Ultima descărcare din IBN: 20230506 09:55 
Căutarea după subiecte similare conform CZU 
330.4:517.987.3 (1) 
Economie matematică (127) 
Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (243) 
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, 2324 septembrie 2022, Chişinău. Chişinău Republica Moldova: Departamentul EditorialPoligrafic al ASEM, 2022, Ediţia a 26a , pp. 321331. ISBN 9789975359061. DOI: https://doi.org/10.53486/cike2022.39 
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core 
Competitivitatea şi inovarea în economia cunoaşterii Ediţia a 26a , 2022 

Conferința "Competitivitate şi inovare în economia cunoaşterii" 26, Chişinău, Moldova, 2324 septembrie 2022  


DOI:https://doi.org/10.53486/cike2022.39  
CZU: 330.4:517.987.3  
JEL: C61, C63  
Pag. 321331 



Descarcă PDF  
Rezumat  
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 longlived 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. 

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


Cerif XML Export
<?xml version='1.0' encoding='utf8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif1.51' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif1.51 http://www.eurocris.org/Uploads/Web%20pages/CERIF1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchemainstance' release='1.5' date='20121007' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibnResPubl177319</cfResPublId> <cfResPublDate>2022</cfResPublDate> <cfVol>Ediţia a 26a </cfVol> <cfStartPage>321</cfStartPage> <cfISBN>9789975359061</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/177319</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>A key exchange method based on boolean functions as subsets of columns</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Boolean function; subsets of column; Boolean function derivatives; key exchange; secret key; session key</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>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 longlived 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.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e934c511e1b86c0800200c9a66</cfClassId> <cfClassSchemeId>759af93834ae11e1b86c0800200c9a66</cfClassSchemeId> <cfStartDate>2022T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f4b7e4d88929f7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f446d460a98e55dce57550c48</cfClassSchemeId> <cfStartDate>2022T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibnperson18028</cfPersId> <cfClassId>498158701cfe11e18bc20800200c9a66</cfClassId> <cfClassSchemeId>b7135ad01d0011e18bc20800200c9a66</cfClassSchemeId> <cfStartDate>2022T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibnPers18028</cfPersId> <cfPersName_Pers> <cfPersNameId>ibnPersName180283</cfPersNameId> <cfClassId>55f90543d63142eb8d47d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609dcfa645cea80375de69abe21f</cfClassSchemeId> <cfStartDate>2022T24:00:00</cfStartDate> <cfFamilyNames>Zgureanu</cfFamilyNames> <cfFirstNames>Aureliu</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>