Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Just as the strong test checks for the existence of more than two square roots of 1 modulo n, two such tests can sometimes check for the existence of more...
    38 KB (5,639 words) - 20:26, 3 May 2025
  • Thumbnail for Universal Product Code
    modulo 10 (i.e. the remainder, when divided by 10) and call it M. If M is zero, then the check digit is 0; otherwise the check digit is 10 − M. For example...
    50 KB (5,382 words) - 03:03, 13 June 2025
  • Thumbnail for Diffie–Hellman key exchange
    protocol uses the multiplicative group of integers modulo p, where p is prime, and g is a primitive root modulo p. To guard against potential vulnerabilities...
    47 KB (5,367 words) - 01:46, 20 June 2025
  • For 128 bits of security in the supersingular isogeny Diffie–Hellman (SIDH) method, De Feo, Jao and Plut recommend using a supersingular curve modulo...
    63 KB (6,418 words) - 00:46, 20 June 2025
  • follows. Let Z q {\displaystyle \mathbb {Z} _{q}} denote the ring of integers modulo q {\displaystyle q} and let Z q n {\displaystyle \mathbb {Z} _{q}^{n}} denote...
    20 KB (3,411 words) - 20:37, 24 May 2025
  • {\displaystyle s-s'=k^{-1}(z-z')} (all operations in this paragraph are done modulo n {\displaystyle n} ) the attacker can find k = z − z ′ s − s ′ {\displaystyle...
    19 KB (2,833 words) - 08:53, 8 May 2025
  • n} is 2 modulo 3, but there exists a two-term expansion whenever n {\displaystyle n} has a factor that is 2 modulo 3, a weaker condition. For numbers...
    31 KB (4,747 words) - 18:00, 12 May 2025
  • join(N.split()).replace(":", ""), 16) g = 2 # A generator modulo N k = H(N, g) # Multiplier parameter (k=3 in legacy SRP-6) F = '#0x' # Format specifier print("#...
    28 KB (3,404 words) - 16:06, 8 December 2024
  • Thumbnail for Prime number
    using higher-degree polynomials, again modulo large primes. As well as in the hash function, prime numbers are used for the hash table size in quadratic probing...
    117 KB (14,179 words) - 21:25, 8 June 2025
  • of the first coordinate of R {\displaystyle R} . Note: for the algorithm to be secure some checks have to be performed. See Hankerson et al. Bob calculates:...
    13 KB (1,743 words) - 17:24, 4 September 2024
  • Thumbnail for GPS signals
    index for PRN number and code i {\displaystyle i} designated in the IS. mod {\displaystyle \operatorname {mod} } is the remainder of division (or modulo) operation...
    75 KB (10,651 words) - 14:45, 12 June 2025
  • algorithm for integer factorization, which searches for a factor p of a given number n by looking for values xi and xi+λ which are equal modulo p without...
    34 KB (4,554 words) - 06:11, 21 May 2025
  • lattice basis in polynomial time Modular square root: computing square roots modulo a prime number Berlekamp's root finding algorithm Cipolla's algorithm Tonelli–Shanks...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • Thumbnail for Special relativity
    Lorentz group. Likewise, rotation angles arise naturally as coordinates (modulo 2π) on the pure rotation generators in the Lie algebra. (Together they coordinatize...
    187 KB (25,060 words) - 17:11, 15 June 2025
  • uncompressed data and LZMA data, possibly with multiple different LZMA encoding parameters. LZMA2 supports arbitrarily scalable multithreaded compression and decompression...
    31 KB (3,534 words) - 21:42, 4 May 2025
  • Thumbnail for JavaScript syntax
    more parameters than the function will use foo(...a); // "1:2:3" → foo(a[0], a[1], a[2], a[3]); // Users can mix it with non-spread parameters foo(5...
    90 KB (10,628 words) - 20:03, 13 May 2025
  • The message can also contain Earth's rotation parameters, ionosphere models, long-term orbit parameters for GLONASS satellites, and COSPAS-SARSAT messages...
    72 KB (6,263 words) - 20:30, 17 June 2025
  • Pocklington's algorithm for efficiently finding square roots modulo prime numbers. In 1970, Elwyn Berlekamp introduced a randomized algorithm for efficiently computing...
    33 KB (4,218 words) - 20:53, 19 June 2025
  • argument is an immediate, then the bit-index in the second argument is taken modulo operand size (16/32/64, in effect using only the bottom 4, 5 or 6 bits of...
    263 KB (14,911 words) - 01:23, 19 June 2025
  • Thumbnail for Hipparcos
    derived. The apparent angle between two stars in the combined fields of view, modulo the grid period, was obtained from the phase difference of the two star...
    59 KB (6,798 words) - 07:01, 19 March 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)