PURDY: a Fortran subroutine for evaluating Purdy's irreversible enciphering function. It serves as a machine independent model for studying the evaluation of polynomials mod P and for the implementation of more efficient machine dependent system utility programs for enciphering passwords. (See H.D. Knoble, ACM TOMS 5 (1979) pp. 108-111.). Classes : B . Number theory Z . Other Type : Fortran software in TOMS collection. Access : Some uses prohibited. Portable. Precision: Single. Usage : CALL PURDY (X, FX, A, PRIME, N, ACOEFF, WORK, NP, NN, NW, IDIMA, IERR) Details : Fullsource Sites : (1) NETLIB
NETLIB: Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Precision: Single. You may access components from NETLIB outside GAMS as follows. Fullsource : echo "send 536 from toms" | mail netlib@ornl.gov
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Tue Sep 16, 2008 at 09:48:52 UTC