Processing math: 100%
Research article

Public key exchange protocols based on tropical lower circulant and anti circulant matrices

  • In recent years, many efficient key exchange protocols have been proposed based on matrices over the tropical semirings. The tropical addition of two elements is the minimum of the elements, while the tropical multiplication is the sum of the two elements. This paper proposes a novel key exchange protocol based on the min-plus semiring (Z{},,) by introducing anti-s-p-circulant matrices, which forms a commutative subset of Mn×n(Z{}). We have given further analysis of the protocol in detail using upper or lower-s-circulant matrices. Additionally, we prove that the set of all lower-s-circulant matrices is a sub-semiring of the tropical semiring Mn×n(Z{}). We discuss the detailed security analysis of the protocol with upper or lower-s-circulant matrices and provide cryptographic algorithms for both key exchange protocols with detailed explanations. We compare the protocol based on upper or lower-s-circulant matrices and our proposed protocol in terms of time complexity and memory usage. Finally, we analyse the security and show that our protocol is safe against popular attacks of tropical key exchange protocols. The security of these protocols relies on the difficulty of solving tropical non-linear equations.

    Citation: B. Amutha, R. Perumal. Public key exchange protocols based on tropical lower circulant and anti circulant matrices[J]. AIMS Mathematics, 2023, 8(7): 17307-17334. doi: 10.3934/math.2023885

    Related Papers:

    [1] Junjie Li, Gurpreet Singh, Onur Alp İlhan, Jalil Manafian, Yusif S. Gasimov . Modulational instability, multiple Exp-function method, SIVP, solitary and cross-kink solutions for the generalized KP equation. AIMS Mathematics, 2021, 6(7): 7555-7584. doi: 10.3934/math.2021441
    [2] Min Han, Bin Pei . An averaging principle for stochastic evolution equations with jumps and random time delays. AIMS Mathematics, 2021, 6(1): 39-51. doi: 10.3934/math.2021003
    [3] Hicham Saber, Tariq Alraqad, Rashid Abu-Dawwas . On graded s-prime submodules. AIMS Mathematics, 2021, 6(3): 2510-2524. doi: 10.3934/math.2021152
    [4] Xiao Qi, Tianyao Duan, Lihua Wang, Huan Guo . CATL's stock price forecasting and its derived option pricing: a novel extended fNSDE-net method. AIMS Mathematics, 2025, 10(2): 2444-2465. doi: 10.3934/math.2025114
    [5] Guocheng Li, Pan Zhao, Minghua Shi, Gensheng Li . A hybrid framework for mean-CVaR portfolio selection under jump-diffusion processes: Combining cross-entropy method with beluga whale optimization. AIMS Mathematics, 2024, 9(8): 19911-19942. doi: 10.3934/math.2024972
    [6] Nafissa Toureche Trouba, Mohamed E. M. Alngar, Reham M. A. Shohib, Haitham A. Mahmoud, Yakup Yildirim, Huiying Xu, Xinzhong Zhu . Novel solitary wave solutions of the (3+1)–dimensional nonlinear Schrödinger equation with generalized Kudryashov self–phase modulation. AIMS Mathematics, 2025, 10(2): 4374-4411. doi: 10.3934/math.2025202
    [7] Fahad Sikander, Firdhousi Begam, Tanveer Fatima . On submodule transitivity of QTAG-modules. AIMS Mathematics, 2023, 8(4): 9303-9313. doi: 10.3934/math.2023467
    [8] Shuo Xu, Chunrui Zhang . Spatiotemporal patterns induced by cross-diffusion on vegetation model. AIMS Mathematics, 2022, 7(8): 14076-14098. doi: 10.3934/math.2022776
    [9] Ali Yahya Hummdi, Amr Elrawy, Ayat A. Temraz . Neutrosophic modules over modules. AIMS Mathematics, 2024, 9(12): 35964-35977. doi: 10.3934/math.20241705
    [10] Saqib Mazher Qurashi, Ferdous Tawfiq, Qin Xin, Rani Sumaira Kanwal, Khushboo Zahra Gilani . Different characterization of soft substructures in quantale modules dependent on soft relations and their approximations. AIMS Mathematics, 2023, 8(5): 11684-11708. doi: 10.3934/math.2023592
  • In recent years, many efficient key exchange protocols have been proposed based on matrices over the tropical semirings. The tropical addition of two elements is the minimum of the elements, while the tropical multiplication is the sum of the two elements. This paper proposes a novel key exchange protocol based on the min-plus semiring (Z{},,) by introducing anti-s-p-circulant matrices, which forms a commutative subset of Mn×n(Z{}). We have given further analysis of the protocol in detail using upper or lower-s-circulant matrices. Additionally, we prove that the set of all lower-s-circulant matrices is a sub-semiring of the tropical semiring Mn×n(Z{}). We discuss the detailed security analysis of the protocol with upper or lower-s-circulant matrices and provide cryptographic algorithms for both key exchange protocols with detailed explanations. We compare the protocol based on upper or lower-s-circulant matrices and our proposed protocol in terms of time complexity and memory usage. Finally, we analyse the security and show that our protocol is safe against popular attacks of tropical key exchange protocols. The security of these protocols relies on the difficulty of solving tropical non-linear equations.



    Fibred categories were introduced by Grothendieck in [10]. In [9], he established the category of fibrations over a fixed base category B and demonstrated that it is a reflective subcategory of the category of all categories over B. Additionally, he discussed the preservation of limits by fibrations and applied some results to categories of sheaves. Furthermore, he discussed co-fibrations and dualized the results on concerning fibrations.

    In [5], Brown and Sivera explored fibred and co-fibred categories, particularly focusing on certain colimit calculations of algebraic homotopical invariants for spaces. They emphasized the potential for such calculations based on various Higher Homotopy van Kampen Theorems, detailed in [3]. Among their work, they established that fibred categories preserve colimits, that is, if Ψ:XB is a fibration and AB, then the inclusion map X/AX preserves colimits of connected diagrams. Also, they gave the relation between pushout and co-fibration. Moreover, they illustrated these results for homotopical calculations in groupoids, as well as for modules and crossed modules, in both cases over groupoids.

    In [11], it was shown that the category of crossed modules over commutative algebras is both fibred and co-fibred. They established that, if φ:PQ is a ring morphism, then there exists a pair of adjoint functors (φ,φ), where φ:XMod/QXMod/P and φ:XMod/PXMod/Q, given by pullback and induced crossed modules, respectively. In [7], the fibration of the category of 2-crossed modules over groups was studied.

    A crossed module of groups (P,C,) is defined by a group morphism :PC together with a (left) action of C on P satisfying the following relations:

    CM1) (cp)=c(p)c1,

    CM2) (p1)p2=p1p2p11,

    for all p,p1,p2P and cC. A crossed module is called crossed-C module when it has the same fixed codomain C. Crossed modules of groups were given first in [13,14]. The author defined this structure as models for (homotopy) 2-types.

    Generalized crossed modules were introduced by Yavari and Salemkar in [15]. They defined the generalized crossed module on a group morphism :PC with arbitrary actions of C on C and P on P instead of the usual conjugation actions. Thus, they generalized the concept of crossed module. Furthermore, they studied the relations between epimorphisms and surjective morphisms.

    The pullback crossed module of groups was given by Brown and Higgins in [4]. They constructed it over a crossed C-module and a fixed group morphism ν:GC, which led to the definition of a crossed C-module in the sense of a pullback diagram. This construction yielded the definition of a functor ν:XMod/GXMod/C, which has a left adjoint to the induced functor. (Co)-limits of crossed modules were studied for various algebraic structures over time [1,2,6,8,12].

    In this paper, we give the notions of fibration and (co-)fibration of generalized crossed modules in detail. We then construct the pullback and induced generalized crossed modules. Also, we get a functor

    ν:GCM/CGCM/G,

    which has a right adjoint functor, that is

    ν:GCM/GGCM/C.

    We recall the definition of a generalized crossed module from [15].

    Definition 2.1. A generalized crossed module (G,C,) consists of a group morphism :GC, together with the following properties,

    ⅰ) an action of G on G, denoted by g1Gg2, for every g1,g2G,

    ⅱ) an action of C on C, denoted by c1Cc2, for every c1,c2C,

    ⅲ) an action of C on G, denoted by cg, for every cC, gG,

    satisfying the conditions:

    GCM1) (cg)=cC(g),

    GCM2) (g)g=gGg,

    for all g,gG and cC. If only satisfies condition GCM1, we get a pre-generalized crossed module.

    Remark 2.2. Throughout this paper, an action of G on G is denoted by instead of G for any group G.

    A morphism (f,f):(G,C,)(G,C,) of generalized crossed modules consists of group morphisms f:GG and f:CC such that the diagram

    is commutative, i.e., f=f and

    f(cg)=f(c)f(g)

    for all cC and gG. Thus, we get the category of generalized crossed modules, denoted by GCM.

    Some examples of generalized crossed modules are given below:

    Example 2.3. If (G,C,) is any crossed module, then it is also a generalized crossed module.

    Example 2.4. Let :GC be a group morphism. If all actions are trivial, then becomes a generalized crossed module.

    Example 2.5. Let C and G be two groups. If the action of G on G is trivial and the actions of C on C and C on G are arbitrary, then the trivial morphism 1:GC is a generalized crossed module.

    Example 2.6. Every group gives a generalized crossed module. If D is a group, then (D,D,idD) is a generalized crossed module by the arbitrary action of D on itself. Thus, we get the functor

    λ:GRPGCM,

    which is the right adjoint of the functor

    λ:GCMGRP,

    where (D,C,) is a generalized crossed module and λ(D,C,)=D.

    Now, we give the definitions of fibration and co-fibrations of categories from [5].

    Definition 3.1. Let Ψ:XB be a functor. A morphism ψ:XX in X over υ:=Ψ(ψ) is called cartesian if and only if for all ν:BB in B and ϕ:YX with Ψ(ϕ)=υν there is a unique morphism η:YX with Ψ(η)=ν and ϕ=ψη.

    This is given by the following diagram:

    It is easy to show that ψ is an isomorphism if and only if ψ is a cartesian morphism over an isomorphism, and that cartesian morphisms are closed under composition.

    A morphism β:YX is called vertical, with respect to Ψ, if and only if Ψ(β) is an identity morphism in B. In particular, for AB we write X/A called fibre over A, for the subcategory of X consistings of those morphisms β with Ψ(β)=idA.

    Definition 3.2. The functor Ψ:XB is a fibration or category fibred over B if and only if υ:BA in B and X in X/A there is a cartesian morphism ψ:XX over υ: Such a ψ called a cartesian lifting of X along υ.

    In other words, in a category fibred over B, Ψ:XB, we can pullback objects of X along any arrow of B.

    Definition 3.3. Let Ψ:XB be a functor. A morphism η:YX in X over ν:=Ψ(η) is called cocartesian if and only if for all υ:BA in B and ϕ:YX with Ψ(ϕ)=υν there is a unique morphism ψ:XX with Ψ(ψ)=υ and ϕ=ψη. This is given by the following diagram:

    It is easy to show that ν is an isomorphism if and only if ν is a cocartesian morphism over an isomorphism, and that cocartesian morphisms are closed under composition.

    Definition 3.4. The functor Ψ:XB is a co-fibration or category co-fibred over B if and only if ν:BB in B and Y in X/B there is a cocartesian morphism η:YY over ν: Such a η called a cartesian lifting of Y along ν.

    Proposition 3.5. Let Ψ:XB be a fibration of categories. Then η:YX in X over ν:BB in B is cocartesian if and only if for all ϕ:YX1 over ν there is an unique morphism η:XX1 in X/B with ϕ=ηη, [5].

    In this section, we will show that the forgetful functor

    θ:GCMGRP,

    which takes (P,C,ι)GCM in its base group C, is a fibration.

    Theorem 3.6. The forgetful functor θ:GCMGRP is fibred.

    Proof. To prove that θ is fibred, we will get the pullback generalized crossed module. Let (P,C,ι) be a generalized crossed module and let υ:GC be a group morphism. Define

    υ(P)={(p,g)P×Gι(p)=υ(g)},

    and ι:υ(P)G by ι(p,g)=g for all (p,g)υ(P). The actions of G on G and υ(P) on υ(P) are componentwise, the action of G on υ(P) is defined by

    g(p,g)=(υ(g)p,gg),

    for all gG and (p,g)υ(P). Then, (υ(P),G,ι) is a generalized crossed G-module with the following equations:

    GCM1)

    ι(g(p,g))=ι(υ(g)p,gg)=gg=gι(p,g).

    GCM2)

    ι(p,g)(p,g)=g(p,g)=(υ(g)p,gg)=(ι(p)p,gg)=(pp,gg)=(p,g)(p,g),

    for all (p,g),(p,g)υ(P). Moreover, (υ,υ):(υ(P),G,ι)(P,C,ι) is a generalized crossed module morphism with υ(p,g)=p;

    υ(g(p,g))=υ(υ(g)p,gg)=υ(g)p=υ(g)υ(p,g)

    for all (p,g)υ(P) and gG.

    Suppose that f:TG is any group morphism, S is a group and (g,υf):(S,T,β)(P,C,ι) is a generalized crossed module morphism with p(g,υf)=υf. Then, there exists a unique generalized crossed module morphism (g,f):(S,T,β)(υ(P),G,ι) such that

    (υ,υ)(g,f)=(g,υf),    p(g,f)=f.

    We define g(s)=(g(s),fβ(s)) for all sS. Considering the diagram below:

    For all tT and sS, we get

    g(ts)=(g(ts),fβ(ts))=(υf(t)g(s),f(t)fβ(s))=f(t)(g(s),fβ(s))=f(t)(g(s)),

    and

    ιg(s)=ι(g(s),fβ(s))=fβ(s).

    Then, (g,f) is a generalized crossed module morphism. Furthermore, for all sS and tT, we get

    (υ,υ)(g,f)(s,t)=(υ,υ)(g(s),f(t))=(υg(s),υf(t))=(g(s),υf(t)).

    Then the diagram

    commutes. Finally, let (g,f):(S,T,β)(υ(P),G,ι) be a generalized crossed module morphism as the same property of (g,f). Clearly f=f. Define g(s)=(p,g) for all sS and for some pP,gG. Then, for all sS,

    g(s)=(p,g)=(υ(p,g),ι(p,g))=(υg(s),ιg(s))=(g(s),fβ(s))=(g(s),fβ(s))=g(s),

    so, we get

    g(s)=(p,g)=(g(s),fβ(s))=g(s).

    That is, (g,f) is unique.

    Consequently, we get a cartesian morphism (υ,υ):(υ(P),G,ι)(P,C,ι), for group morphism υ:GC and generalized crossed module (P,C,ι).

    Corollary 3.7. In the category of generalized crossed module, (υ(P),G,ι) and the following diagram

    are called a pullback generalized crossed module and pullback diagram, respectively.

    Example 3.8. Let i:NC be the inclusion map and N be a normal subgroup of C. (υ(N),G,i)(υ1(N),G,i) is the pullback generalized crossed module where,

    υ(N))={(n,g)i(n)=υ(g), nN, gG}{gGυ(g)=n, nN}υ1(N).

    See the pullback diagram below:

    Particularly, if N=1, then υ({1})kerυ and so (kerυ,G,i) is a pullback generalized crossed module. Consequently, kernels are particular examples of pullbacks. Moreover, if υ is surjective and N=C, then υ(C)G.

    Example 3.9. Let 1:PC be a generalized crossed module. Then,

    υ(P)={(p,g)P×Gυ(g)=1(p)=1}P×kerυ.

    See the pullback diagram below:

    So, if υ is injective, then υ(P)P. Furthermore, if P={1}, then υ(P)kerυ.

    Corollary 3.10. A pullback generalized crossed module (υ(P),G,ι) for the group morphism υ:GC gives a functor

    υ:GCM/CGCM/G,

    where objects and morphisms are defined as

    υ(P,C,ι)=(υ(P),G,ι)

    and

    υ(f,idC)=(υf,idG)

    such that υf(p,g)=(fp,g).

    Proposition 3.11. For each generalized crossed module morphism, (σ,idC):(P,C,ι)(P,C,ι), there is a morphism

    (υ(σ),idG):(υ(P),G,ι)(υ(P),G,ι),

    which is a unique morphism and satisfies the following equality,

    (σ,idC)(υ,υ)=(υ,υ)(υ(σ),idG).

    Proof.

    υ(υσ(p,g))=υ(σ(p),g)=σ(p)=σ(υ(p,g))=συ(p,g)

    for all (p,g)υ(P). Thus, the diagram

    is commutative.

    Proposition 3.12. If h1:GC and h2:TG are two morphisms of groups, then (h1h2) and h2h1 are naturally isomorphic, i.e.,

    h2h1(h1h2).

    Proof. Given any generalized crossed module (P,C,ι), we define f:h2h1(P)(h1h2)(P) as f((p,h2(t)),t)=(p,t) for all ((p,h2(t)),t)h2h1(P). It is clear that f is well-defined and a group morphism. Also,

    f(t(p,h2(t),t))=f((h2)(t)(p,h2(t)),tt)=f(((h1(h2)(t))p,h2(t)h2(t)),tt)=f(((h1h2)(t)p,h2(tt)),tt)=((h1h2)(t),tt)=t(p,t)=tf((p,h2(t)),t)

    and

    ¯ιf((p,h2(t)),t)=¯ι(p,t)=t=idT¯¯ι((p,h2(t)),t)

    for all ((p,h2(t)),t)h2h1(P). Thus, the diagram

    is commutative. Then, (f,idT) is a generalized crossed module morphism. It is clear that (f,idT) is an isomorphism.

    Additionaly, for each generalized crossed module morphism (σ,idC):(P,C,ι)(S,C,λ) and ((p,h2(t)),t)h2h1(P), we get

    (((h1h2)σ)fP)((p,h2(t)),t)=((h1h2)σ)(p,t)=(σ(p),t)=fS((σ(p),h2(t),t))=fS(h2h1σ)((p,h2(t)),t),

    so, the diagram

    commutes.

    Proposition 3.13. Let θ:GCMGRP be fibred, υ:GC be a group morphism and υ:GCM/CGCM/G is chosen. Then, there is a bijection,

    GCMυ((S,G,ρ),(P,C,ι))GCM/G((S,G,ρ),(υ(P),G,ι)),

    which is natural in (S,G,ρ)GCM/G and (P,C,ι)GCM/C where GCMυ((S,G,ρ),(P,C,ι)) consists of those morphisms fGCMυ((S,G,ρ),(P,C,ι)) with θ(f)=υ.

    Proof. Define ϕ:GCMυ((S,G,ρ),(P,C,ι))GCM/G((S,G,ρ),(υ(P),G,ι)) by ϕ(g,υ)=(g,idG) such that g(s)=(g(s),ρ(s)). Consider that ϕ(g,idG)=ϕ(h,idG) for (g,υ),(h,υ)GCMυ((S,G,ρ),(P,C,ι)). Then, we get (g,idG)=(h,idG) and so (g(s),ρ(s))=(h(s),ρ(s)), namely g=h. Thus, ϕ is one to one. Assume that (g,idG)GCM/G((S,G,ρ),(υ(P),G,ι)). Then, there is a morphism (υ1g,υ)GCMυ((S,G,ρ),(P,C,ι)) where υ1(p,g)=p, such that ϕ(υ1g,υ)=(g,idG). Consider the following diagram:

    It is clear that ϕ(υ1g,υ)=((υ1g),idG) and then,

    (υ1g)(s)=((υ1g)(s),ρ(s))=(υ1(g(s),ρ(s)),ρ(s))=(g(s),ρ(s))=g(s).

    Thus, ϕ is a bijection. Furthermore, the following diagram

    is commutative, since for (φ,idG):(S,G,ρ)(S,G,ρ) and sS, then

    (gφ)(s)=(g(φ(s)),ρ(φ(s)))=((gφ)(s),(ρφ)(s))=(gφ)(s)

    and

    ((φ,idG))(ϕ(g,υ))=((φ,idG))(g,idG)=(gφ,idG)=((gφ),idG)=ϕ(gφ,υ)=(ϕ((φ,idG)))(g,υ).

    Thus, ϕ is natural in (S,G,ρ). Moreover, for (σ,idC):(P,C,ι)(P,C,ι), we get

    (σg)(s)=(σ(g(s)),ρ(s))=((σ)g(s),ρ(s))=(υσ)(g(s),ρ(s))=(υσ)g(s)

    for sS and then

    ((υσ,idC))ϕ(g,υ)=(υσ,idC)(g,idC)=((υσ)g,idC)=((σg),idC)=ϕ(σg,υ)=(ϕ((φ,idC)))(g,υ).

    Thus, the diagram is

    commutative. So, ϕ is natural in (P,C,ι).

    Now we give the dual of Theorem 3.6.

    Theorem 3.14. The forgetful functor θ:GCMGRP is co-fibred.

    Let P be a group and CP be a free group generated by C×P with the relation

    (c,p)(c,p)=(c,pp)

    for all cC and p,pP. Thus, C acts on CP by

    c(c,p)=(cc,p)

    for cC and (c,p)CP.

    Proposition 3.15. Let (P,G,η) be a generalized crossed module and ν:GC be a group morphism. If CP is a free group, then we get the following commutative diagram:

    Define η:CPC by νη, that is η(c,p)=cνη(p) for all (c,p)CP. Then, we get

    η(c(c,p))=η(cc,p)=(cc)νη(p)=c(cνη(p))=cν(c,p)

    for all cC and (c,p)CP. Thus, η is the free pre-generalized crossed module generated by P.

    Proposition 3.16. Let (P,G,η) be a generalized crossed module and let ν:GC be a group morphism. Then, the induced generalized crossed module ν(P) is generated, as a group, by the set C×P, with the following relations,

    i) (c,p)(c,p)=(c,pp)ii) (c,gp)=(cν(g),p)iii) (c,p)(cp)=(cνη(p)c,p)

    for all (c,p),(c,p)CP and gG.

    The action of C on ν(P) defined by c(c,p)=(cc,p) for all cC and (c,p)CP. Thus,

    η:ν(P)C

    is given by η(c,p)=cνη(p), is a generalized crossed module, and the morphism

    (ν,ν):(P,G,η)(ν(P),C,η)

    is a generalized crossed module morphism. Define ν(p)=(1,p) for all pP and consider the diagram below:

    ν(gp)=(1,gp)=(1ν(g),p)=(ν(g),p)=ν(g)(1,p)=ν(g)ν(p)

    and

    ην(p)=η(1,p)=νη(p)

    for all gG and p,pP.

    Let (D,C,η1) be any generalized crossed module and (α,ν):(P,G,η)(D,C,η1) be any generalized crossed module morphism. Then, there is a unique generalized crossed module morphism (α,idC):(ν(P),C,η)(D,C,η1) such that the diagram

    commutes, i.e., (α,idC)(ν,ν)=(α,ν). Define α(c,p)=cα(p) for all (c,p)ν(P). Then, (α,idC) is a generalized crossed module morphism, since

    α(c(c,p))=α((cc,p))=(cc)α(p)=c(cα(p))=cα(c,p)=idC(c)(α(c,p))

    and

    αν(p)=α(1,p)=1α(p)=α(p)

    for all (c,p)ν(P) and cC. Moreover,

    αν(p)=α(1,p)=α(p)

    for all pP.

    Let (α,idC):(ν(P),C,η)(D,C,η1) be any generalized crossed module morphism with ρ(α,idC)=idC and (ν,ν)(α,idC)=(α,ν). For all (c,p)ν(P),

    α(c,p)=cα(p)=cαν(p)=cα(1,p)=idC(c)α(1,p)=α(c(1,p))=α(c,p).

    Then, (α,idC) is unique.

    Thus, we get a cocartesian morphism (ν,ν):(P,G,η)(ν(P),C,η), for group morphism ν:GC and generalized crossed module (P,G,η).

    Corollary 3.17. In the category of generalized crossed module, (ν(P),C,η) is called induced generalized crossed module with the following diagram:

    Corollary 3.18. An induced generalized crossed module (ν(P),C,η) for the group morphism ν:GC gives a functor

    ν:GCM/GGCM/C,

    which is the left adjoint functor of

    ν:GCM/CGCM/G.

    Proposition 3.19. Let ν1:GC and ν2:SG be two group morphisms. Then, (ν1ν2) and ν2ν1 are naturally isomorphic.

    Proposition 3.20. Let θ:GCMGRP be a co-fibred, υ:GC be a group morphism and a functor ν:GCM/GGCM/C is chosen. Then, there is a bijection

    GCMυ((P,G,η),(D,C,η1))GCM/C((ν(P),C,η),(D,C,η1)),

    which is natural in (P,G,η)GCM/G, (D,C,η1)GCM/C where GCMυ((P,G,η),(D,C,η1)) consists of those morphisms fGCMυ((P,G,η),(D,C,η1)) with θ(f)=υ.

    We deduce the following immediately from these discussions.

    Corollary 3.21. The category of generalized crossed module fibred and co-fibred over GRP, by the forgetful functor θ:GCMGRP.

    Proof. For any group morphism υ:GC, there is an adjoint functor pair (υ,υ) as previously stated in Corollary 3.18. That is, a bijection

    Φ:GCM/C((υ(P),C,η),(D,C,η1))GCM/G((P,G,η),(υ(D),G,η1))

    exists and is natural in (P,G,η)GCM/G, (D,C,η1)GCM/C. It is clear that Φ(α)=α and Φ1(α)=α. See diagram below:

    Yavari and Salemkar [15] defined the generalized crossed module on a group morphism :PC with arbitrary actions of C on C and P on P, instead of the usual conjugation actions. Thus, they generalized the concept of crossed modules. The category of generalized crossed modules provides a rich framework for studying various categorical structures and properties. In this paper, we extend well-known results from crossed modules to generalized crossed modules. It is shown that the forgetful functor θ:GCMGRP is both fibred and co-fibred. Moreover, a pair of adjoint functors (ν,ν), where ν:GCM/CGCM/G and ν:GCM/GGCM/C, is obtained for the group morphism ν:GC.

    The author declares that they have no conflict of interest to disclose.



    [1] F. Piper, S. Murphy, Cryptography: a very short introduction, New York: Oxford Academic, 2002. https://doi.org/10.1093/actrade/9780192803153.003.0001
    [2] G. Manikandan, R. Perumal, Symmetric cryptography for secure communication in IoT, Materials Today: Proceedings, 2020 (2020), 737. https://doi.org/10.1016/j.matpr.2020.09.737 doi: 10.1016/j.matpr.2020.09.737
    [3] S. Arshad, M. Khan, New extension of data encryption standard over 128-bit key for digital images, Neural Comput. Applic., 33 (2021), 13845–13858. https://doi.org/10.1007/s00521-021-06023-5 doi: 10.1007/s00521-021-06023-5
    [4] E. Fernando, D. Agustin, M. Irsan, D. F. Murad, H. Rohayani, D. Sujana, Performance comparison of symmetries encryption algorithm AES and DES with raspberry Pi, 2019 International Conference on Sustainable Information Engineering and Technology (SIET), Lombok, Indonesia, 2019,353–357. http://doi.org/10.1109/SIET48054.2019.8986122
    [5] A. J. Menezes, P. C. V. Oorschot, S. A. Vanstone, Handbook of applied cryptography, 1 Eds., Boca Raton: CRC Press, 1997. https://doi.org/10.1201/9780429466335
    [6] K. Ahmed, S. Pal, R. Mohan, A review of the tropical approach in cryptography, Cryptologia, 47 (2023), 63–87. https://doi.org/10.1080/01611194.2021.1994486 doi: 10.1080/01611194.2021.1994486
    [7] Y. W. Kao, K. Y. Huang, H. Z. Gu, S. M. Yuan, uCloud: a user-centric key management scheme for cloud data protection, IET Inform. Secur., 7 (2013), 144–154. https://doi.org/10.1049/iet-ifs.2012.0198 doi: 10.1049/iet-ifs.2012.0198
    [8] M. Habeeb, D. Kahrobaei, C. Koupparis, V. Shpilrain, Public key exchange using semidirect product of (semi) groups, In: Applied cryptography and network security, Heidelberg: Springer, 2013,475–486. https://doi.org/10.1007/978-3-642-38980-1_30
    [9] M. Kreuzer, A. D. Myasnikov, A. Ushakov, A linear algebra attack to group-ring-based key exchange protocols, In: Applied cryptography and network security, Cham: Springer, 2014, 37–43. https://doi.org/10.1007/978-3-319-07536-5_3
    [10] D. Kahrobaei, C. Koupparis, V. Shpilrain, A CCA secure cryptosystem using matrices over group rings, Contemporary Mathematics, 633 (2015), 73–81. http://doi.org/10.1090/conm/633/12652 doi: 10.1090/conm/633/12652
    [11] W. Diffie, M. Hellman, New directions in cryptography, IEEE T. Inform. Theory, 22 (1976), 644–654. http://doi.org/10.1109/TIT.1976.1055638 doi: 10.1109/TIT.1976.1055638
    [12] V. Shpilrain, Cryptanalysis of Stickel's key exchange scheme, In: Computer science–theory and applications, Berlin: Springer, 2008,283–288. http://doi.org/10.1007/978-3-540-79709-8_29
    [13] D. Grigoriev, V. Shpilrain, Tropical cryptography, Commun. Algebra, 42 (2014), 2624–2632. http://doi.org/10.1080/00927872.2013.766827 doi: 10.1080/00927872.2013.766827
    [14] Z. Izhakian, Basics of linear algebra over the extended tropical semiring, Contemporary Mathematics, 495 (2009), 173–191.
    [15] Z. Izhakian, L. Rowen, The tropical rank of a tropical matrix, Commun. Algebra, 37 (2009), 3912–3927. https://doi.org/10.1080/00927870902828793 doi: 10.1080/00927870902828793
    [16] D. Jones, Matrix roots in the max-plus algebra, Linear Algebra Appl., 631 (2021), 10–34. https://doi.org/10.1016/j.laa.2021.08.008 doi: 10.1016/j.laa.2021.08.008
    [17] M. Kotov, A. Ushakov, Analysis of a key exchange protocol based on tropical matrix algebra, J. Math. Cryptol., 12 (2018), 137–141. https://doi.org/10.1515/jmc-2016-0064 doi: 10.1515/jmc-2016-0064
    [18] D. Grigoriev, V. Shpilrain, Tropical cryptography Ⅱ: extensions by homomorphisms, Commun. Algebra, 47 (2019), 4224–4229. https://doi.org/10.1080/00927872.2019.1581213 doi: 10.1080/00927872.2019.1581213
    [19] D. Rudy, C. Monico, Remarks on a tropical key exchange system, J. Math. Cryptol., 15 (2021), 280–283. https://doi.org/10.1515/jmc-2019-0061 doi: 10.1515/jmc-2019-0061
    [20] S. Isaac, D. Kahrobaei, A closer look at the tropical cryptography, Int. J. Comput. Math., 6 (2021), 137–142. https://doi.org/10.1080/23799927.2020.1862303 doi: 10.1080/23799927.2020.1862303
    [21] H. Huang, C. Li, L. Deng, Public-key cryptography based on tropical circular matrices, Appl. Sci., 12 (2022), 7401. https://doi.org/10.3390/app12157401 doi: 10.3390/app12157401
    [22] F. Olia, S. Ghalandarzadeh, A. Amiraslani, S. Jamshidvand, Solving linear systems over tropical semirings through normalization method and its applications, J. Algebra Appl., 20 (2021), 2150159. https://doi.org/10.1142/S0219498821501590 doi: 10.1142/S0219498821501590
    [23] F. Mohammadi, M. Michałek, B. Sturmfels: "invitation to nonlinear algebra", Jahresber. Dtsch. Math. Ver., 124 (2022), 197–204. https://doi.org/10.1365/s13291-022-00252-w doi: 10.1365/s13291-022-00252-w
    [24] A. Muanalifah, S. Sergeev, Modifying the tropical version of stickel's key exchange protocol, Appl. Math., 65 (2020), 727–753. https://doi.org/10.21136/AM.2020.0325-19 doi: 10.21136/AM.2020.0325-19
    [25] S. Mehmood, Key exchange protocol based on matrices using tropical algebra, Master Thesis, Capital University of Science and Science and Technology, 2019.
    [26] M. I. Durcheva, Public key cryptography with max-plus matrices and polynomials, AIP Conference Proceedings, 1570 (2013), 491–498. http://doi.org/10.1063/1.4854794 doi: 10.1063/1.4854794
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1951) PDF downloads(66) Cited by(16)

Figures and Tables

Figures(2)  /  Tables(3)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog