Scratch hardness Scratch hardness Scratch hardness tests are used to determine the hardness of a material to scratches and abrasion. The earliest test was developed by mineralogist Friedrich Mohs in 1820 (see Mohs scale). It is based on relative scratch hardness, with talc assigned a value of 1 and diamond assigned a value of 10. Mohs' scale had two limitations; it was not linear, and most modern abrasives fall between 9 and 10. Raymond R. Ridgway, a research engineer at the Norton Company, modified the Mohs scale by giving garnet a hardness of 10 and diamond a hardness of 15. Charles E.
Computational hardness assumption Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where "efficiently" typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood. Computational hardness assumptions are of particular importance in cryptography. A major goal in cryptography is to create cryptographic primitives with provable security. In some cases, cryptographic protocols are found