1. Introduction
The advent of quantum computers presents significant threats to classical cryptographic schemes, requiring the development of post-quantum cryptographic primitives that resist quantum attacks. In this regard, algebraic geometry (AG) codes have gained considerable attention due to their error-correcting capabilities and potential applications in secure communication and cryptographic protocols. Among various classes of AG codes, subfield subcodes stand out against structural attacks, making them good candidates for deployment in post-quantum cryptography.
Within linear codes over finite field extensions, the process of generating subfield subcodes, commonly referred to as restriction, entails converting a given linear code
C over a large field extension
into a code that is defined over a subfield
, where
m divides
n. This strategic approach restricts the codewords of
C to elements found within the smaller field
, effectively concealing the details about the structure inherent in
C. A classic example of this concept is the Reed–Solomon codes, which are algebraic geometry (AG) codes constructed over a projective line. They are widely used in practical applications, with their subfield subcodes represented by Goppa codes. In particular, in cryptography, especially within a McEliece cryptosystem, subfield subcodes play a crucial role in hiding the code structure, thus enhancing its resilience against distinguishing attacks [
1,
2]. The long-lasting security of the McEliece cryptosystem based on Goppa codes [
3] emphasizes its effectiveness in preventing such attacks. Despite subsequent proposals exploring Reed–Solomon codes [
4], AG codes, and their subcodes [
5], all have been susceptible to structural attacks. By imposing restrictions, cryptographic systems can enhance their security by minimizing the risk of potential attacks aimed at distinguishing the chosen subfield subcode. With growing interest in AG codes, particularly Hermitian codes, they are being evaluated as feasible alternatives to Reed–Solomon codes in specific applications [
6]. Hermitian codes have been extensively studied in prior research [
7,
8,
9,
10,
11,
12], particularly those associated with the point at infinity of the Hermitian curve. However, in [
13,
14], the authors introduced an alternative construction of Hermitian codes associated with higher-degree places on the Hermitian curve.
Our contribution involves conducting further research on Hermitian codes associated with degree-three places, deriving additional properties, and establishing explicit bases for the corresponding Riemann–Roch spaces; additionally, this should align with previous findings in [
13]. The stabilizer of a degree-three place has order
; the action of this group and the associated quotient curve has been studied by Cossidente, Korchmáros, and Torres [
15]. We make heavy use of their approach which relates the Hermitian curve with the curve projective curve
. Beelen, Montanucci, and Vicino [
16] studied another class of Hermitian quotient curves, which are obtained by automorphisms stabilizing a degree-three place of the Hermitian curve.
One-point Hermitians of degree-three places have improved minimum distances, as shown by the Matthews–Michel bound [
14], and have been further strengthened by Korchmáros and Nagy in [
13]. Moreover, we explore the properties of their subfield subcodes, with a particular focus on determining their true dimensions through explicit constructions. This investigation aims to provide a precise understanding of the codes’ capabilities for our future work. Since the family of subfield subcodes of Hermitian codes associated with degree-three places holds promise for the construction of an improved and secure McEliece cryptosystem, the aforementioned investigation will enable a comparison of these parameters with those of other existing codes (see [
12], Table 1), such as Goppa codes, to assess the potential improvement in the key size of the McEliece cryptosystem. This suggests that such a proposal could reduce the key size and meet the security level required by NIST [
17]. Using bounds on the dimensions offers only an estimate of the code’s performance, which means that this will not help us accurately decide whether these codes can achieve the required security level with an improved key size.
The paper is structured as follows. In
Section 2, we introduce the essential background of AG codes constructed from a Hermitian curve, including Hermitian curves, divisors, and the Riemann–Roch space. In
Section 3, we provide some facts on the geometry of degree 3 places of the Hermitian curve, and the unitary transformations which stabilize the given degree-three place. Our main tool is the Hermitian sesquilinear form
and the Frobenius map
.
Section 4 deals with their corresponding Riemann–Roch spaces. We explore their structure and give explicit and practical bases over
, and a decomposition into invariant subspaces over
(Theorem 3). In
Section 5, we study the functional and differential Hermitian codes of a degree 3 place, where we explicitly give the monomial equivalence between them (Theorem 4). In
Section 6, we give the main result on the dimensions of the subfield subcodes of degree 3 place Hermitian codes (Theorem 5). This result consists of a theorem that provides a lower bound on the dimensions of the underlying codes, while the conjecture suggests a possible equality based on numerical experiments.
The computational results were obtained using the
HERmitian package [
18] within the GAP [
19] computer algebra system. This involved implementing higher-degree places of Hermitian curves, their divisors and the associated Hermitian codes. This package employs a generic method for computing the bases of Riemann–Roch spaces, independent of the results presented in this paper. Specifically, we acquired computational evidence supporting Conjecture 1 without relying on the theoretical findings of this work.
2. Algebraic Geometry (AG) Codes
2.1. Hermitian Curves and Their Divisors
For more details, we refer the reader to [
15,
20,
21]. The Hermitian curve, denoted as
, over the finite field
in affine coordinates is given by the equation:
This curve has a genus
, classifying it as a maximal curve because it achieves the maximum number of
-rational points, which is
. Furthermore,
has a unique point at infinity, denoted
.
A divisor on is a formal sum , where are integers and are points on . The degree of the divisor D is defined as . The valuation of D at a point is , and the support of D is the set .
The Frobenius automorphism, denoted as
, is defined over the algebraic closure
and acts on elements as follows:
It acts on the points of by applying to their coordinates. A point Q on is -rational if and only if it is fixed by . Over , the points in correspond one-to-one to the places in the function field .
For a divisor
D, its Frobenius image is given by
and
D is
-rational if
. In particular, if all points
are in
, then
D is inherently
-rational.
2.2. Riemann–Roch Spaces
For a non-zero function g in the function field and a place P, stands for the order of g at P. If , then P is a zero of g, while if , then P is a pole of g with multiplicity . The principal divisor of a non-zero function g is .
The
Riemann–Roch space associated with an
-rational divisor
G is the
vector space
From ([
20], Riemann’s Theorem 1.4.17), we have
with equality if
.
In this work, our primary focus is on an -rational divisor G of the form , where P is a degree r place in and s is a positive integer. In the extended constant field of with degree r, let be the extensions of P. These points are degree-one places in , and, after appropriately labeling the indices, , where the indices are considered modulo r.
2.3. Hermitian Codes
Here, we outline the construction of an AG code from the Hermitian curve.
In algebraic coding theory, Hermitian codes stand out as a significant class of algebraic geometry (AG) codes, renowned for their distinctive properties. These codes are constructed from Hermitian curves defined over finite fields. These codes are typically viewed as functional AG codes, denoted by
. In this standard approach, the divisor
G is usually a multiple of a single place of degree one. The set
, which encompasses all the rational points in
, is listed as
. This approach gives rise to a structure known as a one-point code. However, it is important to note that recent research in the field suggests that the use of a more varied selection for the divisor
G can result in the creation of better AG codes [
13,
14].
Consider a divisor , where all are distinct rational points, and an -rational divisor G such that . By numbering the places in the support of D, we define an evaluation map such that for .
The functional AG code associated with the divisor
G is
Theorem 1 ([
20], Theorem 2.2.2)
. is an code with parameters The dual of an AG code can be described as a residue code (see [
20] for more details), i.e.,
Furthermore, the differential code
is monomially equivalent to the functional code
where
W represents a canonical divisor of
. The notion of monomial equivalence of codes is defined as follows. Let
be linear subspaces and
with non-zero entries. We define the Schur product
The vector is also called a multiplier. Clearly, . Two linear codes are monomially equivalent if for some multiplier . Monomially equivalent codes share identical dimensions and minimum distances; however, this correspondence does not preserve all crucial properties of the code.
2.4. Subfield Subcodes and Trace Codes
For the efficient construction of codes over , one approach involves working with codes originally defined over an extension field . When considering a code within , a subfield subcode of is its restriction to the field . This process, often employed in the definition of codes such as BCH codes, Goppa codes, and alternant codes, plays a fundamental role.
Let
q be a prime power and
m be a positive integer. Let
C denote a linear code of parameters
defined over the finite field
. The
subfield subcode of
C over
, represented as
, is the set
which consists of all codewords in
C that have their components in
.
The subfield subcode is a linear code over with parameters , satisfying the inequalities and . Moreover, a parity check matrix for C over provides up to linearly independent parity check equations over for the subfield subcode . Typically, the minimum distance of the subfield subcode exceeds that of the original code C.
Let
denote the trace function from
down to
, expressed as
For any vector
, we define
Furthermore, for a linear code
C of length
n and dimension
k over
, the code
is a linear code of length
n and dimension
over
.
A seminal result by Delsarte connects subfield subcodes with trace codes:
Theorem 2 ([
22])
. Let C be an linear code over . Then, the dual of the subfield subcode of C is the trace code of the dual code of C, i.e., Finding the exact dimension of a subfield subcode of a linear code is typically a hard problem. However, a basic estimation can be obtained by applying Delsarte’s theorem [
22]:
In [
20] (Chapter 9), various results are discussed with respect to the subfield subcodes and trace codes of AG codes. This motivated us to formulate the following propositions on the dimension of the subfield subcodes of AG codes, which are useful for the case
with a place
P of higher degree.
Proposition 1. Let be a positive divisor of the Hermitian curve and be the sum of -rational places such that . Assume that . Then, Proof. Let
f be a function in
such that
for
. Then,
(since
), and hence
, where
Since , it follows that and , which implies that . Consequently, . □
3. The Geometry of Hermitian Degree-Three Places
In this section, we collect useful facts on degree-three places of the Hermitian curve, their stabilizer subgroups, and Riemann–Roch spaces.
3.1. The Hermitian Sesquilinear Form
The Hermitian curve has the affine equation . The Hermitian function field is generated by so that holds. The Frobenius field automorphism of the algebraic closure includes an action on rational functions, places, divisors, and curve automorphisms. For this action, we continue to use the notation in the exponent: , , , etc.
Let
K be a field extension of
. An affine point is a pair
. A projective point
is a one-dimensional subspace
of
. If
, then the projective point
is identified with the affine point
. For
, we define the Hermitian form
Clearly,
is additive in
u and
v,
, and
The point
u is self-conjugate if
This is the projective equation of the Hermitian curve .
Let
be a projective point. The polar line of
u has equation
If
u is on
, then
is the tangent line at
u. More precisely,
intersects
at
u and
with multiplicities
q and 1, respectively. If
u is
-rational, then
, and the intersection multiplicity is
.
3.2. Unitary Transformations and Curve Automorphism
Let
A be a
matrix. The linear map
will also be denoted by
A. If
A is invertible, then it induces a projective linear transformation, denoted by
, where
We use the same notation
for the partial affine map:
The action of on rational functions will be indicated by . The following lemma is straightforward.
Lemma 1. Let be a polynomial of total degree n. Define the degree n homogeneous polynomial . Then, We remark that the line can be seen as the pre-image of the line at infinity under .
The linear transformation
A is unitary if
holds for all
. Since
is non-degenerate, unitary transformations are invertible. Moreover, for all
, one has
This implies
for all
v, that is,
A and
commute. This shows that unitary transformations are defined over
. They form a group which is denoted by
. A useful fact is that if
is a basis and
for all
, then
A is unitary.
Let
. If
is a generic point of
, then
satisfies
Therefore,
is a generic point of
, and
induces an automorphism of the function field
. If
A is defined over
, then
is an automorphism of
.
3.3. Places of Degree Three and Their Lines
Let
be scalars such that
. In other words,
is an affine point of
, defined over
. Write
,
,
,
, and
. Then,
,
, and
hold for
, with the indices taking modulo three. Since
is non-trivial,
. More precisely,
which shows
. Clearly,
and
. By
, the vectors
are linearly independent over
.
Let
K be a field containing
. Since
is a basis in
, any
can be written as
with
. Computing
we obtain
. In the basis
, the Hermitian form has the shape
In this coordinate frame, the Hermitian curve has projective equation
Let
be the generators of the function field
such that
. Write
The Hermitian curve
is non-singular, the places of
correspond to the projective points over the algebraic closure
. Let
denote the place corresponding to
.
is defined over
,
, and
is an
-rational place of degree three.
The line
is tangent to
at
; the intersection multiplicities are
q and 1 at
and
, respectively. This implies that the zero divisor
is
, and the principal divisor of
is
3.4. The Stabilizer of a Degree-Three Place
Let
be an element such that
. Define
,
. Then,
For
, this implies that
Hence, for all
,
This shows that we can extend the map
to a unitary linear map
in the following way. Write
with
, and define
The extension
B is a unique unitary transformation. As we have seen in
Section 3.2, this implies that
is a well-defined element of the general unitary group
. The set
is a cyclic subgroup of
, whose order is
.
In the projective plane, B induces a projective linear transformation . is trivial if and only if , that is, if and only if . As , is trivial if and only if . The set is a cyclic group of unitary projective linear transformations, whose order is .
In a similar way, we fix the elements
since
,
. Moreover,
As before, the map
preserves the Hermitian form:
Hence,
extends to a unitary linear map, which commutes with
and normalizes
. Indeed,
and hence,
.
maps
to
, and
Therefore, has order 3.
As introduced in
Section 3.2, the unitary transformations
B and
induce automorphisms
and
of the function field.
Proposition 2. The group of curve automorphisms has order , and normalizes by Both and stabilize the degree-three place P.
Proposition 3. Let be an element such that . Define , , and the unitary map . Then, Proof. By Lemma 1,
where the linear
over
depends only on
B. Therefore,
□
5. Hermitian Codes of Degree-Three Places and Their Duals
In this section, we explore the one-point Hermitian codes of degree-three places and their dual codes. Let P be a degree-three place on the Hermitian curve ; are its -rational places, where . We define the divisors , , and for a positive integer s.
5.1. Functional Hermitian Codes of Degree-Three Places
Given a divisor
D and
G, we define the degree-three place functional Hermitian code
as:
This code forms an AG code, where , achieving equality when . Furthermore, the code has a minimum distance , where is the designed minimum distance.
Furthermore, another degree-three place functional Hermitian code associated with
G, denoted by
, is constructed by evaluating the functions in
at all rational points
and the point at infinity
as follows:
Clearly, has a length of . Concerning the dimensions, we have the following result.
Proposition 6. If , then , and have the same dimensions.
Proof. If , then , which is trivial if . In this case, is also trivial. □
Remark 1. Numerical experiments show that , and have the same dimension if .
In the study of the divisors
D and
, we make use of the polynomial
As shown in [
13] (Section 2), the principal divisor of
is
Further properties of are given in the following proposition.
Proposition 7. In the function field, we have The differential of is Proof. Hence, by
,
Using this, we obtain
Canceling by
, we get
, and
follows immediately. □
5.2. Differential Hermitian Codes of Degree-Three Places
Differential Hermitian codes of degree-three places are essential counterparts to functional codes on the Hermitian curve . The dual code of is called the differential code. It constitutes an code, where , with being its designed distance.
Ref. [
20] (Proposition 8.1.2) provides an explicit description of the differential code as a functional code
where
t is an element of
such that
for all
. If
and
, then
is a good choice, with
see [
20] (Lemma 6.4.4). Then, (
8) implies the following proposition:
The computation of is more complicated. We claim the next results for the prime powers , since the proofs are rather transparent in this case. We are certain that they hold for as well. Our opinion is supported by numerical experiments with .
Lemma 5. Assume and define the -rational function Proof. We have
, and
□
Lemma 6. Assume and define the -rational functions Let G be a divisor of whose support is disjoint from the support of . Then, Proof. For Riemann–Roch spaces, the results follow. □
Lemma 7. For any , we have Proof. We use the local expansion
of
at
. The dots represent terms of a higher degree.
which implies
□
Lemma 8. Assume and define the -rational functions Then, .
Proof. Since
is the product of terms such as
, it takes the value of 1 at
. This implies
. □
Before stating our main result on differential codes, we remind the reader that two linear codes are monomially equivalent if for some multiplier vector .
Theorem 4. Assume and define the -rational functions Let G be a divisor of , whose support is disjoint from the support of . Define for and write . Then, all entries , and Proof. If , then . Therefore, and is a well-defined non-zero element in . Lemma 8 implies . The theorem follows from Lemma 6. □
6. Hermitian Subfield Subcodes from Degree-Three Places
In this section, we study the subfield subcodes of . As before, q is a prime power, integer, and P is a place of degree three of the Hermitian curve . The divisor , , is defined as the sum of the -rational affine places of . The rational place at infinity is and .
6.1. Trace Maps of Hermitian Functions and Hermitian Codes
We collect properties of the maps and , where z is either a field element, a function, or a vector. We refer to as the trace of z, and to the map itself as the trace map . Clearly, Tr is linear over .
Lemma 9. Consider a positive divisor . The trace map satisfies the following properties:
- (i)
For any function , its trace lies within , implying .
- (ii)
Similarly, for any codeword , its trace resides in .
- (iii)
is an -linear subspace of .
Proof. Since , we have ; hence, (i) holds. Then, (i) implies (ii), and (iii) follows trivially. □
Proposition 9. Let be a positive divisor that satisfies . Then, is an -linear subfield subcode of . Its dimension is Proof. is an
-linear subfield subcode by Lemma 9. The trace map Tr and the evaluation map
commute, and by
,
is injective. Define the
-linear map
We have to show that
. Define
such that
if
q is even and
if
q is odd and
g is a primitive element in
. Then,
. For the rational function
, we have
This finishes the proof. □
6.2. An Explicit Subfield Subcode
In this subsection, we study a subfield subcode of
. As
, one has
The vector space
consists of the functions
For rational functions
, we introduce the relation
This is clearly an equivalence relation, which can be also written in terms of the principal divisor
or in terms of the evaluation map
Lemma 10. - (i)
.
- (ii)
.
Proof. Lemma 7 implies
. In the proof of Lemma 5, we have seen that
. Therefore,
for all
. This shows
This proves (i). For (ii):
□
Proposition 10. The setis a three-dimensional -linear subfield subcode of . Proof. Lemma 10(ii) implies that has -entries if and only if . □
6.3. Main Result and a Conjecture
Theorem 5. Let be a prime power, , be the sum of rational affine places of , and P be a place of degree three. The dimension of the subfield subcode of the one-point Hermitian code is Proof. Set
. By Proposition 9,
is an
-linear subspace in
. Since
,
has dimension seven. This proves
.
Let
be the three-dimensional
-linear subfield subcode of
given in Proposition 10. We show that
; the inequality
will follow. On the one hand,
On the other hand, using Theorem 3, we have
As
is injective on
, and
we obtain
. This completes the proof. □
Our proof was constructive, we used the subfield subcodes given explicitly in the previous subsections. Based on computer calculations for small q, we have the following conjecture.
Conjecture 1. If , then equalities hold in Theorem 5.
The claim of the conjecture has some equivalent formulations.
Proposition 11. The following are equivalent.
- (i)
.
- (ii)
.
- (iii)
for all .
Proof. We use the notation of the proof of Theorem 5. Assume (i). We have
. Moreover,
is an
-module that decomposes into the direct sum of a one-dimensional submodule and a six-dimensional submodule. Note that any non-trivial irreducible
-module has dimension six. Since
is a proper submodule, the only possibility is that it is one-dimensional over
. (ii) follows. Trivially, (ii) implies (iii). Let us now assume (iii).
and therefore,
This implies . Together with Theorem 5, we have (i). □
We have a partial result related to case (iii) of Proposition 11.
Proposition 12. for all .
Proof. Fix an arbitrary integer s in the range and consider a generic element . This corresponds to a function g in such that is an element of for each . We note that there exists a such that at least of the values is equal to . In other words, the function is in and has at least zeros on . However, a non-zero function in cannot have more than zeros, leading us to conclude that must be the zero function. This implies that every is equal to , and hence consists of constant vectors. This completes the proof. □