## SEARCH

#### Institution

##### ( see all 671)

- Austrian Academy of Sciences 11 (%)
- Universidad de Cantabria 11 (%)
- Hubei University 10 (%)
- University of Waterloo 10 (%)
- Macquarie University 8 (%)

#### Author

##### ( see all 1176)

- Niederreiter, Harald 11 (%)
- Hu, Lei 8 (%)
- Shparlinski, Igor E. 7 (%)
- Cao, Yonglin 6 (%)
- Gulliver, T. Aaron 6 (%)

#### Subject

##### ( see all 6)

- Artificial Intelligence (incl. Robotics) 516 (%)
- Computer Hardware 516 (%)
- Computer Science 516 (%)
- Symbolic and Algebraic Manipulation 516 (%)
- Theory of Computation 516 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 720 matching Articles
Results per page:

## From Endicott House to Schloß Dagstuhl

### Applicable Algebra in Engineering, Communication and Computing (2000-05-01) 10: 277-278 , May 01, 2000

## On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve

### Applicable Algebra in Engineering, Communication and Computing (2013-11-01) 24: 343-354 , November 01, 2013

In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form $$y^q+y=x^m,\,q$$ being a prime power and $$m$$ a positive integer which divides $$q+1$$ . The dual minimum distance and minimum weight of such codes are studied from a geometric point of view. In many cases we completely describe the minimum-weight codewords of their dual codes through a geometric characterization of the supports, and provide their number. Finally, we apply our results to describe Goppa codes of classical interest on such curves.

## Foreword: computer algebra in coding theory and cryptography

### Applicable Algebra in Engineering, Communication and Computing (2013-08-01) 24: 157-158 , August 01, 2013

## On the Relation Between Gröbner and Pommaret Bases

### Applicable Algebra in Engineering, Communication and Computing (1998-07-01) 9: 117-123 , July 01, 1998

The reduced Pommaret basis and the reduced Gröbner basis of an ideal *I* with respect to a fixed admissible term order ≺ differ in general. A necessary and sufficient criterion for the coincidence of these bases is given.

## Some security bounds for the key sizes of DGHV scheme

### Applicable Algebra in Engineering, Communication and Computing (2014-11-01) 25: 383-392 , November 01, 2014

The correctness in decrypting a ciphertext after some operations in the DGVH scheme depends heavily on the dimension of the secret key. In this paper we compute two bounds on the size of the secret key for the DGHV scheme to decrypt correctly a ciphertext after a fixed number of additions and a fixed number of multiplication. Moreover we improve the original bound on the dimension of the secret key for a general circuit.

## Modular proofs for key exchange: rigorous optimizations in the Canetti–Krawczyk model

### Applicable Algebra in Engineering, Communication and Computing (2006-01-01) 16: 405-438 , January 01, 2006

Various optimizations in the Canetti–Krawczyk model for secure protocol design are proven to preserve security. In particular it is shown that multiple authenticators may be safely used together; that certain message components generated by authenticators may be reordered (to be sent at a different time) or replaced with other values with certain precautions; and that protocols may be defined in the ideal world with session identifiers constructed during protocol runs. Consequently protocol designers now have a set of clear rules to optimize and customize their designs without fear of breaking the security proof. In order to obtain the required proofs, we find it necessary to slightly revise the authenticated links part of the Canetti–Krawczyk model.

## On the computation of hilbert—Poincaré series

### Applicable Algebra in Engineering, Communication and Computing (1991-03-01) 2: 21-33 , March 01, 1991

We prove a theorem, which provides a formula for the computation of the Poincaré series of a monomial ideal in*k*[X_{1},⋯, X_{n}], via the computation of the Poincaré series of some monomial ideals in*k[X*_{1},⋯, X_{i},⋯, X_{n}]. The complexity of our algorithm is optimal for Borel-normed ideals and an implementation in CoCoA strongly confirms its efficiency. An easy extension computes the Poincaré series of graded modules over standard algebras.

## Hyperelliptic curves with reduced automorphism group A 5

### Applicable Algebra in Engineering, Communication and Computing (2007-02-01) 18: 3-20 , February 01, 2007

We study genus *g* hyperelliptic curves with reduced automorphism group *A*_{5} and give equations *y*^{2} = *f*(*x*) for such curves in both cases where *f*(*x*) is a decomposable polynomial in *x*^{2} or *x*^{5}. For any fixed genus the locus of such curves is a rational variety. We show that for every point in this locus the field of moduli is a field of definition. Moreover, there exists a rational model *y*^{2} = *F*(*x*) or *y*^{2} = *x**F*(*x*) of the curve over its field of moduli where *F*(*x*) can be chosen to be decomposable in *x*^{2} or *x*^{5}. While similar equations have been given in (Bujalance et al. in Mm. Soc. Math. Fr. No. 86, 2001) over
$${\mathbb R}$$
, this is the first time that these equations are given over the field of moduli of the curve.

## Evaluation of classes of definite integrals involving elementary functions via differentiation of special functions

### Applicable Algebra in Engineering, Communication and Computing (1990-09-01) 1: 149-165 , September 01, 1990

Herein, it is shown that by exploiting integral definitions of well known special functions, through generalizations and differentiations, broad classes of definite integrals can be solved in closed form or in terms of special functions. This is especially useful when there is no closed form solution to the indefinite form of the integral. In this paper, three such classes of definite integrals are presented. Two of these classes incorporate and supercede all of Kölbig's integration formulae [11], including his formulation for the computation of Cauchy principal values. Also presented are the mathematical derivations that support the implementation of a third class which exploits the incomplete Gamma function. The resulting programs, based on pattern matching, differentiation, and occasionally limits, are very efficient.

## Decomposition of ordinary differential polynomials

### Applicable Algebra in Engineering, Communication and Computing (2008-02-01) 19: 1-25 , February 01, 2008

In this paper, we present a complete algorithm to decompose nonlinear differential polynomials in one variable and with coefficients in a computable differential field
$${\mathcal K}$$
of characteristic zero. The algorithm provides an efficient reduction of the problem to the factorization of LODOs over the same coefficient field. Besides arithmetic operations, the algorithm needs decomposition of algebraic polynomials, factorization of multi-variable polynomials, and solution of algebraic linear equation systems. The algorithm is implemented in Maple for the *constant field* case. The program can be used to decompose differential polynomials with thousands of terms effectively.