Shift Register Sequences
On the encipherment of search trees and random access files
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Privacy and security of data communications and data bases
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Worst-case costs for dynamic data element security decisions
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Computers, security, and the audit function
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Research in data security: policies and projects
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 48.22 |
Although encipherment has often been discussed as a means to protect computer data, its costs are not well established. Five experiments were conducted to measure the cpu time on a CDC 6400 required by additive ciphers programmed both in assembly language and in Fortran: a “null transformation” to measure the time to move data without encipherment; encipherment with a one-word key; encipherment with a 125-word key; double key encipherment; and encipherment using a pseudo random key. The results were analyzed for consistency over 100 runs, and the effects of constant and intermittent errors were considered.Timing rates for assembly language encipherment ranged from 498,800 characters per second for a pseudo random key cipher to 2,092,000 characters per second for a constant one-word key cipher. The latter is almost equivalent to the rate required simply to move data without encipherment. Fortran tests required over four times as much cpu time. This paper introduces the idea of enciphering time coefficient the ratio of enciphering time to the time taken to fetch and store data without encipherment.