Indentation hardness test, performed with either 3 gf or 9 gf loads, preceded the development of microhardness testers using traditional indenters. In 1925, Smith and Sandland of the UK developed an indentation test that employed a square-based pyramidal indenter made from diamond. They chose the pyramidal shape with an angle of 136° between opposite faces in order to obtain hardness numbers that would be as close as possible to Brinell hardness numbers for the specimen. The Vickers test has a great advantage of using one hardness scale to test all materials.The first reference to the Vickers indenter with low loads was made
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