Fall 2001

Elliptic Curves in Practice & an Introduction to Dual-Field Arithmetic

Erkay Savas, rTrust Technologies, Corvallis, OR
Monday, December 17, 2001; 11:00 am; Room: 218, Atwater Kent, WPI

Abstract

Since we will need security on every piece of digital equipment that helps conduct transactions over the internet in the near future, space and time performance of Cryptographic algorithms will always reMain among the most critical aspects of implementing Cryptographic functions. An important category of public-key algorithms is that of elliptic curve Cryptosystems (ECC). As many other public-key Cryptosystems ECC is also based on an intractable problem and requires computationally intensive operations. Although the speed reMains to be always the primary concern, other design constraints such as memory might be of significant importance for certain constrained platforms.

One of the major advantages of elliptic curve Cryptosystems is that they utilize much shorter key lengths in comparison to other well-known algorithms such as RSA Cryptosystems. Besides short key length the feasibility of patent-free implementation and ease of generating public and private key pairs makes the ECC a very likely candidate for replacing RSA in many applications. This trend is taking place at a faster speed in wireless devices and smart cards in which the key-size, speed and ease of use are indispensable parts of the Cryptographic applications deployed. In Cryptographic applications two special types of finite fields have become very important for the implementation of elliptic curve Cryptosystems: the prime field GF(p) and the binary extension field GF(2k). In order to promote interoperability between different implementations a Crypto-coprocessor should operate in both types of finite fields. Although prime fields and binary extension fields have dissimilar properties the elements of either fields are represented using the same data structures in digital systems. Furthermore, the arithmetic operations in both fields have structural similarities allowing a dual-field (unified) design.

New Challenges in Embedded Security

Dr.Burton S. Kaliski Jr., Chief Scientist and Director RSA Labs.
Thursday, October 18, 2001; 11:00 am; Room: Great Hall, Higgins House, WPI (enter off Salisbury St.)

Abstract

The pervasive, intelligent, and interdependent computing devices of the near future will need embedded security features to identify each other, authenticate exchanged information such as software upgrades, and defend against tampering. Since the device manufacturer, device owner, and information provider will generally be completely different authorities, new challenges about device ownership and trust must be addressed. This talk will explore the need for and challenges of embedded security, and offer suggestions for Research and standards development.

Security in Future Embedded Ad-Hoc Networks

Prof. Christof Paar, WPI / Ruhr-Universität Bochum
Thursday, September 6, 2001; 3:00 pm; Room: AK 218

Abstract

Historically, computer networks consisted Mainly of traditional computers, that is, servers or Mainframes together with PC-type clients. However, it is widely expected that the next generation of networked devices will also heavily consist of various types of embedded applications. Such applications may include wireless phones, PDAs, cars with Internet access, househOld appliances, infrastructure sensors, medical devices, etc. Common features of many of these applications are that they are

part of an ad-hoc, i.e., dynamically changing, network;
wirelessly connected;
power and/or computationally constrained

In this presentation we will look at the security requirements which are specific to these types of applications, and we will then show how the "resurrecting duckling" security Model, which was developed by Stajano and Anderson from Cambridge University in England, addresses security in ad-hoc networks. The talk will conclude with related work in Christof Paar's Research group.

Maintained by webmaster@wpi.edu
Last modified: Tuesday, 29-Jun-2004 09:57:46 EDT