DBpedia – Linked Data Fragments

DBpedia 2016-04

Query DBpedia 2016-04 by triple pattern

Matches in DBpedia 2016-04 for { ?s ?p "CubeHash is a cryptographic hash function submitted to the NIST hash function competition by Daniel J. Bernstein. CubeHash has a 128 byte state, uses wide pipe construction, and is ARX based. Message blocks are XORed into the initial bits of a 128-byte state, which then goes through an r-round bijective transformation between blocks. The initial NIST proposal (\"Cubehash8/1\") required about 200 cycles per byte. After clarifications from NIST, the author changed the proposal to Cubehash16/32, which \"is approximately 16 times faster than CubeHash8/1, easily catching up to both SHA-256 and SHA-512 on the reference platform\" while still maintaining a \"comfortable security margin\".CubeHash advanced to the second round of the competition, but was not chosen as one of the 5 finalists. The author tuned the parameters further since."@en }

Showing triples 1 to 1 of 1 with 100 triples per page.