#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1989

2017

- This year (4)
- Last 5 years (6)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Wieb Bosma, John J. Cannon, Catherine Playoust
- J. Symb. Comput.
- 1997

In the first of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets.

- Wieb Bosma, James Hutton, Eric R. Verheul
- ASIACRYPT
- 2002

XTR is a general method that can be applied to discrete logarithm based cryptosystems in extension fields of degree six, providing a compact representation of the elements involved. In this paper we present a precise formulation of the Brouwer-Pellikaan-Verheul conjecture, originally posed in [4], concerning the size of XTR-like representations of elements… (More)

- Wieb Bosma, John J. Cannon, Allan K. Steel
- J. Symb. Comput.
- 1997

The design of a computational facility for finite fields that allows complete freedom in the manner in which fields are constructed, is complicated by the fact that a field of fixed isomorphism type K may be constructed in many different ways. It is desirable that the user be able to perform simultaneous computations in different versions of K in such a way… (More)

- Wieb Bosma
- Applicable Algebra in Engineering, Communication…
- 1990

It is shown how the use of a certain integral basis for cyclotomic fields enables one to perform the basic operations in their ring of integers efficiently. In particular, from the representation with respect to this basis, one obtains immediately the smallest possible cyclotomic field in which a given sum of roots of unity lies. This is of particular… (More)

The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant λ when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the divisors of n less than n. Thus the geometric mean of s(n)/n, the growth factor of the function s, in the long run tends to… (More)

- Daniel Bleichenbacher, Wieb Bosma, Arjen K. Lenstra
- CRYPTO
- 1995

We review the well-known relation between Lucas sequences and exponentiation. This leads to the observation that certain public-key cryptosystems that are based on the use of Lucas sequences have some elementary properties their re-inventors were apparently not aware of. In particular, we present a chosen-message forgery for 'LUC' (cf. [21; 25]), and we… (More)

- Wieb Bosma, John J. Cannon, Graham Matthews
- ISSAC
- 1994

MAGMA is a new software system for computational algebra, number theory and geometry whose design is centred on the concept of algebraic structure (magma). The use of algebraic structure as a design paradigm provides a natural strong typing mechanism. Further, structures and their morphisms appear in the language as first class objects. Standard… (More)

- Wieb Bosma, Marc-Paul van der Hulst
- EUROCRYPT
- 1989

- Wieb Bosma, Michael E. Pohst
- ISSAC
- 1991

- Wieb Bosma, Bart de Smit
- ANTS
- 2002

For each integer n, let Sn be the set of all class number quotients h(K)/h(K) for number fields K and K of degree n with the same zeta-function. In this note we will give some explicit results on the finite sets Sn, for small n. For example, for every x ∈ Sn with n ≤ 15, x or x −1 is an integer that is a prime power dividing 2 14 · 3 6 · 5 3 .