Loading...
Please wait, while we are loading the content...
Similar Documents
Construction, testing and use of checksum algorithms for computer virus detection
| Content Provider | Semantic Scholar |
|---|---|
| Author | Varney, Douglas William. |
| Copyright Year | 1989 |
| Abstract | This thesis deals with the construction and testing of checksum algorithms for computer virus detection on small computer systems. Checksum algorithms need to produce checksums with the following features: even mapping over the range of possible checksums, permutation dependency, and every bit of the checksum is an overdetermined function of all the bits of the set of data being checksummed. Checksum algorithms to protect against viruses also need to be noninvertable and produce checksums with adequate lengdi because viruses can employ either a brute force or a trap door attack against the checksum. A birthday attack was shown to be not applicable in the case of strong checksum algorithms. The methods to construct checksum algorithms with these properties include substitution, transposition and feed back. Cryptographic checksum algorithms were found to be too inefficient for small computers and effort was concentrated on noncryptographic algorithms. Several noncryptographic checksum algorithms were created and shown to have the necessary features. These algorithms were also tested for efficiency (speed of execution). On the basis of the strength and efficiency of the checksum algorithms a recommendation of checksum algorithms for different types of small computers was presented. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://krex.k-state.edu/dspace/bitstream/handle/2097/22423/LD2668T4CMSC1989V37.pdf?isAllowed=y&sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
