scholarly journals On the associativity property of MPF over M16

2018 ◽  
Vol 59 ◽  
pp. 7-12
Author(s):  
Aleksejus Mihalkovich
Keyword(s):  
Power Function ◽  
Algebraic Structure ◽  
Interesting Problem ◽  
Algebraic Structures ◽  
Basic Properties ◽  
Matrix Power ◽  
One Way Function ◽  
Future Work

The objective of this paper is to find suitable non-commuting algebraic structure to be used as a platform structure in the so-called matrix power function (MPF). We think it is non-trivial and interesting problem could be useful for candidate one-way function (OWF) construction with application in cryptography. Since the cornerstone of OWF construction using non-commuting algebraic structures is the satisfiability of certain associativity conditions, we consider one of the possible choices, i.e. the group M16, explore its basic properties and construct templates to use in our future work. 

scholarly journals MPF Problem over Modified Medial Semigroup Is NP-Complete

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 571 ◽  
Author(s):  
Eligijus Sakalauskas ◽  
Aleksejus Mihalkovich
Keyword(s):  
Power Function ◽  
Polynomial Time ◽  
Cryptographic Protocols ◽  
Binary Field ◽  
Dual Interpretation ◽  
Np Complete ◽  
Matrix Power ◽  
Necessary Constraints ◽  
One Way Function ◽  
Polynomial Time Reduction

This paper is a continuation of our previous publication of enhanced matrix power function (MPF) as a conjectured one-way function. We are considering a problem introduced in our previous paper and prove that tis problem is NP-Complete. The proof is based on the dual interpretation of well known multivariate quadratic (MQ) problem defined over the binary field as a system of MQ equations, and as a general satisfiability (GSAT) problem. Due to this interpretation the necessary constraints to MPF function for cryptographic protocols construction can be added to initial GSAT problem. Then it is proved that obtained GSAT problem is NP-Complete using Schaefer dichotomy theorem. Referencing to this result, GSAT problem by polynomial-time reduction is reduced to the sub-problem of enhanced MPF, hence the latter is NP-Complete as well.

scholarly journals Perfectly Secure Shannon Cipher Construction Based on the Matrix Power Function

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 860
Author(s):  
Eligijus Sakalauskas ◽  
Lina Dindienė ◽  
Aušrys Kilčiauskas ◽  
Kȩstutis Lukšys
Keyword(s):  
Power Function ◽  
Block Cipher ◽  
Data Block ◽  
Theoretical Level ◽  
Complete Problem ◽  
The Matrix ◽  
Matrix Power ◽  
Shannon Cipher ◽  
One Way Function ◽  
Selection Of

A Shannon cipher can be used as a building block for the block cipher construction if it is considered as one data block cipher. It has been proved that a Shannon cipher based on a matrix power function (MPF) is perfectly secure. This property was obtained by the special selection of algebraic structures to define the MPF. In an earlier paper we demonstrated, that certain MPF can be treated as a conjectured one-way function. This property is important since finding the inverse of a one-way function is related to an N P -complete problem. The obtained results of perfect security on a theoretical level coincide with the N P -completeness notion due to the well known Yao theorem. The proposed cipher does not need multiple rounds for the encryption of one data block and hence can be effectively parallelized since operations with matrices allow this effective parallelization.

scholarly journals Security analysis of key agreement protocol based on matrix power function

2012 ◽  
Vol 53 ◽  
Author(s):  
Paulius Vitkus ◽  
Eligijus Sakalauskas
Keyword(s):  
Power Function ◽  
Key Agreement ◽  
Security Analysis ◽  
Braid Groups ◽  
Quadratic Problem ◽  
Key Agreement Protocol ◽  
Np Complete ◽  
Matrix Power ◽  
The One ◽  
One Way Function

Key agreement protocol (KAP) using Burau braid groups representation and matrix power function (MPF) is analyzed. MPF arguments are Burau representation matrices defined over finite field or ring. It is shown that KAP security relies on the solution of matrix multivariate quadratic system of equations over the ring with additional commutation constraints for matrices to be found. We are making a conjecture that proposed KAP is a candidate one-way function since its inversion is related with the solution of known multivariate quadratic problem which is NP-complete over any field. The one of advantages of proposed KAP is its possible effective realization even in restricted computational environments by avoiding arithmetic operations with big integers.

scholarly journals Neutrosophic Multigroups and Applications

Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 95 ◽  
Author(s):  
Vakkas Uluçay ◽  
Memet Şahin
Keyword(s):  
Group Theory ◽  
Set Theory ◽  
Algebraic Structure ◽  
Group Structure ◽  
Algebraic Structures ◽  
Neutrosophic Sets ◽  
Basic Properties

In recent years, fuzzy multisets and neutrosophic sets have become a subject of great interest for researchers and have been widely applied to algebraic structures include groups, rings, fields and lattices. Neutrosophic multiset is a generalization of multisets and neutrosophic sets. In this paper, we proposed a algebraic structure on neutrosophic multisets is called neutrosophic multigroups which allow the truth-membership, indeterminacy-membership and falsity-membership sequence have a set of real values between zero and one. This new notation of group as a bridge among neutrosophic multiset theory, set theory and group theory and also shows the effect of neutrosophic multisets on a group structure. We finally derive the basic properties of neutrosophic multigroups and give its applications to group theory.

