#### Filter Results:

#### Publication Year

1989

2017

#### 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
- Appl. Algebra Eng. Commun. Comput.
- 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)

- 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, Karma Dajani
- 2006

Expansions that furnish increasingly good approximations to real numbers are usually related to dynamical systems. Although comparing dy-namical systems seems difficult in general, Lochs was able in 1964 to relate the relative speed of approximation of decimal and regular continued fraction expansions (almost everywhere) to the quotient of the entropies of… (More)

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

We describe an algorithm due to Gauss, Shanks and Lagarias that, given a non-square integer D 0; 1 mod 4 and the factorization of D, computes the structure of the 2-Sylow subgroup of the class group of the quadratic order of discriminant D in random polynomial time in log jDj.