Find link

language:

Find link is a tool written by Edward Betts.

searching for Precomputation 21 found (33 total)

Logjam (computer security) (1,297 words) [view diff] exact match in snippet view article

and reused. The researchers calculated the cost of creating logjam precomputation for one 1024-bit prime at hundreds of millions of USD, and noted that

Badouel intersection algorithm (60 words) [view diff] exact match in snippet view article find links to article

intersection of a ray and a triangle in three dimensions without needing precomputation of the plane equation of the plane containing the triangle. Ray-Polygon

Rainbow table (3,485 words) [view diff] exact match in snippet view article find links to article

random and stored with the password hash. A large salt value prevents precomputation attacks, including rainbow tables, by ensuring that each user's password

Function field sieve (2,658 words) [view diff] exact match in snippet view article find links to article

\alpha _{P}\deg(P)} . The Function Field Sieve algorithm consists of a precomputation where the discrete logarithms of irreducible polynomials of small degree

Möller–Trumbore intersection algorithm (1,585 words) [view diff] exact match in snippet view article find links to article

intersection of a ray and a triangle in three dimensions without needing precomputation of the plane equation of the plane containing the triangle. Among other

Discrete logarithm (2,506 words) [view diff] exact match in snippet view article find links to article

authors of the Logjam attack estimate that the much more difficult precomputation needed to solve the discrete log problem for a 1024-bit prime would

E0 (cipher) (802 words) [view diff] exact match in snippet view article

about 240 operations. The attack was improved to 237 operations for precomputation and 239 for the actual key search. In 2005, Lu, Meier and Vaudenay published

Barrett reduction (3,763 words) [view diff] exact match in snippet view article find links to article

et al. showed that the full product is unnecessary if we can perform precomputation on one of the operands. We call a function [ ] : R → Z {\displaystyle

Twofish (827 words) [view diff] exact match in snippet view article find links to article

in hardware for Twofish. An example of such a tradeoff would be the precomputation of round subkeys or s-boxes, which can lead to speed increases of a

Diffie–Hellman key exchange (5,437 words) [view diff] exact match in snippet view article find links to article

estimated by the authors behind the Logjam attack, the much more difficult precomputation needed to solve the discrete log problem for a 1024-bit prime would

Rebound attack (1,939 words) [view diff] exact match in snippet view article find links to article

can be found with a complexity of 28 round transformations due to the precomputation step. The outbound phase completes the differential characteristic in

Security level (1,332 words) [view diff] exact match in snippet view article find links to article

June 2012). "Non-uniform cracks in the concrete: the power of free precomputation" (PDF). Advances in Cryptology - ASIACRYPT 2013. Lecture Notes in Computer

Cube root (2,266 words) [view diff] exact match in snippet view article find links to article

assuming that ⁠1/3⁠a is precomputed, so three iterations plus the precomputation require seven multiplications, three additions, and three divisions

P/poly (1,867 words) [view diff] exact match in snippet view article find links to article

BPP, this also admits the possibility that adversaries can do heavy precomputation for inputs up to a certain length, as in the construction of rainbow

Montgomery modular multiplication (4,593 words) [view diff] exact match in snippet view article find links to article

only place where a direct reduction modulo N is necessary is in the precomputation of R2 mod N. Most cryptographic applications require numbers that are

Disk encryption theory (3,772 words) [view diff] exact match in snippet view article find links to article

{\displaystyle {\text{GF}}\left(2^{128}\right)} for AES). With some precomputation, only a single multiplication per sector is required (note that addition

Crypto Wars (4,098 words) [view diff] exact match in snippet view article find links to article

primes in Diffie–Hellman implementations, and that NSA having done precomputation against those primes in order to break encryption using them in real

Steiner tree problem (4,391 words) [view diff] exact match in snippet view article find links to article

1986, Wu et al. improved dramatically on the running time by avoiding precomputation of the all-pairs shortest paths. Instead, they take a similar approach

MIFARE (6,975 words) [view diff] exact match in snippet view article find links to article

MIFARE Classic, has instant running time, and does not require a costly precomputation. The new attack allows recovering the secret key of any sector of the

Minimum-diameter spanning tree (1,296 words) [view diff] exact match in snippet view article find links to article

points can also be tested in O ( n ) {\displaystyle O(n)} , after a precomputation step in which, for each point, the other points are sorted by their

Discrete logarithm records (3,413 words) [view diff] exact match in snippet view article find links to article

1607. Joux, Antoine; Pierrot, Cécile. "Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms" (PDF). Archived