The Jargon File, Version 2.9.10, 01 Jul 1992 by Various
page 68 of 712 (09%)
page 68 of 712 (09%)
![]() | ![]() |
|
Kernighan (the name is from their initials). It is characterized
by C-like syntax, a declaration-free approach to variable typing and declarations, associative arrays, and field-oriented text processing. See also {Perl}. 2. n. Editing term for an expression awkward to manipulate through normal {regexp} facilities (for example, one containing a {newline}). 3. vt. To process data using `awk(1)'. = B = ===== :back door: n. A hole in the security of a system deliberately left in place by designers or maintainers. The motivation for this is not always sinister; some operating systems, for example, come out of the box with privileged accounts intended for use by field service technicians or the vendor's maintenance programmers. Historically, back doors have often lurked in systems longer than anyone expected or planned, and a few have become widely known. The infamous {RTM} worm of late 1988, for example, used a back door in the {BSD} UNIX `sendmail(8)' utility. Ken Thompson's 1983 Turing Award lecture to the ACM revealed the existence of a back door in early UNIX versions that may have qualified as the most fiendishly clever security hack of all time. The C compiler contained code that would recognize when the `login' command was being recompiled and insert some code recognizing a password chosen by Thompson, giving him entry to the system whether or not an account had been created for him. |
|