In this paper, we investigate the Galois connections between two partially ordered objects in an arbitrary elementary topos. Some characterizations of Galois adjunctions which is similar to the classical case are obta...In this paper, we investigate the Galois connections between two partially ordered objects in an arbitrary elementary topos. Some characterizations of Galois adjunctions which is similar to the classical case are obtained by means of the diagram proof. This shows that the diagram method can be used to reconstruct the classical order theory in an arbitrary elementary topos.展开更多
In this article,we study deformations of conjugate self-dual Galois representations.The study is twofold.First,we prove an R=T type theorem for a conjugate self-dual Galois representation with coefficients in a finite...In this article,we study deformations of conjugate self-dual Galois representations.The study is twofold.First,we prove an R=T type theorem for a conjugate self-dual Galois representation with coefficients in a finite field,satisfying a certain property called rigid.Second,we study the rigidity property for the family of residue Galois representations attached to a symmetric power of an elliptic curve,as well as to a regular algebraic conjugate self-dual cuspidal representation.展开更多
The Liouville's integrability of the second order autonomous system is studied. It isproved that a second order polynomial system is Liouville integrable if and only if thereis an integral factor μ(x, y), such th...The Liouville's integrability of the second order autonomous system is studied. It isproved that a second order polynomial system is Liouville integrable if and only if thereis an integral factor μ(x, y), such that or a rational function in x and y.展开更多
The relationships between Koszulity and finite Galois coverings are obtained, which provide a construction of Koszul algebras by finite Galois coverings.
Abstract We investigate negacyclic codes over the Galois ring GR（2a,m） of length N = 2kn, where n is odd and k≥0. We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR（...Abstract We investigate negacyclic codes over the Galois ring GR（2a,m） of length N = 2kn, where n is odd and k≥0. We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR（2a, m）[u]/〈u2k ＋ 1〉. Then using a ring isomorphism we obtain the structure of negacyclic codes over GR（2a, m） of length N = 2kn （n odd） and explore the existence of self-dual negacyclic codes over GR（2a, m）. A bound for the homogeneous distance of such negacvclic codes is also given.展开更多
Trivium is an international standard of lightweight stream ciphers(ISO/IEC 29192-3:2012).In this paper,the Trivium-like NFSRs,a class of Galois NFSRs generalized from the Galois NFSR of Trivium,are studied from the pe...Trivium is an international standard of lightweight stream ciphers(ISO/IEC 29192-3:2012).In this paper,the Trivium-like NFSRs,a class of Galois NFSRs generalized from the Galois NFSR of Trivium,are studied from the perspective of Fibonacci NFSRs.It is shown that an n-stage Trivium-like NFSR cannot be equivalent to an n-stage Fibonacci NFSR,which is proved by showing the existence of“collision initial states”.As an intermediate conclusion,a necessary and sufficient condition for a kind of linear degeneracy of a Trivium-like NFSR is obtained from the persepective of interleaved sequences.Moreover,the smallest stage number of a Fibonacci NFSR that can generate all the output sequences of an n-stage Trivium-like NFSR is shown to be greater than n-7 and this value is no less than 371=287+min{93,84,111}specifically for the 288-stage Galois NFSR used in Trivium.These results contradict the existence of a equivalent Fibonacci model of Trivium NFSR of small stage,which implies that Trivium algorithm possesses a fair degree of immunity against“structure attack”.展开更多
Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4))...Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.展开更多
In this paper,we discuss the related properties of some particular derivations in semihoops and give some characterizations of them.Then,we prove that every Heyting algebra is isomorphic to the algebra of all multipli...In this paper,we discuss the related properties of some particular derivations in semihoops and give some characterizations of them.Then,we prove that every Heyting algebra is isomorphic to the algebra of all multiplicative derivations and show that every Boolean algebra is isomorphic to the algebra of all implicative derivations.Finally,we show that the sets of multiplicative and implicative derivations on bounded regular idempotent semihoops are in oneto-one correspondence.展开更多
Let X denote a complex analytic manifold, and let Aut(X) denote the space of invertible maps of a germ (X, a) to a germ (X, b); this space is obviously a groupoid; roughly speaking, a 'Lie groupoid' is a subgr...Let X denote a complex analytic manifold, and let Aut(X) denote the space of invertible maps of a germ (X, a) to a germ (X, b); this space is obviously a groupoid; roughly speaking, a 'Lie groupoid' is a subgroupoid of Aut(X) defined by a system of partial differential equations.To a foliation with singularities on X one attaches such a groupoid, e.g. the smallest one whose Lie algebra contains the vector fields tangent to the foliation. It is called 'the Galois groupoid of the foliation'. Some examples are considered, for instance foliations of codimension one, and foliations defined by linear differential equations; in this last case one recuperates the usual differential Galois group.展开更多
Several new series of approximately mutually unbiased bases are constructed by using Gauss sums and Jacobi sums over Galois rings GR(p2, r), and the tensor method.
The Morales-Ramis theory provides an effective and powerful non-integrability criterion for complex analytic Hamiltonian systems via the differential Galoisian obstruction.In this paper,we give a new Morales-Ramis typ...The Morales-Ramis theory provides an effective and powerful non-integrability criterion for complex analytic Hamiltonian systems via the differential Galoisian obstruction.In this paper,we give a new Morales-Ramis type theorem on the meromorphic Jacobi non-integrability of general analytic dynamical systems.The key point is to show that the existence of Jacobian multipliers of a nonlinear system implies the existence of common Jacobian multipliers of Lie algebra associated with the identity component.In addition,we apply our results to the polynomial integrability of Karabut systems for stationary gravity waves in finite depth.展开更多
In this paper, we discuss the 0, 1 distribution in the highest level sequence ae-1 of primitive sequence over Z2e generated by a primitive polynomial of degree n. First we get an estimate of the 0, 1 distribution by u...In this paper, we discuss the 0, 1 distribution in the highest level sequence ae-1 of primitive sequence over Z2e generated by a primitive polynomial of degree n. First we get an estimate of the 0, 1 distribution by using the estimates of exponential sums over Galois rings, which is tight for e relatively small to n. We also get an estimate which is suitable for e relatively large to n. Combining the two bounds, we obtain an estimate depending only on n, which shows that the larger n is, the closer to 1/2 the proportion of 1 will be.展开更多
Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube...Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.展开更多
In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Acces...In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Access (TSMA) is proposed. Further analysis is shownthat the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networkswith N mobile nodes. Moreover, the proposed multichannel TSMA can improve the average throughput Mtimes and decrease the average transmission slot delay M times, as compared with singlechannel TSMAwhen M channels are available.展开更多
The security of most code-based cryptosystems relies on the hardness of the syndrome decoding(SD) problem.The best solvers of the SD problem are known as information set,decoding(ISD) algorithms.Recently,Weger,et al.(...The security of most code-based cryptosystems relies on the hardness of the syndrome decoding(SD) problem.The best solvers of the SD problem are known as information set,decoding(ISD) algorithms.Recently,Weger,et al.(2020) described Stern’s ISD algorithm,s-blocks algorithm and partial Gaussian elimination algorithms in the Lee metric over an integer residue ring Z_(pm),where p is a prime number and m is a positive integer,and analyzed the time complexity.In this paper,the authors apply a binary ISD algorithm in the Hamming metric proposed by May,et al.(2011)to solve the SD problem over the Galois ring GR(p^(m),k) endowed with the Lee metric and provide a detailed complexity analysis.Compared with Stern’s algorithm over Zpmin the Lee metric,the proposed algorithm has a significant improvement in the time complexity.展开更多
Protecting the integrity and secrecy of digital data transmitted through the internet is a growing problem.In this paper,we introduce an asymmetric key algorithm for specifically processing images with larger bit valu...Protecting the integrity and secrecy of digital data transmitted through the internet is a growing problem.In this paper,we introduce an asymmetric key algorithm for specifically processing images with larger bit values.To overcome the separate flaws of elliptic curve cryptography(ECC)and the Hill cipher(HC),we present an approach to picture encryption by combining these two encryption approaches.In addition,to strengthen our scheme,the group laws are defined over the rational points of a given elliptic curve(EC)over a Galois field(GF).The exclusive-or(XOR)function is used instead of matrix multiplication to encrypt and decrypt the data which also refutes the need for the inverse of the key matrix.By integrating the inverse function on the pixels of the image,we have improved system security and have a wider key space.Furthermore,through comprehensive analysis of the proposed scheme with different available analyses and standard attacks,it is confirmed that our proposed scheme provides improved speed,security,and efficiency.展开更多
Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly...Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.展开更多
基金Supported by the National Natural Science Foundation of China (Grant No.10731050)
文摘In this paper, we investigate the Galois connections between two partially ordered objects in an arbitrary elementary topos. Some characterizations of Galois adjunctions which is similar to the classical case are obtained by means of the diagram proof. This shows that the diagram method can be used to reconstruct the classical order theory in an arbitrary elementary topos.
基金Y.L.supported by NSF(Grant No.DMS-1702019)and a Sloan Research FellowshipY.T.supported by NSFC(Grant No.12225112/12231001)+4 种基金CAS Project for Young Scientists in Basic Research(Grant No.YSBR-033)L.X.supported by NSF(Grant No.DMS-1502147/DMS-1752703)NSFC(Grant No.12071004)and the Chinese Ministry of EducationW.Z.supported by NSF(Grant No.DMS-1838118/DMS-1901642)X.Z.supported by NSF(Grant No.DMS-1902239)and a Simons Fellowship。
文摘In this article,we study deformations of conjugate self-dual Galois representations.The study is twofold.First,we prove an R=T type theorem for a conjugate self-dual Galois representation with coefficients in a finite field,satisfying a certain property called rigid.Second,we study the rigidity property for the family of residue Galois representations attached to a symmetric power of an elliptic curve,as well as to a regular algebraic conjugate self-dual cuspidal representation.
基金Project financed by the National Natural Science Foundation of China.
文摘The Liouville's integrability of the second order autonomous system is studied. It isproved that a second order polynomial system is Liouville integrable if and only if thereis an integral factor μ(x, y), such that or a rational function in x and y.
基金supported by National Natural Science Foundation of China (Grant No. 10731070)
文摘The relationships between Koszulity and finite Galois coverings are obtained, which provide a construction of Koszul algebras by finite Galois coverings.
基金supported by National Natural Science Foundation of China (Grant No. 60973125)College Doctoral Funds of China (Grant No. 20080359003)+1 种基金the Fundamental Research Funds for the Central Universities (Grant No. 2011HGXJ1079)the open research fund of National Mobile Communications Research Laboratory, Southeast University
文摘Abstract We investigate negacyclic codes over the Galois ring GR（2a,m） of length N = 2kn, where n is odd and k≥0. We first determine the structure of u-constacyclic codes of length n over the finite chain ring GR（2a, m）[u]/〈u2k ＋ 1〉. Then using a ring isomorphism we obtain the structure of negacyclic codes over GR（2a, m） of length N = 2kn （n odd） and explore the existence of self-dual negacyclic codes over GR（2a, m）. A bound for the homogeneous distance of such negacvclic codes is also given.
基金supported by the National Natural Science Foundation of China under Grant Nos.12371526,61872383,61802430,and 62202494。
文摘Trivium is an international standard of lightweight stream ciphers(ISO/IEC 29192-3:2012).In this paper,the Trivium-like NFSRs,a class of Galois NFSRs generalized from the Galois NFSR of Trivium,are studied from the perspective of Fibonacci NFSRs.It is shown that an n-stage Trivium-like NFSR cannot be equivalent to an n-stage Fibonacci NFSR,which is proved by showing the existence of“collision initial states”.As an intermediate conclusion,a necessary and sufficient condition for a kind of linear degeneracy of a Trivium-like NFSR is obtained from the persepective of interleaved sequences.Moreover,the smallest stage number of a Fibonacci NFSR that can generate all the output sequences of an n-stage Trivium-like NFSR is shown to be greater than n-7 and this value is no less than 371=287+min{93,84,111}specifically for the 288-stage Galois NFSR used in Trivium.These results contradict the existence of a equivalent Fibonacci model of Trivium NFSR of small stage,which implies that Trivium algorithm possesses a fair degree of immunity against“structure attack”.
文摘Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.
基金Supported by the National Natural Science Foundation of China(12271319).
文摘In this paper,we discuss the related properties of some particular derivations in semihoops and give some characterizations of them.Then,we prove that every Heyting algebra is isomorphic to the algebra of all multiplicative derivations and show that every Boolean algebra is isomorphic to the algebra of all implicative derivations.Finally,we show that the sets of multiplicative and implicative derivations on bounded regular idempotent semihoops are in oneto-one correspondence.
文摘Let X denote a complex analytic manifold, and let Aut(X) denote the space of invertible maps of a germ (X, a) to a germ (X, b); this space is obviously a groupoid; roughly speaking, a 'Lie groupoid' is a subgroupoid of Aut(X) defined by a system of partial differential equations.To a foliation with singularities on X one attaches such a groupoid, e.g. the smallest one whose Lie algebra contains the vector fields tangent to the foliation. It is called 'the Galois groupoid of the foliation'. Some examples are considered, for instance foliations of codimension one, and foliations defined by linear differential equations; in this last case one recuperates the usual differential Galois group.
基金supported by the Natural Science Foundation of China under Grant No.61370089the Tsinghua National Laboratory for Information Science and Technology+1 种基金by the Fundamental Research Funds for the Central Universities under Grant No.JZ2014HGBZ0349by Science and Technology on Information Assurance Lab.KJ-12-01
文摘Several new series of approximately mutually unbiased bases are constructed by using Gauss sums and Jacobi sums over Galois rings GR(p2, r), and the tensor method.
基金supported by National Natural Science Foundation of China(Grant No.11771177),National Natural Science Foundation of China(Grant Nos.12001386 and 12090013)Science and Technology Development Project of Jilin Province(Grant No.YDZJ202101ZYTS141)+1 种基金supported by Sichuan University Postdoctoral Interdisciplinary Innovation Fund(Grant No.0020104153010)the Fundamental Research Funds for the Central Universities(Grant No.20826041E4168)。
文摘The Morales-Ramis theory provides an effective and powerful non-integrability criterion for complex analytic Hamiltonian systems via the differential Galoisian obstruction.In this paper,we give a new Morales-Ramis type theorem on the meromorphic Jacobi non-integrability of general analytic dynamical systems.The key point is to show that the existence of Jacobian multipliers of a nonlinear system implies the existence of common Jacobian multipliers of Lie algebra associated with the identity component.In addition,we apply our results to the polynomial integrability of Karabut systems for stationary gravity waves in finite depth.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.19971096,90104035).
文摘In this paper, we discuss the 0, 1 distribution in the highest level sequence ae-1 of primitive sequence over Z2e generated by a primitive polynomial of degree n. First we get an estimate of the 0, 1 distribution by using the estimates of exponential sums over Galois rings, which is tight for e relatively small to n. We also get an estimate which is suitable for e relatively large to n. Combining the two bounds, we obtain an estimate depending only on n, which shows that the larger n is, the closer to 1/2 the proportion of 1 will be.
文摘Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.
基金This work is supported by"863"High Technology Development Project Fund (No.2003AA12331004).
文摘In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Access (TSMA) is proposed. Further analysis is shownthat the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networkswith N mobile nodes. Moreover, the proposed multichannel TSMA can improve the average throughput Mtimes and decrease the average transmission slot delay M times, as compared with singlechannel TSMAwhen M channels are available.
基金supported by the National Natural Science Foundation of China under Grant No. 61872355the National Key Research and Development Program of China under Grant No. 2018YFA0704703
文摘The security of most code-based cryptosystems relies on the hardness of the syndrome decoding(SD) problem.The best solvers of the SD problem are known as information set,decoding(ISD) algorithms.Recently,Weger,et al.(2020) described Stern’s ISD algorithm,s-blocks algorithm and partial Gaussian elimination algorithms in the Lee metric over an integer residue ring Z_(pm),where p is a prime number and m is a positive integer,and analyzed the time complexity.In this paper,the authors apply a binary ISD algorithm in the Hamming metric proposed by May,et al.(2011)to solve the SD problem over the Galois ring GR(p^(m),k) endowed with the Lee metric and provide a detailed complexity analysis.Compared with Stern’s algorithm over Zpmin the Lee metric,the proposed algorithm has a significant improvement in the time complexity.
基金the deanship of Scientific research at King Khalid University for funding this work through the research group’s program under Grant Number R.G.P.2/5/44.
文摘Protecting the integrity and secrecy of digital data transmitted through the internet is a growing problem.In this paper,we introduce an asymmetric key algorithm for specifically processing images with larger bit values.To overcome the separate flaws of elliptic curve cryptography(ECC)and the Hill cipher(HC),we present an approach to picture encryption by combining these two encryption approaches.In addition,to strengthen our scheme,the group laws are defined over the rational points of a given elliptic curve(EC)over a Galois field(GF).The exclusive-or(XOR)function is used instead of matrix multiplication to encrypt and decrypt the data which also refutes the need for the inverse of the key matrix.By integrating the inverse function on the pixels of the image,we have improved system security and have a wider key space.Furthermore,through comprehensive analysis of the proposed scheme with different available analyses and standard attacks,it is confirmed that our proposed scheme provides improved speed,security,and efficiency.
文摘Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.
