Computer experts in search of security to find help at WPI conference

August 01, 2000

WORCESTER, Mass. -- In the wireless information age, security is more precious than gold. That's why Worcester Polytechnic Institute is hosting a two-day get-together for the world's top experts in computer security. The second annual Workshop on Cryptographic Hardware and Embedded Systems (CHES 2000) will take place Aug. 17-18 at Worcester Polytechnic Institute.

The event is co-organized by Christof Paar, the head of WPI's Cryptography and Information Security (CRIS) Laboratories. Paar focuses his research on integrating cryptographic capabilities into consumer products, including wireless devices. (Cryptography is the mathematically based tool that protects, or encodes, computer and other information.)

"A special focus of CHES 2000 is the integration of security functions in products such as personal digital assistants, including Palmtop or Springboard types, smart cards and the latest cellular phones," Paar said. "The recent passage of digital signature legislation by the federal government makes strong cryptographic functions in such devices a central requirement."

(A smart card, the size of a conventional credit card, has an electronic microchip embedded in it that stores electronic data and programs, protected by advanced security features. Uses include credit cards and electronic purses.) Workshop co-organizers Paar and Cetin Koc of Oregon State University note that as more consumer products gain computer-like capabilities, the greater the need for security. The challenge of adding cryptography to hardware devices and embedded systems led to the WPI workshop, as industry experts continue to search for answers.

Last year the first CHES workshop attracted more than 170 computer-security experts, half from outside the United States. The event received extensive coverage from computer-industry publications such as Dr. Dobbs Journal to the mainstream New York Times Online and Wall Street Journal, via the Associated Press.

The event offers security experts the opportunity to learn and discuss real-world system and design issues. One of the highlights of the 1999 conference came from the co-inventor of the code used to protect e-commerce, when Israel's Adi Shamir called the security of the world's leading Web browsers into question. Shamir will return to CHES 2000 to talk about attacks against smart cards and how to counter them. Smart cards are soon to become a central tool in e-commerce and business-to-business applications.

Two invited presentations at CHES will be made by world-renowned cryptographers. Alfred Menezes from the University of Waterloo, Canada, will talk about integrating security into wireless applications. David Naccache from Gemplus, France, will give a tutorial on recent attacks against smart cards. Other highlights include discussions on:
For more information, contact Christof Paar at 508-831-5061 or by e-mail at, or Arlie Corday, assistant director of media relations, at 508-831-6085 or by e-mail at More on CHES can also be found at
Founded in 1865, WPI enrolls 2,700 undergraduate and 1,000 graduate students in science, engineering, management, humanities and arts, and social sciences. Under the WPI Plan, undergraduates complete three projects focusing on their major course of study, the humanities, and the interactions among science, technology and society.

Worcester Polytechnic Institute

Related Cryptography Articles from Brightsurf:

New tool detects unsafe security practices in Android apps
Computer scientists at Columbia Engineering have shown for the first time that it is possible to analyze how thousands of Android apps use cryptography without needing to have the apps' actual codes.

A question of reality
Physicist Reinhold Bertlmann of the University of Vienna, Austria has published a review of the work of his late long-term collaborator John Stewart Bell of CERN, Geneva in EPJ H.

Randomness theory could hold key to internet security
In a new paper, Cornell Tech researchers identified a problem that holds the key to whether all encryption can be broken -- as well as a surprising connection to a mathematical concept that aims to define and measure randomness.

Future quantum computers may pose threat to today's most-secure communications
Quantum computers that are exponentially faster than any of our current classical computers and are capable of code-breaking applications could be available in 12 to 15 years, posing major risks to the security of current communications systems, according to a new RAND Corporation report.

Automated cryptocode generator is helping secure the web
In a paper presented at the recent IEEE Symposium on Security and Privacy, MIT researchers detail a system that, for the first time, automatically generates optimized cryptography code that's usually written by hand.

Is quantum computing scalable?
Debbie Leung, a fellow in CIFAR's Quantum Information Science program and a faculty member at the University of Waterloo's Institute for Quantum Computing, will discuss the challenges of scaling quantum computing at the AAAS meeting on Feb.

Quantifying how much quantum information can be eavesdropped
Summary The most basic type of quantum information processing is quantum entanglement.

Communication interception can be traced through meteor trails
Meteor burst communication is based on using meteors as cryptography assistants.

Slicing optical beams: Cryptographic algorithms for quantum networks
The mathematical models can be used not only for quantum networks and authentication but also for full-scale quantum computing.

Ytterbium: The quantum memory of tomorrow
Quantum communication and are the future of high-security communication. One of the major challenges is to create memories with the capacity to store quantum information carried by light.

Read More: Cryptography News and Cryptography Current Events is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to