swifftの例文
- SWIFFT is an example of a hash function that circumvents these security problems.
- Although SWIFFT satisfies many desirable cryptographic and statistical properties, it was not designed to be an " all-purpose " cryptographic hash function.
- A modification of SWIFFT called SWIFFTX was proposed as a candidate for SHA-3 function to the NIST hash function competition and was rejected in the first round.
- It can be shown that for any algorithm that can break SWIFFT with probability P within an estimated time T, we can find an algorithm that solves the " worst-case " scenario of a certain difficult mathematical problem within time T'depending on T and P.