Lines Matching refs:seed
1308 XP, XP1 and XP2 are the seed values. All values are mandatory.
1427 value is stored at R_COUNTER and the seed actually used for
1431 const void *seed, size_t seedlen,
1456 if (!seed && !seedlen)
1457 ; /* No seed value given: We are asked to generate it. */
1458 else if (!seed || seedlen < qbits/8)
1479 /* Step 1: Generate a (new) seed unless one has been supplied. */
1480 if (!seed)
1484 seed = seed_help_buffer;
1487 /* Step 2: U = sha1(seed) ^ sha1((seed+1) mod 2^{qbits}) */
1488 memcpy (seed_plus, seed, seedlen);
1495 gcry_md_hash_buffer (GCRY_MD_SHA1, value_u, seed, seedlen);
1514 seed = NULL; /* Force a new seed at Step 1. */
1526 V_k = sha1(seed+offset+k) mod 2^{qbits}
1586 /* Step 15: Save p, q, counter and seed. */
1589 /* log_printhex("fips186-2 seed:", seed, seedlen); */
1606 memcpy (seed_plus, seed, seedlen);
1636 value is stored at R_COUNTER and the seed actually used for
1646 const void *seed, size_t seedlen,
1694 if (!seed && !seedlen)
1695 ; /* No seed value given: We are asked to generate it. */
1696 else if (!seed || seedlen < qbits/8)
1721 /* Step 5: Generate a (new) seed unless one has been supplied. */
1722 if (!seed)
1727 seed = seed_help_buffer;
1730 /* Step 6: U = hash(seed) */
1731 gcry_md_hash_buffer (hashalgo, value_u, seed, seedlen);
1757 seed = NULL; /* Force a new seed at Step 5. */
1762 memcpy (seed_plus, seed, seedlen);
1770 V_j = hash(seed+offset+j)
1829 /* Step 12: Save p, q, counter and seed. */
1832 log_printhex("fips186-3 seed:", seed, seedlen);
1849 memcpy (seed_plus, seed, seedlen);