Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On pedagogically sound examples in public-key cryptography
Chong S., Farr G., Frost L., Hawley S.  Computer science 2006 (Proceedings of the 48th Conference on Computer Science, Hobart, Australia, Jan 16-19, 2006)63-68.2006.Type:Proceedings
Date Reviewed: Oct 12 2006

This paper is dedicated to helping students learn to apply algorithms used in public key cryptography. The basic idea is that pencil-and-paper exercises in public key cryptography are important in order to learn the subject. It is important that a student doing such an exercise does not get the right answer using the wrong method. This paper offers a modality to construct exercises that are sound: a student who makes one of several common errors will get a wrong answer.

The authors also introduce diagnostic exercises, in which the right answer and each of the most common error paths lead to different answers; therefore, the answer given by a student may suggest the nature of its error. All these types of exercises can be generated automatically by software proposed here.

The exercises considered are generally based on the operations of encryption and decryption in various public key cryptosystems. Only the main tasks concerning these operations, for which certain kinds of errors continually come up, are covered.

The paper is organized as follows. The first part is an introduction, and the next section contains some formal definitions of the concepts of sound and diagnostic examples. Section 3 discusses common errors. In section 4, sample exercises and anticipated errors are outlined for the cryptosystems RSA, Diffie-Hellman, Massey-Omura, El Gamal, and Knapsack. Section 5 contains an overview of the software, describing the main functions present in the system. Some conclusions and suggestions for further work are given in the last section.

Reviewer:  Adrian Atanasiu Review #: CR133433 (0710-1010)
Bookmark and Share
  Reviewer Selected
 
 
Public Key Cryptosystems (E.3 ... )
 
 
Error Control Codes (E.4 ... )
 
 
Standards (E.3 ... )
 
 
Numerical Algorithms And Problems (F.2.1 )
 
 
Coding And Information Theory (E.4 )
 
 
Data Encryption (E.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Public Key Cryptosystems": Date
Direct demonstration of the power to break public-key cryptosystems
Koyama K.  Advances in cryptology (, Sydney, Australia, Jan 8-11, 1990)211990. Type: Proceedings
Sep 1 1991
Public-key cryptography
Salomaa A., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9783540528319)
Feb 1 1992
Computation of discrete logarithms in prime fields
LaMacchia B., Odlyzko A. Designs, Codes and Cryptography 1(1): 47-62, 1991. Type: Article
Apr 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy