From mjd@ece.orst.edu Fri Jun 4 15:37:53 1999 Return-Path: Received: from ECE.ORST.EDU by cipher.ece.orst.edu (NX5.67g/NX3.0S) id AA11074; Fri, 4 Jun 99 15:37:53 -0700 Received: (from mjd@localhost) by ECE.ORST.EDU (8.9.2/8.9.1) id PAA01947 for islmail-outgoing; Fri, 4 Jun 1999 15:34:35 -0700 (PDT) X-Authentication-Warning: ECE.ORST.EDU: mjd set sender to owner-islmail@ece.orst.edu using -f Received: from security.ece.orst.edu (security.ECE.ORST.EDU [128.193.48.206]) by ECE.ORST.EDU (8.9.2/8.9.1) with ESMTP id PAA01940 for ; Fri, 4 Jun 1999 15:34:33 -0700 (PDT) Received: from ece.orst.edu (crypto.ece.orst.edu [128.193.48.170]) by security.ece.orst.edu (8.9.1/8.9.1) with ESMTP id PAA19206 for ; Fri, 4 Jun 1999 15:34:59 -0700 (PDT) Message-Id: <3758548D.16AC3593@ece.orst.edu> Date: Fri, 04 Jun 1999 15:35:06 -0700 From: Cetin Kaya Koc Reply-To: koc@ece.orst.edu Organization: Oregon State University X-Mailer: Mozilla 4.51 (Macintosh; U; PPC) X-Accept-Language: en Mime-Version: 1.0 To: islmail@ece.orst.edu Subject: Fwd: course announcement Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-islmail@ece.orst.edu Precedence: bulk Status: RO X-Status: -------- Original Message -------- Subject: course announcement Date: Fri, 04 Jun 1999 15:23:26 -0700 From: Burt Fein To: koc@ece.orst.edu Cetin, I'd appreciate it if you could distribute the attached course announcement to any ECE students who might be interested. By the way, do you expect that there will any ECE students interested in taking our Mth 541/542 sequence, Computational and Applied Algebra next year? I taught it this past winter quarter and Mary Flahive is currently teaching it; there are several students from your lab in the course. We're wondering whether the course will attract enough outside interest to enable it to be offered every year; the alternative is to offer it on an every other year basis. Thanks, Burt Fein ------------------------------------------------------------------------ Course Announcement Mth 440/540: Computational Number Theory Fall 1999 MWF 1:00 - 1:50 Wngr 287 Instructor: Burt Fein This course will focus on two of the oldest questions in mathematics: how do you factor an integer into a product of primes, and how do you tell when an integer is a prime? There has been a resurgence of interest in these questions because of the advent of the RSA public key cryptosystem. This cryptosystem, which we will study, is used for the secure transmission of data. Its implementation requires large primes and its security seemingly depends on the difficulty of factoring large integers. There will be a computational component to the course for which we will use the Maple Computer Algebra system. No previous knowledge of either number theory or Maple will be assumed, however. Text: Factorization and Primality Testing by David Bressoud. For further information, contact me at: fein@math.orst.edu