Advances in Mathematics of Communications
Open Access Articles
Number theoretic public-key solutions, currently used in many applications worldwide, will be subject to various quantum attacks, making them less attractive for longer-term use. Certain group theoretic constructs are now showing promise in providing quantum-resistant cryptographic primitives, and may provide suitable alternatives for those looking to address known quantum attacks. In this paper, we introduce a new protocol called a Meta Key Agreement and Authentication Protocol (MKAAP) that has some characteristics of a public-key solution and some of a shared-key solution. Specifically, it has the deployment benefits of a public-key system, allowing two entities that have never met before to authenticate without requiring real-time access to a third-party, but does require secure provisioning of key material from a trusted key distribution system (similar to a symmetric system) prior to deployment. We then describe a specific MKAAP instance, the Ironwood MKAAP, discuss its security, and show how it resists certain quantum attacks such as Shor's algorithm or Grover's quantum search algorithm. We also show Ironwood implemented on several "internet of things" (IoT devices), measure its performance, and show how it performs significantly better than ECC using fewer device resources.
We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its shortened expanded code over the base field. Considering shortened expanded codes provides a safeguard against distinguisher attacks based on the Schur product. Moreover, without using a cyclic or a quasi-cyclic structure we obtain a key size reduction of nearly
We investigate a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. These codes have at most three weights and some of them are almost optimal so that they are suitable for applications in secret sharing schemes. This is a supplement of the results raised by Wang et al. (2017) and Kong et al. (2019).
This paper is concerned with the construction of algebraic-geometric (AG) codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with some rational places, which enables us to study multi-point AG codes. Along this line, we characterize explicitly the Weierstrass semigroups and pure gaps by an exhaustive computation for the basis of Riemann-Roch spaces from GGS curves. In addition, we determine the floor of a certain type of divisor and investigate the properties of AG codes. Multi-point codes with excellent parameters are found, among which, a presented code with parameters
In this paper, a novel method for constructing complementary sequence set with zero correlation zone (ZCZ) is presented by interleaving and combining three orthogonal matrices. The constructed set can be divided into multiple sequence groups and each sequence group can be further divided into multiple sequence subgroups. In addition to ZCZ properties of sequences from the same sequence subgroup, sequences from different sequence groups are orthogonal to each other while sequences from different sequence subgroups within the same sequence group possess ideal cross-correlation properties, that is, the proposed ZCZ sequence set has inter-group orthogonal (IGO) and inter-subgroup complementary (ISC) properties. Compared with previous methods, the new construction can provide flexible choice for ZCZ width and set size, and the resultant sequences which are called IGO-ISC sequences in this paper can achieve the theoretical bound on the set size for the ZCZ width and sequence length.
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]