Cyclic codes over $${{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}$$

In this work, we focus on cyclic codes over the ring \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} , which is not a finite chain ring. We use ideas from group rings and works of AbuAlrub et.al. in (Des Codes Crypt 42:273–287, 2007) to characterize the ring (\mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂)/(xⁿ-1){({{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2})/(x^n-1)} and cyclic codes of odd length. Some good binary codes are obtained as the images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} under two Gray maps that are defined. We also characterize the binary images of cyclic codes over \mathbbF₂+u\mathbbF₂+v\mathbbF₂+uv\mathbbF₂{{{\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2}} in general.     

Logarithmic girth expander graphs of $$SL_n({mathbb {F}}_p)$$

Journal of Algebraic Combinatorics - We provide an explicit construction of finite 4-regular graphs $$(Gamma _k)_{kin {mathbb {N}}}$$ with $$text {girth}, Gamma _krightarrow infty $$ as...     

On self-dual codes over {\mathbb{F}}_5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over for lengths [22, 26, 28, 32–40]. In particular, we prove that there is no [22, 11, 9] self-dual code over , whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over are unique. Using the building-up construction, we show that there are exactly nine inequivalent optimal self-dual [18, 9, 7] codes over up to the monomial equivalence, and construct one new optimal self-dual [20, 10, 8] code over and at least 40 new inequivalent optimal self-dual [22, 11, 8] codes.      

Regular complete permutation polynomials over $${\mathbb {F}}_{2^{n}}$$ F 2 n

Designs, Codes and Cryptography - Applications of permutation polynomials in cryptography are closely related to their cycle structures. For example, many block ciphers use permutation polynomials...     

Fast algorithms for computing isogenies between elliptic curves

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ( different from the characteristic) in time quasi-linear with respect to . This is based in particular on fast algorithms for power series expansion of the Weierstrass -function and related functions.

     

On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of $$\mathbb {F}_{\varvec{q}} $$

In this paper we study the difference between the 2-adic valuations of the cardinalities \( \# E( \mathbb {F}_{q^k} ) \) and \( \# E( \mathbb {F}_q ) \) of an elliptic curve E over \( \mathbb {F}_q \). We also deduce information about the structure of the 2-Sylow subgroup \( E[ 2^\infty ]( \mathbb {F}_{q^k} ) \) from the exponents of \( E[ 2^\infty ]( \mathbb {F}_q ) \).     

Elliptic near-MDS codes over $${\mathbb{F}}_5$$

Let Γ₆ be the elliptic curve of degree 6 in PG(5, q) arising from a non-singular cubic curve of PG(2, q) via the canonical Veronese embedding

Nef line bundles on flag bundles on a curve over {\overline{{\mathbb F}}_p}

Let E be a vector bundle of rank r over an irreducible smooth projective curve X defined over the field ${\overline{{\mathbb F}}_p}$ F ¯ p . For fixed integers ${r_1\, , \ldots\, , r_\nu}$ r 1 , ... , r ν with ${1\, \leq\, r_1\, <\, \cdots\, <\, r_\nu\, <\, r}$ 1 ≤ r 1 < ? < r ν < r , let ${\text{Fl}(E)}$ Fl ( E ) be the corresponding flag bundle over X associated to E. Let ${\xi\, \longrightarrow \, {\rm Fl}(E)}$ ξ ? Fl ( E ) be a line bundle such that for every pair of the form ${(C\, ,\phi)}$ ( C , ? ) , where C is an irreducible smooth projective curve defined over ${\overline{\mathbb F}_p}$ F ¯ p and ${\phi\, :\, C\, \longrightarrow\, {\rm Fl}(E)}$ ? : C ? Fl ( E ) is a nonconstant morphism, the inequality ${{\rm degree}(\phi^* \xi)\, > \, 0}$ degree ( ? ? ξ ) > 0 holds. We prove that the line bundle ${\xi}$ ξ is ample.     

On isogeny graphs of supersingular elliptic curves over finite fields

We study the isogeny graphs of supersingular elliptic curves over finite fields, with an emphasis on the vertices corresponding to elliptic curves of j-invariant 0 and 1728.     

Computing isogenies between elliptic curves over using Couveignes's algorithm

The heart of the improvements by Elkies to Schoof's algorithm for computing the cardinality of elliptic curves over a finite field is the ability to compute isogenies between curves. Elkies' approach is well suited for the case where the characteristic of the field is large. Couveignes showed how to compute isogenies in small characteristic. The aim of this paper is to describe the first successful implementation of Couveignes's algorithm. In particular, we describe the use of fast algorithms for performing incremental operations on series. We also insist on the particular case of the characteristic 2.

     

Selmer groups over {\mathbb {Z}}_p^d-extensions

Consider an abelian variety \(A\) defined over a global field \(K\) and let \(L/K\) be a \({\mathbb {Z}}_p^d\) -extension, unramified outside a finite set of places of \(K\) , with \({{\mathrm{Gal}}}(L/K)=\Gamma \) . Let \(\Lambda (\Gamma ):={\mathbb {Z}}_p[[\Gamma ]]\) denote the Iwasawa algebra. In this paper, we study how the characteristic ideal of the \(\Lambda (\Gamma )\) -module \(X_L\) , the dual \(p\) -primary Selmer group, varies when \(L/K\) is replaced by a strict intermediate \({\mathbb {Z}}_p^e\) -extension.     

On oriented supersingular elliptic curves

We revisit theoretical background on OSIDH (Oriented Supersingular Isogeny Diffie-Hellman protocol), which is an isogeny-based key-exchange protocol proposed by Colò and Kohel at NutMiC 2019. We give a proof of a fundamental theorem for OSIDH. The theorem was stated by Colò and Kohel without proof. Furthermore, we consider parameters of OSIDH, give a sufficient condition on the parameters for the protocol to work, and estimate the size of the parameters for a certain security level.     

On the k-error linear complexity over \mathbb{F}_p of Legendre and Sidelnikov sequences

We determine exact values for the k-error linear complexity L _k over the finite field of the Legendre sequence of period p and the Sidelnikov sequence of period p ^m  − 1. The results are