Skip to content
Snippets Groups Projects
Select Git revision
  • master
  • chacha-poly1305-test
  • rsa-crt-hardening
  • chacha96
  • fat-library
  • versioned-symbols
  • curve25519
  • dsa-reorg
  • aead-api
  • set_key-changes
  • poly1305
  • aes-reorg
  • nettle-2.7-fixes
  • size_t-changes
  • ecc-support
  • experimental-20050201
  • lsh-1.4.2
  • nettle_3.1.1_release_20150424
  • nettle_3.1_release_20150407
  • nettle_3.1rc3
  • nettle_3.1rc2
  • nettle_3.1rc1
  • nettle_3.0_release_20140607
  • nettle_2.7.1_release_20130528
  • nettle_2.7_release_20130424
  • nettle_2.6_release_20130116
  • nettle_2.5_release_20120707
  • converted-master-branch-to-git
  • nettle_2.4_release_20110903
  • nettle_2.3_release_20110902
  • nettle_2.2_release_20110711
  • nettle_2.1_release_20100725
  • camellia_32bit_20100720
  • nettle_2.0_release_20090608
  • nettle_1.15_release_20061128
  • after_experimental_merge_20060516
  • head_before_experimental_merge_20060516
37 results

twofish.c

Blame
  • Forked from Nettle / nettle
    Source project has a limited visibility.
    shadata.c 1.06 KiB
    #include <math.h>
    #include <stdio.h>
    
    static const unsigned primes[64] =
    {
      2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 
      31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 
      73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 
      127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 
      179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 
      233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 
      283, 293, 307, 311
    };
    
    int main(int argc, char **argv)
    {
      int i;
      static const double third = 1.0/3;
    
      printf("SHA-256 constants: \n");
      for (i = 0; i < 64; )
        {
          double root = pow(primes[i++], third);
          double fraction = root - floor(root);
          double value = floor(ldexp(fraction, 32));
    
          printf("0x%08lxUL, ", (unsigned long) value);
          if (!(i % 4))
    	printf("\n");
        }
    
      printf("\nSHA-256 initial values: \n");
    
      for (i = 0; i < 8; )
        {
          double root = pow(primes[i++], 0.5);
          double fraction = root - (floor(root));
          double value = floor(ldexp(fraction, 32));
    
          printf("0x%08lxUL, ", (unsigned long) value);
          if (!(i % 4))
    	printf("\n");
        }
      
      return 0;
    }