Contents


    Index of cs320/crypto

    Introduction

    This is a simple example of how a logically concurrent structure can be a simple and natural solution to a problem. It also shows 4 or 5 ways to implement the desired logic.

    [ Specification ]

    [ Design ]

    Test data [ test.dat ]

    Code

  1. Ada [ crypto.ada ]

  2. C What we want: [ p1.c ] [ p2.c ]

    [ p2s.c ] /* p2 as a restartable subroutine */

    Working code [ crypto.c ] /* Using a restartable function */ [ cryptop.c ] /* Using a pipe to handle interprocess communication: GETP/PUTP

    Instructions for compiling and running programs

    [ Makefile ]

    . . . . . . . . . ( end of section Index of cs320/crypto) <<Contents | Index>>


Formulae and Definitions in Alphabetical Order