#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1989

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

Magma is a new software system for computational algebra, the design of which is based on the twin concepts of algebraic structure and morphism. The design is intended to provide a mathematically rigorous environment for computing with algebraic structures (groups, rings, fields, modules and algebras), geometric structures (varieties, special curves) and… (More)

- 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, 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)

- 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, Michael E. Pohst
- ISSAC
- 1991

In computer algebra the use of normal forms for matrices is of eminent importance. Especially, Hermite and Smith normal form techniques are frequently used for various computational problems over Euclidean rings. In this paper we discuss a generalization of these concepts to Dedekind rings. We consider the problem of normal forms for matrices in the context… (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)

Abstract. 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… (More)

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

Several major improvements to the Jacobi sum primdity testing algorithm will speed it up in such a way that proving primality of primes of up to 500 digits will be a matter of routine. Primes of about 800 digits will take at most one night on a Cray. Primality Testing and Factoring Primality testing is one of two closely related classical problems in… (More)

Expansions that furnish increasingly good approximations to real numbers are usually related to dynamical systems. Although comparing dynamical 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)