Results 31 to 40 of about 242 (42)
A Generic Approach to Searching for Jacobians
, 2007 We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing a large ...
Sutherland, Andrew V.
core +3 more sources
A note on cohomology and algebraic geometric codes on the curves over rings
Annals of the West University of Timisoara: Mathematics and Computer ScienceLet A be a local Artinian ring with residue field k(A). Let X be a curve over A and let be X′ = X ×spec A spec k(A) the fiber of X over k(A). Consider ℒ an invertible sheaf on X and ℒ ′ = ϕ*ℒ ∈ Pic(X′), where ϕ : X′ → X is the natural map.
Nyamda Francis, Mouaha Christophe
doaj +1 more source
, 2012 We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with ...
Lopez, Hiram H. +2 more
core +1 more source
Vanishing Ideals Over Odd Cycles
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 Let K be a finite field. Let X* be a subset of the a ne space Kn, which is parameterized by odd cycles. In this paper we give an explicit Gröbner basis for the vanishing ideal, I(X*), of X*.
Uribe-Paczka M. Eduardo +2 more
doaj +1 more source
Algebraic properties of generalized Rijndael-like ciphers [PDF]
, 2012 We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition.
B. Scott +5 more
core
The Rabin cryptosystem revisited [PDF]
, 2013 The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes.
Elia, Michele +2 more
core
, 2015 This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible (possibly singular
Haloui, Safia
core
Affine Cartesian codes with complementary duals
, 2018 A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD.
López, Hiram H. +2 more
core
Linear Codes from Two Weakly Regular Plateaued Balanced Functions. [PDF]
Entropy (Basel), 2023 Yang S, Zhang T, Li P.
europepmc +1 more source
Orienteering with One Endomorphism. [PDF]
Mathematica (N Y), 2023 Arpin S +5 more
europepmc +1 more source