Lines Matching refs:seed
1307 XP, XP1 and XP2 are the seed values. All values are mandatory.
1426 value is stored at R_COUNTER and the seed actually used for
1430 const void *seed, size_t seedlen,
1455 if (!seed && !seedlen)
1456 ; /* No seed value given: We are asked to generate it. */
1457 else if (!seed || seedlen < qbits/8)
1478 /* Step 1: Generate a (new) seed unless one has been supplied. */
1479 if (!seed)
1483 seed = seed_help_buffer;
1486 /* Step 2: U = sha1(seed) ^ sha1((seed+1) mod 2^{qbits}) */
1487 memcpy (seed_plus, seed, seedlen);
1494 gcry_md_hash_buffer (GCRY_MD_SHA1, value_u, seed, seedlen);
1513 seed = NULL; /* Force a new seed at Step 1. */
1525 V_k = sha1(seed+offset+k) mod 2^{qbits}
1585 /* Step 15: Save p, q, counter and seed. */
1588 /* log_printhex("fips186-2 seed:", seed, seedlen); */
1605 memcpy (seed_plus, seed, seedlen);
1635 value is stored at R_COUNTER and the seed actually used for
1645 const void *seed, size_t seedlen,
1693 if (!seed && !seedlen)
1694 ; /* No seed value given: We are asked to generate it. */
1695 else if (!seed || seedlen < qbits/8)
1720 /* Step 5: Generate a (new) seed unless one has been supplied. */
1721 if (!seed)
1726 seed = seed_help_buffer;
1729 /* Step 6: U = hash(seed) */
1730 gcry_md_hash_buffer (hashalgo, value_u, seed, seedlen);
1756 seed = NULL; /* Force a new seed at Step 5. */
1761 memcpy (seed_plus, seed, seedlen);
1769 V_j = hash(seed+offset+j)
1828 /* Step 12: Save p, q, counter and seed. */
1831 log_printhex("fips186-3 seed:", seed, seedlen);
1848 memcpy (seed_plus, seed, seedlen);