Search results

Jump to navigation Jump to search
  • {{Infobox cryptographic hash function ...irst3=Vincent|title=Selected Areas in Cryptography |chapter=Breaking a New Hash Function Design Strategy Called SMASH |series=Lecture Notes in Computer Sci ...
    2 KB (331 words) - 16:47, 22 August 2023
  • {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...
    14 KB (2,067 words) - 04:37, 24 August 2024
  • * Linear [[hash chain]] * [[Merkle tree]] (binary hash tree) ...
    13 KB (1,730 words) - 04:20, 21 August 2023
  • {{Short description|Family of cryptographic hash functions}} {{Infobox cryptographic hash function ...
    19 KB (2,944 words) - 20:50, 12 August 2024
  • ...and using the identity of the vertex reached at the end of the walk as the hash value for the input. The security of the proposed hashing scheme rests on t ...lmp}} However, a leading variant of supersingular isogeny key exchange was broken in 2022 using non-quantum methods.{{r|goodin}} ...
    6 KB (809 words) - 04:48, 30 November 2024
  • ...folder structure]], sizes, and [[cryptographic hash function|cryptographic hash values]] for verifying file integrity. ...nt file, and/or achieves a similar result through the use of [[distributed hash table]]s. Then the client connects directly to the peers in order to reques ...
    18 KB (2,738 words) - 18:13, 3 January 2025
  • ...e resistance of the [[Skein (hash function)|Skein-512]] and [[SHA-2]] hash functions.<ref>[https://eprint.iacr.org/2011/286.pdf Bicliques for Preimages: Attacks ..., it is a theoretical attack, which means the security of AES has not been broken, and the use of AES remains relatively secure. The biclique attack is never ...
    18 KB (2,971 words) - 23:38, 29 October 2023
  • {{Infobox cryptographic hash function The bcrypt function is the default password [[hash algorithm]] for [[OpenBSD]],<ref name="original">{{cite web |date=23 March ...
    27 KB (3,896 words) - 05:14, 28 February 2025
  • ...first1=Gaston H. | title=Expected Length of the Longest Probe Sequence in Hash Code Searching | date=1981 | journal=Journal of the Association for Computi ...d then allocates the ball into the least loaded of the selected bins (ties broken arbitrarily), then with high probability the maximum load is:<ref name=abku ...
    13 KB (2,033 words) - 08:04, 31 May 2024
  • ...Klareich2020" />), but with the notable exception of collision-resistant [[hash function]] families. For this reason, it has been referred to as "crypto-co ...|url-status=dead }}</ref>) It is possible that this construction could be broken with [[quantum computing]], but there is an alternative construction that m ...
    23 KB (3,107 words) - 13:53, 10 October 2024
  • ...n bulb was among the first three. Continuing this procedure can locate the broken bulb in no more than three tests, compared to a maximum of six tests if the ...g the first half of the bulbs at once, it can be determined which half the broken bulb is in, ruling out half of the bulbs in just one test. ...
    69 KB (10,782 words) - 02:43, 12 June 2024
  • ...li|software|Computer software}} designed to perform a group of coordinated functions, tasks, or activities for the benefit of the {{gli|user}}. Common examples ...erm "artificial intelligence" is applied when a machine mimics "cognitive" functions that humans associate with other [[human mind]]s, such as "learning" and "p ...
    214 KB (29,880 words) - 09:50, 28 January 2025
  • ...urrency, saying, "There's no central bank to regulate it; it's digital and functions completely peer to peer".<ref name="The Good Wife">{{cite news|last=Toepfer ...=live |journal=[[Ledger (journal)|Ledger]] |doi=10.5195/LEDGER.2015.1 |doi-broken-date=1 November 2024 |archive-url=https://web.archive.org/web/2015092219060 ...
    156 KB (19,847 words) - 00:02, 24 February 2025