Glossary of Terms

Login

Glossary

Filter:

# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All

H

H

Ha Ha Only Serious

Hack

Hack On

Hack Up

Hacker

Hacker code of ethics

Hacker Ethic, The

Hacker vulnerability testing tools

Hackers (and Unauthorized Users)

Hacking

Hacking X For Y

Hackish

Hair

Hairy

HAKMEM

Hakspek

Half-Duplex Operation

Halftone Characteristic

hallenge-Handshake Authentication Protocol (CHAP)

Hammer

Hamming Distance

Hamster

Hand geometry scanning

Handle

Handled

Handler

Handling Caveats

Handling Restrictions

Handshaking Procedure

Handshaking Procedures

Hand-shaking stages

Hang

Happily

Haque

Harden

Hardware Asset Management

Hardware Handshaking

Hardware Isolation Mechanisms

Hardware Protection Mechanisms

Hardware Security

Has The X Nature

Hash

Hashed Message Authentication Code

Hashing

Hat

Hazard

HCF

HD

HDLC

HDM

Header

Header checksum

Header destruction

Head-On Collision

Health Information Portability and Accountability Act (HIPAA[AuQ3][AuQ3])

Hertz

Hex

Hexadecimal directory traversal attack

Hexit

HF

HHOK

HHOS

Hidden Sections

Hierarchical Computer Network

Hierarchical Development Methodology (HDM)

Hierarchically Synchronized Network

High Order Language

High Risk Environment

High-Level Control

High-Level Data Link Control

High-Level Language

Highly

Hing

HIPAA (Health Information Portability and Accountability Act)

Hirsute

History Of Information Security

HLL

HMAC

HMAC (key-Hashed Message Authentication Code)

Hobbit

Hog

HOIS

HOIST

HOL

Hole

Homeland Security Act of 2002

Hook

Hop

Hose

Hosed

Host

Host assessment tools

Host To Front-End

Host To Front-End Protocol

Hostile Cognizant Agent

Hostile Intelligence Sources

Hostile Threat Environment

Hosting companies

Housekeeping Procedures

HP-SUX

HSM

HTML (Hypertext Markup Language)

HTML body parts

HTTP (Hypertext Transfer Protocol)

HTTP proxy server

Https

Huff

Human Intelligence

Human Interface Functions

HUMINT

Humma

Hung

Hungus

HUS

HUSK

Hybrid Computer

Hybrid TCP/IP-OSI architecture

Hypertext Markup Language (HTML)

Hypertext Transfer Protocol (HTTP)

Hysterical Reasons

Hz

HAKMEM

MIT AI Memo 239 (February 1972). A legendary collection of neat mathematical and programming hacks contributed by many people at MIT and elsewhere. (The title of the memo really is "HAKMEM", which is a 6-letterism for `hacks memo'. ) Some of them are very useful techniques, powerful theorems, or interesting unsolved problems, but most fall into the category of mathematical and computer trivia. Here is a sampling of the entries (with authors), slightly paraphrased Item 41 (Gene Salamin) There are exactly 23,000 prime numbers less than 2^18. Item 46 (Rich Schroeppel) The most *probable* suit distribution in bridge hands is 4-4-3-2, as compared to 4-3-3-3, which is the most *evenly* distributed. This is because the world likes to have unequal numbers a thermodynamic effect saying things will not be in the state of lowest energy, but in the state of lowest disordered energy. Item 81 (Rich Schroeppel) Count the magic squares of order 5 (that is, all the 5-by-5 arrangements of the numbers from 1 to 25 such that all rows, columns, and diagonals add up to the same number). There are about 320 million, not counting those that differ only by rotation and reflection. Item 154 (Bill Gosper) The myth that any given programming language is machine independent is easily exploded by computing the sum of powers of 2. If the result loops with period = 1 with sign +, you are on a sign-magnitude machine. If the result loops with period = 1 at -1, you are on a twos-complement machine. If the result loops with period greater than 1, including the beginning, you are on a ones-complement machine. If the result loops with period greater than 1, not including the beginning, your machine isn't binary -- the pattern should tell you the base. If you run out of memory, you are on a string or bignum system. If arithmetic overflow is a fatal error, some fascist pig with a read-only mind is trying to enforce machine independence. But the very ability to trap overflow is machine dependent. By this