- Hardware The physical components of a computer system, such as the motherboard, processor, and memory. This is a crucial part of a computer system, as it provides the necessary components for running software and storing data. Examples of hardware include CPUs, RAM, and storage drives.
- Hardware Security Module (HSM) A physical device that securely generates, stores, and manages digital keys. It is used in cryptography to protect sensitive data, such as cryptographic keys and passwords. Examples of HSMs include smart cards and USB security tokens.
- Hardware segmentation Hardware segmentation is the practice of dividing a network into physically separate segments, each with dedicated hardware such as switches and routers. This approach can enhance security by containing threats within a segment and preventing unauthorized access across different parts of the network. It is particularly useful for protecting high-value assets within an organization.
- Hardwired Key A hardwired key in cryptography is a secret key that is embedded directly within hardware and is not designed to be modified or replaced. This type of key is used for specific cryptographic functions and is known for its resistance to extraction or tampering due to its physical integration into the hardware.
- Harrison-Ruzzo-Ullman modelA formal model used for expressing access control policies and analyzing their security properties. Named after its creators, Michael A. Harrison, Walter L. Ruzzo, and Jeffrey D. Ullman, the model focuses on determining whether a system configuration could allow a subject to acquire unauthorized access rights. It's particularly known for its undecidable safety problem - it's not generally possible to determine whether a given system is 'safe' against privilege escalation.
- Hash collision A hash collision occurs when two distinct inputs produce identical hash values using the same hashing algorithm. Collisions present a security concern, as they may be exploited to deceive systems relying on hashes for data integrity verification. Strong hashing algorithms are designed to minimize the probability of collisions.
- Hashed Message Authentication Code (HMAC) A cryptographic technique that uses a hash function and a secret key to verify the authenticity and integrity of a message. It is used in secure communication protocols to prevent tampering and replay attacks. Examples of HMAC include using it to authenticate HTTP requests and verify the authenticity of digital signatures.
- Hash (hashing) The process of converting data into a fixed-length, unique value known as a hash. This is used in cryptography to verify the integrity of data, as any change to the data will result in a different hash value. Examples of hashing include using a hash function to create a digital signature and generating a checksum for a file.
- Hashing Function An algorithm that maps data of any size to a fixed size. The output, or hash, is a string of characters that represents the input data. In security, hash functions are used for a variety of purposes, including data integrity checks, password storage, and digital signatures. A secure hash function has the property that it's computationally infeasible to derive the original input from its hash, making it useful for storing sensitive information like passwords in a form that prevents their recovery even if the hash is known.
- Hash Value The fixed-length output produced by a hash function. This is a unique value that represents the input data, and any change to the input data will result in a different hash value. Examples of hash values include a password hash and a digital signature.
Share our FREE glossary with your friends and study buddies.
Disclaimer: The glossary is for informational purposes only, we are not liable for any errors or omissions, if you find errors please contact us.