In this paper we present an algorithm for counting points on elliptic curves over a finite field Fpn of small characteristic, based on Satoh’s algorithm. The memory requirement of our algorithm is O(n), where Satoh’s original algorithm needs O(n) memory. Furthermore, our version has the same run time complexity of O(n) bit operations, but is faster by a constant factor. We give a detailed descr...

We pose the problem of whether every FS-domain is a retract of abifinite domain purely in terms of quasi-uniform spaces. 6.1 The problem and its historyEver since domains were introduced by Dana Scott [Sco70] and Yuri Er-shov [Ers75], a question in the centre of interest was to find suitable cartesianclosed categories of domains and the quest for cartesian closed categories ...

Starting in the fall of 2005 our department began a large-scale effort to incorporate hands-on robotics in many of our courses, including our introductory computer science sequence. This followed the establishment of a departmental robotics laboratory and the purchase of a number of different robots. Our efforts include testing a variety of projects and surveying students about their satisfacti...

The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines bits from the shift register to create a key stream. The nonlinear combiner generator employs several (LFSRs) and a Boolean function that combines bit from all the registers to generate the key stream. A new attack on the filter generator has recently been described by Rønjom ...

The Feldman Report has stimulated extensive discussion about experimental computer science. J This report suggested that, without a large-scale rejuvenation of experimental computer science at universities, much basic research in computer science will cease. It suggested further that declining experimental research has produced declining innovation in computing. This discussion is even now caus...

Macromolecules, or in the most simple version chain molecules of a given length posed and still pose a significant challenge to theoretical physics and chemistry. The computational materials science emerging from this is a growing and exciting field of science. Despite remarkable progress over many years, which is well documented in many research papers and several reviews, only (few) rather si...

In this paper we discuss current issues in computer science and its application to Baduk. We present an overview of the current state of the art in a number of baduk-related domains and applications. Next, we present some suggestions for improvement. In particular we discuss Internet go, including the distribution of baduk information on the net and servers such as Dashn and KGS, training softw...

The security of the RSA cryptosystem depends on the difficulty of factoring large integers. The best current factoring algorithm is the Number Field Sieve (NFS), and its most difficult part is the sieving step. In 1999 a large distributed computation involving hundreds of workstations working for many months managed to factor a 512-bit RSA key, but 1024-bit keys were believed to be safe for the...

This paper examines the nature and scope of computer science education (CSE) research. We first distinguish CSE research from other forms of educational research, outlining its aims and identity as a research discipline. In examining the state of the art of CSE research, we attempt to categorise past research studies into general themes, reflecting the diverse contributions to CSE made over the...