scholarly journals Sigma Identification Protocol Construction Based on MPF

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1683
Author(s):  
Eligijus Sakalauskas ◽  
Inga Timofejeva ◽  
Ausrys Kilciauskas
Keyword(s):  
Power Function ◽  
Security Proof ◽  
Np Complete ◽  
Matrix Power ◽  
One Way Function ◽  
Near Semiring

A new sigma identification protocol (SIP) based on matrix power function (MPF) defined over the modified medial platform semigroup and power near-semiring is proposed. It is proved that MPF SIP is resistant against direct and eavesdropping attacks. Our security proof relies on the assumption that MPF defined in the paper is a candidate for one-way function (OWF). Therefore, the corresponding MPF problem is reckoned to be a difficult one. This conjecture is based on the results demonstrated in our previous studies, where a certain kind of MPF problem was proven to be NP-complete.

scholarly journals Some Results on Multigranulation Neutrosophic Rough Sets on a Single Domain

Symmetry ◽  
2018 ◽  
Vol 10 (9) ◽  
pp. 417 ◽  
Author(s):  
Hu Zhao ◽  
Hong-Ying Zhang
Keyword(s):  
Algebraic Structure ◽  
Rough Sets ◽  
Lattice Structure ◽  
Single Domain ◽  
One Dimensional ◽  
Basic Properties ◽  
Approximation Operators ◽  
Rough Approximation ◽  
The One ◽  
Comprehensive Study

As a generalization of single value neutrosophic rough sets, the concept of multi-granulation neutrosophic rough sets was proposed by Bo et al., and some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators were studied. However, they did not do a comprehensive study on the algebraic structure of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators. In the present paper, we will provide the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In particular, in the one-dimensional case, for special neutrosophic relations, the completely lattice isomorphic relationship between upper neutrosophic rough approximation operators and lower neutrosophic rough approximation operators is proved.

On single valued neutrosophic sets and neutrosophic א-structures: Applications on algebraic structures (hyperstructures)

2020 ◽  
pp. 108-117
Author(s):  
Madeleine Al Al-Tahan ◽  
◽  
◽  
Bijan Davvaz
Keyword(s):  
Algebraic Structure ◽  
Algebraic Structures ◽  
Neutrosophic Sets

In this paper, we find a relationship between SVNS and neutrosophic N-structures and study it. Moreover, we apply our results to algebraic structures (hyperstructures) and prove that the results on neutrosophic N-substructure (subhyperstructure) of a given algebraic structure (hyperstructure) can be deduced from single valued neutrosophic algebraic structure (hyperstructure) and vice versa.

An approach to fuzzy multi-ideals of near rings

2021 ◽  
pp. 1-11
Author(s):  
Madeline Al Tahan ◽  
Sarka Hoskova-Mayerova ◽  
Bijan Davvaz
Keyword(s):  
Algebraic Structure ◽  
Algebraic Structures

In recent years, fuzzy multisets have become a subject of great interest for researchers and have been widely applied to algebraic structures including groups, rings, and many other algebraic structures. In this paper, we introduce the algebraic structure of fuzzy multisets as fuzzy multi-subnear rings (multi-ideals) of near rings. In this regard, we define different operations on fuzzy multi-ideals of near rings and we generalize some results known for fuzzy ideals of near rings to fuzzy multi-ideals of near rings.

scholarly journals Logic and Truth: Some Logics without Theorems

2008 ◽  
pp. 104-117
Author(s):  
Jayanta Sen ◽  
Mihir Kumar Chakraborty
Keyword(s):  
Algebraic Structure ◽  
Logical Consequence ◽  
The Other ◽  
Algebraic Structures ◽  
Sequent Calculi

Two types of logical consequence are compared: one, with respect to matrix and designated elements and the other with respect to ordering in a suitable algebraic structure. Particular emphasis is laid on algebraic structures in which there is no top-element relative to the ordering. The significance of this special condition is discussed. Sequent calculi for a number of such structures are developed. As a consequence it is re-established that the notion of truth as such, not to speak of tautologies, is inessential in order to define validity of an argument.

On EMV-Semirings

2019 ◽  
Vol 69 (4) ◽  
pp. 739-752 ◽  
Author(s):  
R. A. Borzooei ◽  
M. Shenavaei ◽  
A. Di Nola ◽  
O. Zahiri
Keyword(s):  
Distributive Lattice ◽  
Algebraic Structure ◽  
Maximal Ideal ◽  
Boolean Algebras ◽  
Algebraic Extension ◽  
Theoretic Approach ◽  
Basic Properties ◽  
Mv Algebra ◽  
Definition Of ◽  
Generalized Boolean Algebras

Abstract The paper deals with an algebraic extension of MV-semirings based on the definition of generalized Boolean algebras. We propose a semiring-theoretic approach to EMV-algebras based on the connections between such algebras and idempotent semirings. We introduce a new algebraic structure, not necessarily with a top element, which is called an EMV-semiring and we get some examples and basic properties of EMV-semiring. We show that every EMV-semiring is an EMV-algebra and every EMV-semiring contains an MV-semiring and an MV-algebra. Then, we study EMV-semiring as a lattice and prove that any EMV-semiring is a distributive lattice. Moreover, we define an EMV-semiring homomorphism and show that the categories of EMV-semirings and the category of EMV-algebras are isomorphic. We also define the concepts of GI-simple and DLO-semiring and prove that every EMV-semiring is a GI-simple and a DLO-semiring. Finally, we propose a representation for EMV-semirings, which proves that any EMV-semiring is either an MV-semiring or can be embedded into an MV-semiring as a maximal ideal.

Sign in / Sign up

Export Citation Format

Share Document