Author image not provided
 JöRg M Thuswaldner

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.00
Citation Count15
Publication count5
Publication years2003-2010
Available for download1
Average downloads per article967.00
Downloads (cumulative)967
Downloads (12 Months)11
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
Sort by:

1
May 2010 Finite Fields and Their Applications: Volume 16 Issue 3, May, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Let F"q be a finite field with q elements and [email protected]?F"q[X,Y]. In this paper we study properties of additive functions with respect to number systems which are defined in the ring F"q[X,Y]/pF"q[X,Y]. Our results comprise distribution results, exponential sum estimations as well as a version of Waring's Problem restricted by ...
Keywords: Digit expansions, Finite fields, Waring's Problem, Weyl sums, 11A63, 11T23, Distribution in residue classes

2
November 2008 Finite Fields and Their Applications: Volume 14 Issue 4, November, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

Let F"q be a finite field and consider the polynomial ring F"q[X]. Let [email protected]?F"q[X]. A function f:F"q[X]->G, where G is a group, is called strongly Q-additive, if f(AQ+B)=f(A)+f(B) holds for all polynomials A,[email protected]?F"q[X] with degB
Keywords: Weyl sums, Uniform distribution, Waring's problem, Digit expansions, Finite fields

3 published by ACM
July 2005 ACM Transactions on Algorithms (TALG): Volume 1 Issue 1, July 2005
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 967

Full text available: PDFPDF
Several cryptosystems rely on fast calculations of linear combinations in groups. One way to achieve this is to use joint signed binary digit expansions of small “weight.” We study two algorithms, one based on nonadjacent forms of the coefficients of the linear combination, the other based on a certain joint ...
Keywords: cryptosystems, digital expansions, online algorithm, Hamming weight, elliptic curve

4
December 2004 Journal of Symbolic Computation: Volume 38 Issue 6, December, 2004
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

Let k=Q(-D) be an imaginary quadratic number field with ring of integers Z"k and let k(@a) be the cubic extension of k generated by the polynomial f"t(x)=x^3-(t-1)x^2-(t+2)x-1 with [email protected]?Z"k. In the present paper we characterize all elements @[email protected]?Z"k[@a] with norms satisfying |N"k"("@a")"/"k|@?|2t+1| for |t|>=14. This generalizes a corresponding result by ...
Keywords: 11R16, Small norm, Shanks' extension

5
July 2003 Finite Fields and Their Applications: Volume 9 Issue 3, July, 2003
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

In the present paper we define a new kind of digit system in polynomial rings over finite fields. Let F be a finite field and p(x,y)[email protected]?b"j(x)y^[email protected]?F[x,y] be a polynomial in two indeterminates. Furthermore, let N={[email protected]?F[x]:degp(x)
Keywords: Canonical number system, Digit system



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us