Copy disabled (too large)
Download .txt
Showing preview only (106,428K chars total). Download the full file to get everything.
Repository: cantora/avr-crypto-lib
Branch: master
Commit: b14938245d00
Files: 1086
Total size: 250.1 MB
Directory structure:
gitextract_lajz5270/
├── COPYING
├── COPYING.gpl2
├── COPYING.gpl3
├── Doxyfile
├── LICENSE
├── LICENSE.gpl2
├── LICENSE.gpl3
├── Makefile_en21
├── Makefile_en21_conf.inc
├── Makefile_m644
├── Makefile_m644_conf.inc
├── Makefile_main.inc
├── Makefile_sys_conf.inc
├── USAGE.blockciphers
├── USAGE.hashfunctions
├── USAGE.streamciphers
├── __gmsl
├── a51/
│ ├── A5_1.c
│ └── A5_1.h
├── aes/
│ ├── aes.h
│ ├── aes128_dec.c
│ ├── aes128_dec.h
│ ├── aes128_enc.c
│ ├── aes128_enc.h
│ ├── aes192_dec.c
│ ├── aes192_dec.h
│ ├── aes192_enc.c
│ ├── aes192_enc.h
│ ├── aes256_dec.c
│ ├── aes256_dec.h
│ ├── aes256_enc.c
│ ├── aes256_enc.h
│ ├── aes_dec-asm.S
│ ├── aes_dec-asm_faster.S
│ ├── aes_dec.c
│ ├── aes_dec.h
│ ├── aes_enc-asm.S
│ ├── aes_enc.c
│ ├── aes_enc.h
│ ├── aes_invsbox-asm.S
│ ├── aes_invsbox.c
│ ├── aes_invsbox.h
│ ├── aes_keyschedule-asm.S
│ ├── aes_keyschedule.c
│ ├── aes_keyschedule.h
│ ├── aes_sbox-asm.S
│ ├── aes_sbox.c
│ ├── aes_sbox.h
│ └── aes_types.h
├── arcfour/
│ ├── arcfour-asm.S
│ ├── arcfour.c
│ └── arcfour.h
├── avr-asm-macros.S
├── avr-makefile.inc
├── base64/
│ ├── base64_dec.c
│ ├── base64_dec.h
│ ├── base64_enc.c
│ └── base64_enc.h
├── bcal/
│ ├── bcal-basic.c
│ ├── bcal-basic.h
│ ├── bcal-cbc.c
│ ├── bcal-cbc.h
│ ├── bcal-cfb_bit.c
│ ├── bcal-cfb_bit.h
│ ├── bcal-cfb_byte.c
│ ├── bcal-cfb_byte.h
│ ├── bcal-cmac.c
│ ├── bcal-cmac.h
│ ├── bcal-ctr.c
│ ├── bcal-ctr.h
│ ├── bcal-eax.c
│ ├── bcal-eax.h
│ ├── bcal-nessie.c
│ ├── bcal-nessie.h
│ ├── bcal-ofb.c
│ ├── bcal-ofb.h
│ ├── bcal-performance.c
│ ├── bcal-performance.h
│ ├── bcal_aes128.c
│ ├── bcal_aes128.h
│ ├── bcal_aes192.c
│ ├── bcal_aes192.h
│ ├── bcal_aes256.c
│ ├── bcal_aes256.h
│ ├── bcal_camellia128.c
│ ├── bcal_camellia128.h
│ ├── bcal_cast5.c
│ ├── bcal_cast5.h
│ ├── bcal_cast6.c
│ ├── bcal_cast6.h
│ ├── bcal_cscipher.c
│ ├── bcal_cscipher.h
│ ├── bcal_des.c
│ ├── bcal_des.h
│ ├── bcal_khazad.c
│ ├── bcal_khazad.h
│ ├── bcal_noekeon.c
│ ├── bcal_noekeon.h
│ ├── bcal_present128.c
│ ├── bcal_present128.h
│ ├── bcal_present80.c
│ ├── bcal_present80.h
│ ├── bcal_rc5.c
│ ├── bcal_rc5.h
│ ├── bcal_rc6.c
│ ├── bcal_rc6.h
│ ├── bcal_seed.c
│ ├── bcal_seed.h
│ ├── bcal_serpent.c
│ ├── bcal_serpent.h
│ ├── bcal_skipjack.c
│ ├── bcal_skipjack.h
│ ├── bcal_tdes.c
│ ├── bcal_tdes.h
│ ├── bcal_tdes2.c
│ ├── bcal_tdes2.h
│ ├── bcal_threefish1024.c
│ ├── bcal_threefish1024.h
│ ├── bcal_threefish256.c
│ ├── bcal_threefish256.h
│ ├── bcal_threefish512.c
│ ├── bcal_threefish512.h
│ ├── bcal_xtea.c
│ ├── bcal_xtea.h
│ └── mov1.sed
├── bigint/
│ ├── bigint-stub.c
│ ├── bigint.c
│ ├── bigint.h
│ ├── bigint_add_u.S
│ ├── bigint_adjust.S
│ ├── bigint_asm.S
│ ├── bigint_io.c
│ └── bigint_io.h
├── blake/
│ ├── blake_common.c
│ ├── blake_common.h
│ ├── blake_large.c
│ ├── blake_large.h
│ ├── blake_small.c
│ └── blake_small.h
├── blockcipher_descriptor.h
├── bmw/
│ ├── bmw_224-tinyasm.S
│ ├── bmw_256-tinyasm.S
│ ├── bmw_large.c
│ ├── bmw_large.h
│ ├── bmw_small-asm.S
│ ├── bmw_small-tinyasm.S
│ ├── bmw_small.c
│ ├── bmw_small.h
│ └── f0-opt-table.txt
├── camellia/
│ ├── camellia-asm.S
│ ├── camellia.h
│ ├── camellia128-stub.c
│ └── camellia_C.c
├── cast5/
│ ├── cast5-sbox.c
│ ├── cast5-sbox.h
│ ├── cast5.c
│ └── cast5.h
├── cast6/
│ ├── cast6-sbox.c
│ ├── cast6-sbox.h
│ ├── cast6.c
│ └── cast6.h
├── cscipher/
│ ├── cscipher.h
│ ├── cscipher_sbox.c
│ ├── cscipher_sbox.h
│ ├── cscipher_small.c
│ ├── cscipher_tiny_asm.S
│ └── sbox_check.rb
├── cubehash/
│ ├── cubehash.c
│ ├── cubehash.h
│ ├── cubehash_rotates.S
│ ├── cubehash_rotates.h
│ ├── xchg.S
│ └── xchg.h
├── debug.h
├── des/
│ ├── des.c
│ └── des.h
├── doc/
│ ├── acl-guide.texi
│ ├── acl_blockciphers.texi
│ ├── acl_hashes.texi
│ ├── acl_keysizes.texi
│ └── acl_streamciphers.texi
├── dsa/
│ ├── dsa.h
│ ├── dsa_key_blob.c
│ ├── dsa_key_blob.h
│ ├── dsa_sign.c
│ └── dsa_verify.c
├── ecdsa/
│ ├── ecc.h
│ ├── ecc_chudnovsky.c
│ ├── ecdsa.h
│ ├── ecdsa_sign.c
│ ├── ecdsa_sign.h
│ ├── ecdsa_verify.c
│ ├── nist_p192.c
│ ├── nist_p192.h
│ ├── random_dummy.c
│ └── random_dummy.h
├── echo/
│ ├── aes_enc_round-asm.S
│ ├── aes_enc_round.h
│ ├── echo.c
│ └── echo.h
├── entropium/
│ ├── entropium.c
│ └── entropium.h
├── gf256mul/
│ ├── gf256mul.S
│ └── gf256mul.h
├── gmsl
├── gmsl-tests
├── grain/
│ ├── grain.c
│ └── grain.h
├── groestl/
│ ├── groestl_large.c
│ ├── groestl_large.h
│ ├── groestl_small.c
│ └── groestl_small.h
├── hashfunction_descriptor.h
├── hfal/
│ ├── hfal-basic.c
│ ├── hfal-basic.h
│ ├── hfal-hmac.c
│ ├── hfal-hmac.h
│ ├── hfal-nessie.c
│ ├── hfal-nessie.h
│ ├── hfal-performance.c
│ ├── hfal-performance.h
│ ├── hfal-test.c
│ ├── hfal-test.h
│ ├── hfal_blake_large.c
│ ├── hfal_blake_large.h
│ ├── hfal_blake_small.c
│ ├── hfal_blake_small.h
│ ├── hfal_bmw_large.c
│ ├── hfal_bmw_large.h
│ ├── hfal_bmw_small.c
│ ├── hfal_bmw_small.h
│ ├── hfal_cubehash.c
│ ├── hfal_cubehash.h
│ ├── hfal_echo.c
│ ├── hfal_echo.h
│ ├── hfal_groestl_large.c
│ ├── hfal_groestl_large.h
│ ├── hfal_groestl_small.c
│ ├── hfal_groestl_small.h
│ ├── hfal_jh.c
│ ├── hfal_jh.h
│ ├── hfal_keccak.c
│ ├── hfal_keccak.h
│ ├── hfal_md5.c
│ ├── hfal_md5.h
│ ├── hfal_sha1.c
│ ├── hfal_sha1.h
│ ├── hfal_sha224.c
│ ├── hfal_sha224.h
│ ├── hfal_sha256.c
│ ├── hfal_sha256.h
│ ├── hfal_sha384.c
│ ├── hfal_sha384.h
│ ├── hfal_sha512.c
│ ├── hfal_sha512.h
│ ├── hfal_shabal.c
│ ├── hfal_shabal.h
│ ├── hfal_skein1024.c
│ ├── hfal_skein1024.h
│ ├── hfal_skein256.c
│ ├── hfal_skein256.h
│ ├── hfal_skein512.c
│ ├── hfal_skein512.h
│ ├── hfal_twister224.c
│ ├── hfal_twister224.h
│ ├── hfal_twister256.c
│ ├── hfal_twister256.h
│ ├── hfal_twister384.c
│ ├── hfal_twister384.h
│ ├── hfal_twister512.c
│ ├── hfal_twister512.h
│ ├── hfal_whirlpool.c
│ ├── hfal_whirlpool.h
│ ├── hfal_whirlpool_0.c
│ ├── hfal_whirlpool_0.h
│ ├── hfal_whirlpool_t.c
│ └── hfal_whirlpool_t.h
├── hmac-md5/
│ ├── hmac-md5.c
│ └── hmac-md5.h
├── hmac-sha1/
│ ├── hmac-sha1.c
│ └── hmac-sha1.h
├── hmac-sha256/
│ ├── hmac-sha256.c
│ └── hmac-sha256.h
├── host/
│ ├── bigint_test.rb
│ ├── cmacvs_test.rb
│ ├── data2wiki.rb
│ ├── fix-wiki-size.rb
│ ├── get_performance.rb
│ ├── get_test.rb
│ ├── gf256_table_gen.c
│ ├── gf256mul.c
│ ├── nessie_check.rb
│ ├── optimize_shift.rb
│ ├── rsa_pkcs1v15_check.rb
│ ├── shavs_test2.rb
│ ├── sumsize.rb
│ └── threefish_helper.rb
├── jh/
│ ├── jh_simple.h
│ ├── jh_simple_aux.c
│ ├── jh_simple_small_core.c
│ ├── jh_simple_speed_core.c
│ ├── jh_tablegen.rb
│ ├── jh_tables.c
│ └── jh_tables.h
├── keccak/
│ ├── keccak-asm.S
│ ├── keccak.c
│ ├── keccak.h
│ ├── rotate64.S
│ └── rotate64.h
├── keysize_descriptor.c
├── keysize_descriptor.h
├── khazad/
│ ├── khazad.c
│ └── khazad.h
├── main.dox
├── md5/
│ ├── md5-asm.S
│ ├── md5.c
│ ├── md5.h
│ ├── md5_sbox.c
│ └── md5_sbox.h
├── memxor/
│ ├── memxor.S
│ ├── memxor.h
│ ├── memxor_c.c
│ └── memxor_p.S
├── mgf1/
│ ├── mgf1.c
│ └── mgf1.h
├── mickey128/
│ ├── mickey128.c
│ └── mickey128.h
├── mkfiles/
│ ├── 001_bcal_std.mk
│ ├── 001_cli_std.mk
│ ├── 001_hfal_std.mk
│ ├── 001_scal_std.mk
│ ├── a5_1.mk
│ ├── aes.mk
│ ├── aes_asm_faster.mk
│ ├── aes_c.mk
│ ├── arcfour.mk
│ ├── arcfour_c.mk
│ ├── base64.mk
│ ├── bigint.mk
│ ├── blake_c.mk
│ ├── bmw.mk
│ ├── bmw_c.mk
│ ├── bmw_tiny.mk
│ ├── bmw_tiny_sep.mk
│ ├── camellia.mk
│ ├── camellia_c.mk
│ ├── cast5.mk
│ ├── cast6.mk
│ ├── cscipher_small_c.mk
│ ├── cscipher_tiny.mk
│ ├── cscipher_tiny_c.mk
│ ├── cubehash_c.mk
│ ├── des.mk
│ ├── dsa.mk
│ ├── ecdsa.mk
│ ├── echo_c.mk
│ ├── entropium.mk
│ ├── grain.mk
│ ├── groestl_c.mk
│ ├── hmac-md5.mk
│ ├── hmac-sha1.mk
│ ├── hmac-sha256.mk
│ ├── jh_simple_small_c.mk
│ ├── jh_simple_speed_c.mk
│ ├── keccak_asm.mk
│ ├── keccak_c.mk
│ ├── khazad_small_c.mk
│ ├── md5.mk
│ ├── md5_c.mk
│ ├── mickey128.mk
│ ├── mqq160-sign.mk
│ ├── mqq160-sign_c.mk
│ ├── mugi.mk
│ ├── noekeon.mk
│ ├── noekeon_c.mk
│ ├── omac_noekeon.mk
│ ├── omac_noekeon_c.mk
│ ├── present.mk
│ ├── rabbit_c.mk
│ ├── rabbit_estream_c.mk
│ ├── rc5.mk
│ ├── rc6.mk
│ ├── rsaes_oaep.mk
│ ├── rsaes_pkcs1v15.mk
│ ├── salsa20_c.mk
│ ├── seed.mk
│ ├── seed_C.mk
│ ├── serpent-bitslice.mk
│ ├── serpent_asm_bitslice.mk
│ ├── serpent_asm_fast.mk
│ ├── serpent_asm_small.mk
│ ├── serpent_c.mk
│ ├── sha1.mk
│ ├── sha1_c.mk
│ ├── sha256.mk
│ ├── sha256_c.mk
│ ├── sha2_c.mk
│ ├── shabal.mk
│ ├── shabal_c.mk
│ ├── shabea.mk
│ ├── shacal1enc.mk
│ ├── shacal2enc.mk
│ ├── skein.mk
│ ├── skein_c.mk
│ ├── skipjack.mk
│ ├── skipjack_nessie.mk
│ ├── skipjack_nofix.mk
│ ├── tdes.mk
│ ├── threefish.mk
│ ├── threefish_C.mk
│ ├── threefish_small.mk
│ ├── trivium.mk
│ ├── twister.mk
│ ├── twister_c.mk
│ ├── ubi.mk
│ ├── ubi_c.mk
│ ├── whirlpool_0_fast_c.mk
│ ├── whirlpool_fast_c.mk
│ ├── whirlpool_small_c.mk
│ ├── whirlpool_t_fast_c.mk
│ ├── whirlpool_t_small_c.mk
│ ├── xtea.mk
│ ├── xtea_c.mk
│ └── xtea_new.mk
├── mqq-sign/
│ ├── mqq160-sign-asm.S
│ ├── mqq160-sign.c
│ ├── mqq160-sign.h
│ ├── mqq160-sign_P-asm.S
│ ├── mqq160-sign_P-stub.c
│ ├── mqq160-sign_P.c
│ ├── mqq160-sign_P.h
│ ├── mqq160-sign_testkey.c
│ └── mqq160-sign_testkey.h
├── mugi/
│ ├── mugi.c
│ └── mugi.h
├── noekeon/
│ ├── noekeon.c
│ ├── noekeon.h
│ ├── noekeon_asm.S
│ ├── noekeon_cbc_enc.S
│ ├── noekeon_cbc_enc.h
│ ├── noekeon_ctr.S
│ ├── noekeon_ctr.h
│ ├── noekeon_prng.c
│ ├── noekeon_prng.h
│ ├── omac_noekeon.S
│ ├── omac_noekeon.h
│ └── omac_noekeon_C.c
├── present/
│ ├── present128.c
│ ├── present128.h
│ ├── present80.c
│ ├── present80.h
│ ├── present_common.c
│ ├── present_common.h
│ ├── present_speed.c
│ └── present_speed.h
├── rabbit/
│ ├── rabbit.h
│ └── rabbit_c.c
├── rc5/
│ ├── rc5.c
│ └── rc5.h
├── rc6/
│ ├── rc6.c
│ └── rc6.h
├── rsa/
│ ├── random_dummy.c
│ ├── random_dummy.h
│ ├── random_message_1024
│ ├── random_message_1024.enc
│ ├── random_message_1024.plain
│ ├── rsa_basic.c
│ ├── rsa_basic.h
│ ├── rsa_der_structure
│ ├── rsa_privatekey_1024.ascii
│ ├── rsa_privatekey_2048.ascii
│ ├── rsa_privatekey_2048.der
│ ├── rsa_publickey_2048.ascii
│ ├── rsa_publickey_2048.der
│ ├── rsaes_oaep.c
│ ├── rsaes_oaep.h
│ ├── rsaes_pkcs1v15.c
│ └── rsaes_pkcs1v15.h
├── salsa20/
│ ├── salsa20.c
│ └── salsa20.h
├── scal/
│ ├── scal-basic.c
│ ├── scal-basic.h
│ ├── scal-nessie.c
│ ├── scal-nessie.h
│ ├── scal_arcfour.c
│ ├── scal_arcfour.h
│ ├── scal_grain.c
│ ├── scal_grain.h
│ ├── scal_mickey128.c
│ ├── scal_mickey128.h
│ ├── scal_rabbit.c
│ ├── scal_rabbit.h
│ ├── scal_salsa20.c
│ ├── scal_salsa20.h
│ ├── scal_trivium.c
│ └── scal_trivium.h
├── seed/
│ ├── seed-asm.S
│ ├── seed.h
│ ├── seed_C.c
│ ├── seed_sbox.c
│ └── seed_sbox.h
├── serpent/
│ ├── serpent-asm.S
│ ├── serpent-sboxes-bitslice-asm.S
│ ├── serpent-sboxes-bitslice.c
│ ├── serpent-sboxes-fast.S
│ ├── serpent-sboxes-small.S
│ ├── serpent-sboxes.h
│ ├── serpent-sboxes_c.c
│ ├── serpent.c
│ └── serpent.h
├── sha1/
│ ├── sha1-asm.S
│ ├── sha1.c
│ └── sha1.h
├── sha2/
│ ├── sha224.c
│ ├── sha224.h
│ ├── sha256.c
│ ├── sha256.h
│ ├── sha2_large_common.c
│ ├── sha2_large_common.h
│ ├── sha2_small_common.c
│ ├── sha2_small_common.h
│ ├── sha384.c
│ ├── sha384.h
│ ├── sha512.c
│ └── sha512.h
├── sha256/
│ ├── sha256-asm.S
│ ├── sha256.c
│ └── sha256.h
├── sha3-api.h
├── shabal/
│ ├── shabal-asm.S
│ ├── shabal.c
│ ├── shabal.h
│ ├── shabal192-asm.S
│ ├── shabal192.c
│ ├── shabal224-asm.S
│ ├── shabal224.c
│ ├── shabal256-asm.S
│ ├── shabal256.c
│ ├── shabal384-asm.S
│ ├── shabal384.c
│ ├── shabal512-asm.S
│ ├── shabal512.c
│ ├── shabal_shorttest.log
│ └── shabal_shorttest.log.ps
├── shabea/
│ ├── shabea.c
│ └── shabea.h
├── shacal1/
│ ├── shacal1_enc.c
│ └── shacal1_enc.h
├── shacal2/
│ ├── shacal2_enc.c
│ └── shacal2_enc.h
├── skein/
│ ├── skein-speed.log
│ ├── skein.h
│ ├── skein1024.c
│ ├── skein1024_asm.S
│ ├── skein256.c
│ ├── skein256_asm.S
│ ├── skein512.c
│ ├── skein512_asm.S
│ ├── skein_algo_list.txt
│ ├── threefish.h
│ ├── threefish1024_dec.c
│ ├── threefish1024_dec_asm.S
│ ├── threefish1024_dec_cstub.c
│ ├── threefish1024_enc.c
│ ├── threefish1024_enc_asm.S
│ ├── threefish256_dec.c
│ ├── threefish256_dec_asm.S
│ ├── threefish256_dec_cstub.c
│ ├── threefish256_enc.c
│ ├── threefish256_enc_asm.S
│ ├── threefish256_enc_small.S
│ ├── threefish512_dec.c
│ ├── threefish512_dec_asm.S
│ ├── threefish512_dec_cstub.c
│ ├── threefish512_enc.c
│ ├── threefish512_enc_asm.S
│ ├── threefish_invmix.S
│ ├── threefish_invmix_4c.S
│ ├── threefish_invmix_c.c
│ ├── threefish_mix.S
│ ├── threefish_mix_4c.S
│ ├── threefish_mix_c.c
│ ├── ubi.h
│ ├── ubi1024.c
│ ├── ubi1024_asm.S
│ ├── ubi256.c
│ ├── ubi256_asm.S
│ ├── ubi512.c
│ └── ubi512_asm.S
├── skipjack/
│ ├── skipjack.c
│ ├── skipjack.h
│ └── skipjack_nofix.c
├── stack_measuring.S
├── stack_measuring.h
├── streamcipher_descriptor.h
├── string-extras.h
├── test_src/
│ ├── avr-asm-macros.S
│ ├── circularbytebuffer-asm.S
│ ├── circularbytebuffer.h
│ ├── cli-basics.S
│ ├── cli-core.S
│ ├── cli-hexdump.S
│ ├── cli-stub.c
│ ├── cli.h
│ ├── cmacvs.c
│ ├── cmacvs.h
│ ├── config.h
│ ├── dbz_strings.c
│ ├── dbz_strings.h
│ ├── debug.c
│ ├── dump-asm.S
│ ├── dump-decl.c
│ ├── dump.h
│ ├── hexdigit_tab.S
│ ├── hexdigit_tab.h
│ ├── hexdigit_tab_c.c
│ ├── main-a5_1-test.c
│ ├── main-aes-test.c
│ ├── main-arcfour-test.c
│ ├── main-base64-test.c
│ ├── main-bigint-test.c
│ ├── main-blake-test.c
│ ├── main-bmw-test.c
│ ├── main-camellia-test.c
│ ├── main-cast5-test.c
│ ├── main-cast6-test.c
│ ├── main-cscipher-test.c
│ ├── main-cubehash-test.c
│ ├── main-des-test.c
│ ├── main-dsa-test.c
│ ├── main-ecdsa-test.c
│ ├── main-echo-test.c
│ ├── main-entropium-test.c
│ ├── main-grain-test.c
│ ├── main-groestl-test.c
│ ├── main-hmac-md5-test.c
│ ├── main-hmac-sha1-test.c
│ ├── main-hmac-sha256-test.c
│ ├── main-jh-test.c
│ ├── main-keccak-test.c
│ ├── main-khazad-test.c
│ ├── main-md5-test.c
│ ├── main-mickey128-test.c
│ ├── main-mqq160-sign-test.c
│ ├── main-mugi-test.c
│ ├── main-noekeon-test.c
│ ├── main-omac-noekeon-test.c
│ ├── main-present-test.c
│ ├── main-rabbit-test.c
│ ├── main-rc5-test.c
│ ├── main-rc6-test.c
│ ├── main-rsaes_oaep-test.c
│ ├── main-rsaes_pkcs1v15-test.c
│ ├── main-salsa20-test.c
│ ├── main-seed-test.c
│ ├── main-serpent-test.c
│ ├── main-sha1-test.c
│ ├── main-sha2-test.c
│ ├── main-sha256-test.c
│ ├── main-shabal-test.c
│ ├── main-shabea-test.c
│ ├── main-shacal1_enc-test.c
│ ├── main-shacal2_enc-test.c
│ ├── main-skein-test.c
│ ├── main-skipjack-test.c
│ ├── main-tdes-test.c
│ ├── main-test-common.c
│ ├── main-test-common.h
│ ├── main-threefish-test.c
│ ├── main-trivium-test.c
│ ├── main-twister-test.c
│ ├── main-ubi-test.c
│ ├── main-whirlpool-0-test.c
│ ├── main-whirlpool-t-test.c
│ ├── main-whirlpool-test.c
│ ├── main-xtea-test.c
│ ├── nessie_bc_test.c
│ ├── nessie_bc_test.h
│ ├── nessie_common.c
│ ├── nessie_common.h
│ ├── nessie_hash_test.c
│ ├── nessie_hash_test.h
│ ├── nessie_mac_test.c
│ ├── nessie_mac_test.h
│ ├── nessie_stream_test.c
│ ├── nessie_stream_test.h
│ ├── performance_test.c
│ ├── performance_test.h
│ ├── setbaud_asm.inc
│ ├── shavs.c
│ ├── shavs.h
│ ├── string-extras-asm.S
│ ├── string-extras.h
│ ├── uart_defs.h
│ ├── uart_i-asm.S
│ └── uart_i.h
├── testconf/
│ ├── AES_CMAC.conf
│ ├── Blake.conf
│ ├── BlueMidnightWish.conf
│ ├── CubeHash.conf
│ ├── Echo.conf
│ ├── Groestl.conf
│ ├── JH.conf
│ ├── Keccak.conf
│ ├── Sha1.conf
│ ├── Sha256.conf
│ ├── Shabal.conf
│ ├── Skein.conf
│ └── Twister.conf
├── testport.conf
├── testvectors/
│ ├── CAST-256.rfc2612.testvectors.txt
│ ├── Camellia-128-128.verified.test-vectors
│ ├── Cast-128-128-64.verified.test-vectors
│ ├── Cs-cipher-128-64.test-vectors
│ ├── Des-64-64.test-vectors
│ ├── HMAC-Md5-512-128.unverified.test-vectors
│ ├── HMAC-Sha-1-512-160.unverified.test-vectors
│ ├── HMAC-Sha-2-512-256.unverified.test-vectors
│ ├── Khazad-Tweaked-128-64.verified.test-vectors
│ ├── Md5-128.unverified.test-vectors
│ ├── Mickey-v2-128-unverified.test-vectors
│ ├── Noekeon-Direct-128-128.verified.test-vectors
│ ├── Rc4-arcfour-128.verified.test-vectors
│ ├── Rc5-128-64.verified.test-vectors
│ ├── Rc6-128-128.verified.test-vectors
│ ├── Rc6-192-128.verified.test-vectors
│ ├── Rc6-256-128.verified.test-vectors
│ ├── Rc6-256-256.verified.test-vectors
│ ├── Rijndael-128-128.unverified.test-vectors
│ ├── Rijndael-192-128.unverified.test-vectors
│ ├── Rijndael-256-128.unverified.test-vectors
│ ├── Seed-128-128.unverified.test-vectors
│ ├── Serpent-128-128.verified.test-vectors
│ ├── Serpent-192-128.verified.test-vectors
│ ├── Serpent-256-128.verified.test-vectors
│ ├── Sha-1-160.test-vectors
│ ├── Sha-2-256.unverified.test-vectors
│ ├── Shacal-512-160.verified.test-vectors
│ ├── Shacal-512-256.verified.test-vectors
│ ├── Skipjack-80-64.unverified.test-vectors
│ ├── Triple-Des-2-Key-128-64.unverified.test-vectors
│ ├── Triple-Des-3-Key-192-64.unverified.test-vectors
│ ├── Whirlpool-Final-512.unverified.test-vectors
│ ├── Whirlpool-Final-512.verified.cut.test-vectors
│ ├── Whirlpool-Orig-512.fixed.test-vectors
│ ├── Whirlpool-Tweak-512.verified.test-vectors
│ ├── cmacvs/
│ │ ├── CMACGenAES128.fax
│ │ ├── CMACGenAES192.fax
│ │ ├── CMACGenAES256.fax
│ │ ├── CMACGenTDES2.fax
│ │ ├── CMACGenTDES3.fax
│ │ ├── CMACVerAES128.fax
│ │ ├── CMACVerAES192.fax
│ │ ├── CMACVerAES256.fax
│ │ ├── CMACVerTDES2.fax
│ │ └── CMACVerTDES3.fax
│ ├── grain-128-unverified.test-vectors
│ ├── grain-v1-verified.test-vectors
│ ├── grain__verified.test-vectors
│ ├── mickey-v2-128-unverified.test-vectors
│ ├── present/
│ │ ├── nessie-present-128_le.txt
│ │ └── nessie-present-80_le.txt
│ ├── rabbit-verified.test-vectors
│ ├── rsa-pkcs-1v2-1-vec/
│ │ ├── oaep-vect.txt
│ │ └── pkcs1v15crypt-vectors.txt
│ ├── salsa20-full-128-verified.test-vectors
│ ├── salsa20-full-256-verified.test-vectors
│ ├── salsa20-full-verified.test-vectors
│ ├── shavs/
│ │ ├── Blake/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── Readme.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Blake-round2/
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── BlueMidnightWish/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── CubeHash/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Echo/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Groestl-0/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── IntermediateValues_1BlockMsg_224.txt
│ │ │ ├── IntermediateValues_1BlockMsg_256.txt
│ │ │ ├── IntermediateValues_1BlockMsg_384.txt
│ │ │ ├── IntermediateValues_1BlockMsg_512.txt
│ │ │ ├── IntermediateValues_2BlockMsg_224.txt
│ │ │ ├── IntermediateValues_2BlockMsg_256.txt
│ │ │ ├── IntermediateValues_2BlockMsg_384.txt
│ │ │ ├── IntermediateValues_2BlockMsg_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Groestl-round2/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── IntermediateValues_1BlockMsg_224.txt
│ │ │ ├── IntermediateValues_1BlockMsg_256.txt
│ │ │ ├── IntermediateValues_1BlockMsg_384.txt
│ │ │ ├── IntermediateValues_1BlockMsg_512.txt
│ │ │ ├── IntermediateValues_2BlockMsg_224.txt
│ │ │ ├── IntermediateValues_2BlockMsg_256.txt
│ │ │ ├── IntermediateValues_2BlockMsg_384.txt
│ │ │ ├── IntermediateValues_2BlockMsg_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── JH/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── JH-round2/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Keccak/
│ │ │ ├── DuplexKAT.txt
│ │ │ ├── DuplexKAT_r1026c574.txt
│ │ │ ├── DuplexKAT_r1027c573.txt
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_0.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── KeccakDuplexIntermediateValues_r1026c574.txt
│ │ │ ├── KeccakDuplexIntermediateValues_r1027c573.txt
│ │ │ ├── KeccakPermutationIntermediateValues.txt
│ │ │ ├── KeccakPermutationIntermediateValues32BI.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1024c576.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1088c512.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1152c448.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r576c1024.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r832c768.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_0.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_0.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_0.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ ├── ShortMsgKAT_512.txt
│ │ │ ├── ShortMsgKAT_r128c272.txt
│ │ │ ├── ShortMsgKAT_r1344c256.txt
│ │ │ ├── ShortMsgKAT_r144c256.txt
│ │ │ ├── ShortMsgKAT_r256c544.txt
│ │ │ ├── ShortMsgKAT_r40c160.txt
│ │ │ ├── ShortMsgKAT_r512c288.txt
│ │ │ └── ShortMsgKAT_r544c256.txt
│ │ ├── SHA1+2/
│ │ │ ├── BitTestVectors/
│ │ │ │ ├── SHA1LongMsg.txt
│ │ │ │ ├── SHA1Monte.txt
│ │ │ │ ├── SHA1ShortMsg.txt
│ │ │ │ ├── SHA224LongMsg.txt
│ │ │ │ ├── SHA224Monte.txt
│ │ │ │ ├── SHA224ShortMsg.txt
│ │ │ │ ├── SHA256LongMsg.txt
│ │ │ │ ├── SHA256Monte.txt
│ │ │ │ ├── SHA256ShortMsg.txt
│ │ │ │ ├── SHA384LongMsg.txt
│ │ │ │ ├── SHA384Monte.txt
│ │ │ │ ├── SHA384ShortMsg.txt
│ │ │ │ ├── SHA512LongMsg.txt
│ │ │ │ ├── SHA512Monte.txt
│ │ │ │ └── SHA512ShortMsg.txt
│ │ │ └── ByteTestVectors/
│ │ │ ├── SHA1LongMsg.txt
│ │ │ ├── SHA1Monte.txt
│ │ │ ├── SHA1ShortMsg.txt
│ │ │ ├── SHA256LongMsg.txt
│ │ │ ├── SHA256Monte.txt
│ │ │ └── SHA256ShortMsg.txt
│ │ ├── Shabal/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Skein/
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── Readme.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ ├── ShortMsgKAT_512.txt
│ │ │ ├── skein_golden_kat.txt
│ │ │ ├── skein_golden_kat_internals.txt
│ │ │ ├── skein_golden_kat_short.txt
│ │ │ └── skein_golden_kat_short_internals.txt
│ │ └── Twister/
│ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ ├── LongMsgKAT_224.txt
│ │ ├── LongMsgKAT_256.txt
│ │ ├── LongMsgKAT_384.txt
│ │ ├── LongMsgKAT_512.txt
│ │ ├── MonteCarlo_224.txt
│ │ ├── MonteCarlo_256.txt
│ │ ├── MonteCarlo_384.txt
│ │ ├── MonteCarlo_512.txt
│ │ ├── ShortMsgKAT_224.txt
│ │ ├── ShortMsgKAT_256.txt
│ │ ├── ShortMsgKAT_384.txt
│ │ └── ShortMsgKAT_512.txt
│ ├── trivium-80.32.test-vectors
│ ├── trivium-80.64.test-vectors
│ ├── trivium-80.80.test-vectors
│ └── trivium-unverified.test-vectors
├── trivium/
│ ├── trivium.c
│ └── trivium.h
├── twister/
│ ├── twister-asm.S
│ ├── twister-asm.S_shiftmul
│ ├── twister-large-asm.S
│ ├── twister-large.c
│ ├── twister-large.h
│ ├── twister-sha3api.c
│ ├── twister-sha3api.h
│ ├── twister-small-asm.S
│ ├── twister-small-stub.c
│ ├── twister-small.c
│ ├── twister-small.h
│ ├── twister-speed.log
│ ├── twister.c
│ ├── twister.h
│ ├── twister224.S
│ ├── twister256.S
│ ├── twister384.S
│ ├── twister512.S
│ ├── twister_ref.h
│ ├── twister_tables.c
│ └── twister_tables.h
├── whirlpool/
│ ├── whirlpool.c
│ └── whirlpool.h
└── xtea/
├── xtea-asm.S
├── xtea.c
└── xtea.h
================================================
FILE CONTENTS
================================================
================================================
FILE: COPYING
================================================
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
================================================
FILE: COPYING.gpl2
================================================
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
================================================
FILE: COPYING.gpl3
================================================
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
================================================
FILE: Doxyfile
================================================
# Doxyfile 1.4.7
#---------------------------------------------------------------------------
# Project related configuration options
#---------------------------------------------------------------------------
PROJECT_NAME = micro-crypt
PROJECT_NUMBER = 0.001
OUTPUT_DIRECTORY = /home/bg/workspace/micro-crypt/doc/
CREATE_SUBDIRS = NO
OUTPUT_LANGUAGE = English
USE_WINDOWS_ENCODING = NO
BRIEF_MEMBER_DESC = YES
REPEAT_BRIEF = NO
ABBREVIATE_BRIEF = "The $name class" \
"The $name widget" \
"The $name file" \
is \
provides \
specifies \
contains \
represents \
a \
an \
the
ALWAYS_DETAILED_SEC = YES
INLINE_INHERITED_MEMB = NO
FULL_PATH_NAMES = YES
STRIP_FROM_PATH = /home/bg/workspace/micro-crypt/
STRIP_FROM_INC_PATH =
SHORT_NAMES = NO
JAVADOC_AUTOBRIEF = NO
MULTILINE_CPP_IS_BRIEF = NO
DETAILS_AT_TOP = YES
INHERIT_DOCS = YES
SEPARATE_MEMBER_PAGES = NO
TAB_SIZE = 8
ALIASES = "license=\par License:\n" \
"email=\par E-Mail:\n"
OPTIMIZE_OUTPUT_FOR_C = YES
OPTIMIZE_OUTPUT_JAVA = NO
BUILTIN_STL_SUPPORT = NO
DISTRIBUTE_GROUP_DOC = NO
SUBGROUPING = YES
#---------------------------------------------------------------------------
# Build related configuration options
#---------------------------------------------------------------------------
EXTRACT_ALL = NO
EXTRACT_PRIVATE = NO
EXTRACT_STATIC = NO
EXTRACT_LOCAL_CLASSES = YES
EXTRACT_LOCAL_METHODS = NO
HIDE_UNDOC_MEMBERS = YES
HIDE_UNDOC_CLASSES = YES
HIDE_FRIEND_COMPOUNDS = NO
HIDE_IN_BODY_DOCS = NO
INTERNAL_DOCS = NO
CASE_SENSE_NAMES = YES
HIDE_SCOPE_NAMES = NO
SHOW_INCLUDE_FILES = YES
INLINE_INFO = YES
SORT_MEMBER_DOCS = YES
SORT_BRIEF_DOCS = NO
SORT_BY_SCOPE_NAME = NO
GENERATE_TODOLIST = YES
GENERATE_TESTLIST = YES
GENERATE_BUGLIST = YES
GENERATE_DEPRECATEDLIST= YES
ENABLED_SECTIONS =
MAX_INITIALIZER_LINES = 30
SHOW_USED_FILES = YES
SHOW_DIRECTORIES = NO
FILE_VERSION_FILTER =
#---------------------------------------------------------------------------
# configuration options related to warning and progress messages
#---------------------------------------------------------------------------
QUIET = NO
WARNINGS = YES
WARN_IF_UNDOCUMENTED = YES
WARN_IF_DOC_ERROR = YES
WARN_NO_PARAMDOC = NO
WARN_FORMAT = "$file:$line: $text"
WARN_LOGFILE =
#---------------------------------------------------------------------------
# configuration options related to the input files
#---------------------------------------------------------------------------
INPUT = /home/bg/workspace/micro-crypt
FILE_PATTERNS = *.h \
*.dox \
*.H \
*.HH \
*.H++ \
RECURSIVE \
= \
YES
RECURSIVE = YES
EXCLUDE =
EXCLUDE_SYMLINKS = NO
EXCLUDE_PATTERNS = main-*
EXAMPLE_PATH =
EXAMPLE_PATTERNS = *
EXAMPLE_RECURSIVE = NO
IMAGE_PATH =
INPUT_FILTER =
FILTER_PATTERNS =
FILTER_SOURCE_FILES = NO
#---------------------------------------------------------------------------
# configuration options related to source browsing
#---------------------------------------------------------------------------
SOURCE_BROWSER = NO
INLINE_SOURCES = NO
STRIP_CODE_COMMENTS = YES
REFERENCED_BY_RELATION = NO
REFERENCES_RELATION = NO
REFERENCES_LINK_SOURCE = YES
USE_HTAGS = NO
VERBATIM_HEADERS = NO
#---------------------------------------------------------------------------
# configuration options related to the alphabetical class index
#---------------------------------------------------------------------------
ALPHABETICAL_INDEX = NO
COLS_IN_ALPHA_INDEX = 5
IGNORE_PREFIX =
#---------------------------------------------------------------------------
# configuration options related to the HTML output
#---------------------------------------------------------------------------
GENERATE_HTML = YES
HTML_OUTPUT = html
HTML_FILE_EXTENSION = .html
HTML_HEADER =
HTML_FOOTER =
HTML_STYLESHEET =
HTML_ALIGN_MEMBERS = YES
GENERATE_HTMLHELP = NO
CHM_FILE =
HHC_LOCATION =
GENERATE_CHI = NO
BINARY_TOC = NO
TOC_EXPAND = NO
DISABLE_INDEX = NO
ENUM_VALUES_PER_LINE = 4
GENERATE_TREEVIEW = YES
TREEVIEW_WIDTH = 250
#---------------------------------------------------------------------------
# configuration options related to the LaTeX output
#---------------------------------------------------------------------------
GENERATE_LATEX = YES
LATEX_OUTPUT = latex
LATEX_CMD_NAME = latex
MAKEINDEX_CMD_NAME = makeindex
COMPACT_LATEX = NO
PAPER_TYPE = a4wide
EXTRA_PACKAGES =
LATEX_HEADER =
PDF_HYPERLINKS = YES
USE_PDFLATEX = YES
LATEX_BATCHMODE = NO
LATEX_HIDE_INDICES = NO
#---------------------------------------------------------------------------
# configuration options related to the RTF output
#---------------------------------------------------------------------------
GENERATE_RTF = NO
RTF_OUTPUT = rtf
COMPACT_RTF = NO
RTF_HYPERLINKS = NO
RTF_STYLESHEET_FILE =
RTF_EXTENSIONS_FILE =
#---------------------------------------------------------------------------
# configuration options related to the man page output
#---------------------------------------------------------------------------
GENERATE_MAN = NO
MAN_OUTPUT = man
MAN_EXTENSION = .3
MAN_LINKS = NO
#---------------------------------------------------------------------------
# configuration options related to the XML output
#---------------------------------------------------------------------------
GENERATE_XML = NO
XML_OUTPUT = xml
XML_SCHEMA =
XML_DTD =
XML_PROGRAMLISTING = YES
#---------------------------------------------------------------------------
# configuration options for the AutoGen Definitions output
#---------------------------------------------------------------------------
GENERATE_AUTOGEN_DEF = NO
#---------------------------------------------------------------------------
# configuration options related to the Perl module output
#---------------------------------------------------------------------------
GENERATE_PERLMOD = NO
PERLMOD_LATEX = NO
PERLMOD_PRETTY = YES
PERLMOD_MAKEVAR_PREFIX =
#---------------------------------------------------------------------------
# Configuration options related to the preprocessor
#---------------------------------------------------------------------------
ENABLE_PREPROCESSING = YES
MACRO_EXPANSION = NO
EXPAND_ONLY_PREDEF = NO
SEARCH_INCLUDES = YES
INCLUDE_PATH =
INCLUDE_FILE_PATTERNS =
PREDEFINED =
EXPAND_AS_DEFINED =
SKIP_FUNCTION_MACROS = YES
#---------------------------------------------------------------------------
# Configuration::additions related to external references
#---------------------------------------------------------------------------
TAGFILES =
GENERATE_TAGFILE =
ALLEXTERNALS = NO
EXTERNAL_GROUPS = YES
PERL_PATH = /usr/bin/perl
#---------------------------------------------------------------------------
# Configuration options related to the dot tool
#---------------------------------------------------------------------------
CLASS_DIAGRAMS = NO
HIDE_UNDOC_RELATIONS = YES
HAVE_DOT = YES
CLASS_GRAPH = NO
COLLABORATION_GRAPH = YES
GROUP_GRAPHS = YES
UML_LOOK = NO
TEMPLATE_RELATIONS = NO
INCLUDE_GRAPH = NO
INCLUDED_BY_GRAPH = NO
CALL_GRAPH = NO
CALLER_GRAPH = NO
GRAPHICAL_HIERARCHY = NO
DIRECTORY_GRAPH = YES
DOT_IMAGE_FORMAT = png
DOT_PATH =
DOTFILE_DIRS =
MAX_DOT_GRAPH_WIDTH = 1024
MAX_DOT_GRAPH_HEIGHT = 1024
MAX_DOT_GRAPH_DEPTH = 1000
DOT_TRANSPARENT = NO
DOT_MULTI_TARGETS = NO
GENERATE_LEGEND = YES
DOT_CLEANUP = YES
#---------------------------------------------------------------------------
# Configuration::additions related to the search engine
#---------------------------------------------------------------------------
SEARCHENGINE = NO
================================================
FILE: LICENSE
================================================
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
================================================
FILE: LICENSE.gpl2
================================================
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
================================================
FILE: LICENSE.gpl3
================================================
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
================================================
FILE: Makefile_en21
================================================
# Makefile for the AVR-Crypto-Lib project
#
# This file is part of the AVR-Crypto-Lib.
# Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
SHELL = sh
include Makefile_sys_conf.inc
include Makefile_en21_conf.inc
include Makefile_main.inc
================================================
FILE: Makefile_en21_conf.inc
================================================
MCU_TARGET = atmega128
F_CPU = 14745600
OPTIMIZE = -Os # -Os
EXTRALINK = xram.o
DEFS = -D$(call uc, $(MCU_TARGET)) -DF_CPU=$(F_CPU)
BOARD_NAME = ethernut2.1
FLASHCMD = /bin/bash openocd_flash.sh #
RESETCMD =
override CFLAGS_A = -MMD -MF$(DEP_DIR)$(patsubst %.o,%.d,$(notdir $(1))) $(DEBUG) $(WARNING) -std=$(CSTD) $(OPTIMIZE) -mmcu=$(MCU_TARGET) $(DEFS)
override CFLAGS = -MMD -MF$(DEP_DIR)$(patsubst %.o,%.d,$(notdir $@)) $(DEBUG) $(WARNING) -std=$(CSTD) $(OPTIMIZE) -mmcu=$(MCU_TARGET) $(DEFS)
override LDFLAGS = -gdwarf-2 -Wl,--section-start,.data=0x801100,--defsym=__heap_end=0x807fff -Wl,-Map,#
override ASFLAGS = -mmcu=$(MCU_TARGET) -Wa,--gdwarf-2
================================================
FILE: Makefile_m644
================================================
# Makefile for the AVR-Crypto-Lib project
#
# This file is part of the AVR-Crypto-Lib.
# Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
SHELL = sh
include Makefile_sys_conf.inc
include Makefile_m644_conf.inc
include Makefile_main.inc
================================================
FILE: Makefile_m644_conf.inc
================================================
MCU_TARGET = atmega644
F_CPU = 20000000
OPTIMIZE = -Os # -Os
EXTRALINK =
DEFS = -D$(call uc, $(MCU_TARGET)) -DF_CPU=$(F_CPU)
BOARD_NAME = pollin_eval_m644
override CFLAGS_A = -MMD -MF$(DEP_DIR)$(patsubst %.o,%.d,$(notdir $(1))) $(DEBUG) $(WARNING) -std=$(CSTD) $(OPTIMIZE) -mmcu=$(MCU_TARGET) $(DEFS)
override CFLAGS = -MMD -MF$(DEP_DIR)$(patsubst %.o,%.d,$(notdir $@)) $(DEBUG) $(WARNING) -std=$(CSTD) $(OPTIMIZE) -mmcu=$(MCU_TARGET) $(DEFS)
override LDFLAGS = -gdwarf-2 -Wl,-Map,
override ASFLAGS = -mmcu=$(MCU_TARGET) -Wa,--gdwarf-2
#PROGRAMMER = avr911
#PROG_PORT = /dev/ttyUSB1
PROGRAMMER = avrispmkII
PROG_PORT = usb
DEFS = -D$(call uc, $(MCU_TARGET)) -DF_CPU=$(F_CPU)
FLASHCMD = avrdude -p $(MCU_TARGET) -P $(PROG_PORT) -c $(PROGRAMMER) -U flash:w:# no space at the end
#FLASHCMD = avrdude -p $(MCU_TARGET) -c usbasp -U flash:w:# no space at the end
RESETCMD = avrdude -p $(MCU_TARGET) -P $(PROG_PORT) -c $(PROGRAMMER)
================================================
FILE: Makefile_main.inc
================================================
# Makefile for the AVR-Crypto-Lib project
#
# This file is part of the AVR-Crypto-Lib.
# Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
BLOCK_CIPHERS :=
STREAM_CIPHERS :=
HASHES :=
MACS :=
PRNGS :=
ENCODINGS :=
SIGNATURE :=
PK_CIPHERS :=
AUX :=
# we use the gnu make standard library
include gmsl
GLOBAL_INCDIR := ./ $(TESTSRC_DIR)
#-------------------------------------------------------------------------------
# inclusion of make stubs
include $(sort $(wildcard mkfiles/*.mk))
default: info
#-------------------------------------------------------------------------------
ALGORITHMS = $(BLOCK_CIPHERS) $(STREAM_CIPHERS) $(HASHES) $(PRNGS) $(MACS) \
$(ENCODINGS) $(SIGNATURE) $(PK_CIPHERS) $(AUX)
ALGORITHMS_OBJ = $(patsubst %,%_OBJ, $(ALGORITHMS))
ALGORITHMS_TESTBIN = $(patsubst %,%_TESTBIN, $(ALGORITHMS))
#-------------------------------------------------------------------------------
# define binary object in $(BIN_DIR)$(ALGO)/<obj>
define Assert_Template
$(1) = $(2)
endef
$(foreach a, $(ALGORITHMS), $(eval $(call Assert_Template, \
$(a)_BINOBJ, \
$(addprefix $(BIN_DIR)$(call lc,$(a))/,$($(a)_OBJ)) \
)))
$(foreach a, $(ALGORITHMS), $(eval $(call Assert_Template, \
$(a)_TESTBINOBJ, \
$(addprefix $(BIN_DIR)$(call lc,$(a))/$(TEST_DIR),$($(a)_TESTBIN)) \
)))
#-------------------------------------------------------------------------------
define GenericTarget_Template
$(1): $(2)
endef
define TargetSource_Template
$(1): $(2)
@mkdir -p $(dir $(1)) $(DEP_DIR)
@echo "[cc]: $(1) <-- $(2)"
@$(CC) $(CFLAGS_A) $(addprefix -I./,$(3)) $(addprefix -D, $(4)) -c -o $(1) $(2)
endef
define TargetSourceList_Template
$(1): $(2)
@mkdir -p $(dir $(1)) $(DEP_DIR)
@echo "[lst]: $(1) <-- $(2)"
@$(CC) $(CFLAGS_A) $(addprefix -I./,$(3)) $(addprefix -D, $(4)) $(LIST_OPT) -c -o /dev/null $(2) > $(1)
endef
# ----------------------------------------------------------------------------
# Function: find_source_file
# Arguments: 1: name of the binary file (.o extension) to search
# 2: list of directorys to search for file
# Returns: Returns paths to source file (mathing the pattern in
# $(SOURCE_PATTERN)
# ----------------------------------------------------------------------------
SOURCE_PATTERN := %.S %.c
find_source_file = $(firstword $(foreach d, $(2), \
$(filter $(SOURCE_PATTERN), \
$(wildcard $(d)$(notdir $(patsubst %.o,%,$1)).*) \
) \
) )
$(foreach a, $(ALGORITHMS), \
$(foreach b, $($(a)_OBJ), \
$(eval $(call TargetSource_Template, \
$(BIN_DIR)$(call lc, $(a))/$(b), \
$(call find_source_file, $(b), $($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR) ),\
$($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR), \
$($(a)_DEF), \
)) \
) \
)
$(foreach a, $(ALGORITHMS), \
$(foreach b, $($(a)_TESTBIN), \
$(eval $(call TargetSource_Template, \
$(BIN_DIR)$(call lc, $(a))/$(TEST_DIR)$(b), \
$(call find_source_file, $(b), $($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR) ),\
$($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR), \
$($(a)_DEF) \
)) \
) \
)
$(foreach a, $(ALGORITHMS), \
$(foreach b, $($(a)_OBJ), \
$(eval $(call TargetSourceList_Template, \
$(LIST_DIR)$(call lc, $(a))/$(patsubst %.o,%.s,$(b)), \
$(call find_source_file, $(b), $($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR) ),\
$($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR), \
$($(a)_DEF), \
)) \
) \
)
EXTRALINK_BINOBJ = $(patsubst %, $(BIN_DIR)%, $(EXTRALINK))
$(foreach a, $(EXTRALINK), \
$(eval $(call TargetSource_Template, \
$(BIN_DIR)$(a), \
$(call find_source_file, $(a), $(GLOBAL_INCDIR) ),\
$($(a)_DIR) $($(a)_INCDIR) $(GLOBAL_INCDIR), \
$($(a)_DEF), \
)) \
)
#-------------------------------------------------------------------------------
define MainTestElf_Template
$(1): $(2) $(3) $(4)
@mkdir -p $(dir $(1))
@echo "[ld]: $(1)"
@$(CC) $(CFLAGS_A) $(LDFLAGS)$(patsubst %.elf,%.map,$(1)) -o \
$(1) \
$(2) $(3) $(EXTRALINK_BINOBJ)\
$(LIBS)
endef
$(foreach a, $(ALGORITHMS), \
$(eval $(call MainTestElf_Template, \
$(BIN_DIR)$(call lc, $(a))/$(TEST_DIR)main-$(call lc, $(a))-test.elf, \
$($(a)_BINOBJ), \
$($(a)_TESTBINOBJ), \
$(EXTRALINK_BINOBJ) \
)) \
)
#-------------------------------------------------------------------------------
all: $(foreach algo, $(ALGORITHMS), $($(algo)_BINOBJ))
#-------------------------------------------------------------------------------
define MakeDir_TEMPLATE
$(1):
@echo [mkdir] $(1)
@mkdir -p $(1)
endef
$(foreach d, DEP_DIR BIN_DIR TESTSRC_DIR TESTLOG_DIR SPEEDLOG_DIR SIZE_DIR LIST_DIR STAT_DIR, $(eval $(call MakeDir_TEMPLATE, \
$($(d)) \
)))
$(foreach algo, $(ALGORITHMS), $(eval $(call MakeDir__TEMPLATE, \
$(BIN_DIR)$(call lc, $(algo))/$(TEST_DIR) \
)))
define TestBin_TEMPLATE
$(1)_TESTBIN: $(2)
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call TestBin_TEMPLATE, \
$(algo), \
$(BIN_DIR)$(call lc, $(algo))/$(TEST_DIR)main-$(call lc, $(algo))-test.hex \
)))
#-------------------------------------------------------------------------------
define Listing_TEMPLATE
$(1)_LIST: $(2)
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call Listing_TEMPLATE, \
$(algo), \
$(foreach obj,$($(algo)_OBJ), $(LIST_DIR)$(call lc, $(algo))/$(obj:.o=.s)) \
)))
#-------------------------------------------------------------------------------
%.hex: %.elf
@echo "[objcopy]: $@"
@$(OBJCOPY) -j .text -j .data -O ihex $< $@
ifdef HASH_TOOL
ifneq ($(HASH_TOOL),)
@echo -n "[$(HASH_TOOL)]: "
@$(HASH_TOOL) $@
endif
endif
#-------------------------------------------------------------------------------
define Flash_Template
$(1)_FLASH: $(2)
@echo "[flash]: $(2)"
@$(FLASHCMD)$(call first,$(2))
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call Flash_Template, \
$(algo), \
$(BIN_DIR)$(call lc, $(algo))/$(TEST_DIR)main-$(call lc, $(algo))-test.hex \
)))
#-------------------------------------------------------------------------------
define Speed_Template
$(1)_SPEED: $(1)_FLASH
@$(RUBY) $(SPEEDTOOL) -c $(SPEEDCMD) -t $(SPEEDLOG_DIR) -a $(call lc, $(1))
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call Speed_Template, \
$(algo), $(algo) \
)))
.PHONY: hash_speed
hash_speed: $(foreach algo, $(HASHES), $(algo)_SPEED)
.PHONY: blockcipher_speed
blockcipher_speed: $(foreach algo, $(BLOCK_CIPHERS), $(algo)_SPEED)
#-------------------------------------------------------------------------------
define Size_Template
$(1): $(2)
@echo "[size] $(3)"
@mkdir -p $(dir $(1))
@$(SIZE) $(2) > $(1)
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call Size_Template, \
$(strip $(SIZE_DIR))$(strip $(call lc, $(algo))).size,$($(algo)_BINOBJ),$(algo) \
)))
define Size_Template
$(1)_SIZE: $(2)
@echo "[size] $(1)"
@mkdir -p $(dir $(strip $(SIZE_DIR))$(strip $(call lc, $(1))).size)
@$(SIZE) $(2) > $(strip $(SIZE_DIR))$(strip $(call lc, $(1))).size
endef
$(foreach algo, $(ALGORITHMS), $(eval $(call GenericTarget_Template, \
$(strip $(algo))_SIZE,$(strip $(SIZE_DIR))$(strip $(call lc, $(algo))).size \
)))
.PHONY: hash_size
hash_size: $(foreach algo, $(HASHES), $(algo)_SIZE)
.PHONY: blockcipher_size
blockcipher_size: $(foreach algo, $(BLOCK_CIPHERS), $(algo)_SIZE)
.PHONY: size
size: $(foreach algo, $(ALGORITHMS), $(algo)_SIZE)
.PHONY: size_clean
size_clean:
rm -vf $(strip $(SIZE_DIR))*.size
#-------------------------------------------------------------------------------
.PHONY: tests
tests: $(foreach a, $(ALGORITHMS), $(a)_TESTBIN)
#-------------------------------------------------------------------------------
define TestRun_Template
$(1)_TESTRUN: $(1)_FLASH
@echo "[reset]"
@sleep 3
@$(RESETCMD)
@sleep 1
@echo "[test]: $(1)"
$(RUBY) $(GET_TEST) $(TESTPORT) $(TESTPORTBAUDR) 8 1 nessie $(TESTLOG_DIR)$(TESTPREFIX) $(2)
endef
$(foreach algo, $(ALGORITHMS),$(eval $(call TestRun_Template, $(algo), $(call lc,$(algo)) )))
all_testrun: $(foreach algo, $(ALGORITHMS), $(algo)_TESTRUN)
#-------------------------------------------------------------------------------
define Obj_Template
$(1)_OBJ: $(2)
endef
$(foreach algo, $(ALGORITHMS), \
$(eval $(call Obj_Template, \
$(algo), \
$($(algo)_BINOBJ)\
))\
)
.PHONY: all
all: cores
.PHONY: reset
reset:
$(RESETCMD)
.PHONY: cores
cores: $(foreach algo, $(ALGORITHMS), $(algo)_OBJ)
.PHONY: blockchiphers
blockciphers: $(foreach algo, $(BLOCK_CIPHERS), $(algo)_OBJ)
.PHONY: streamchiphers
streamciphers: $(foreach algo, $(STREAM_CIPHERS), $(algo)_OBJ)
.PHONY: hashes
hashes: $(foreach algo, $(HASHES), $(algo)_OBJ)
.PHONY: macs
macs: $(foreach algo, $(MACS), $(algo)_OBJ)
.PHONY: prngs
prngs: $(foreach algo, $(PRNGS), $(algo)_OBJ)
.PHONY: encodings
encodings: $(foreach algo, $(ENCODINGS), $(algo)_OBJ)
.PHONY: aux
aux: $(foreach algo, $(AUX), $(algo)_OBJ)
#-------------------------------------------------------------------------------
.PHONY: help
help: info
.PHONY: info
info:
@echo "infos on AVR-Crypto-lib:"
@echo " block ciphers:"
@echo " $(BLOCK_CIPHERS)"
@echo " stream ciphers:"
@echo " $(STREAM_CIPHERS)"
@echo " hash functions:"
@echo " $(HASHES)"
@echo " MAC functions:"
@echo " $(MACS)"
@echo " PRNG functions:"
@echo " $(PRNGS)"
@echo " signature functions:"
@echo " $(SIGNATURE)"
@echo " public key ciphers:"
@echo " $(PK_CIPHERS)"
@echo " encodings:"
@echo " $(ENCODINGS)"
@echo " auxiliary functions:"
@echo " $(AUX)"
@echo " targets:"
@echo " all - all algorithm cores"
@echo " cores - all algorithm cores"
@echo " listings - all algorithm core listings"
@echo " tests - all algorithm test programs"
@echo " size - all algorithm size statistics"
@echo " blockciphers - all blockcipher cores"
@echo " streamciphers - all streamcipher cores"
@echo " hashes - all hash cores"
@echo " macs - all MAC cores"
@echo " prngs - all PRNG cores"
@echo " all_testrun - testrun all algorithms"
@echo " hash_size - measure size of all hash functions"
@echo " hash_speed - measure performance of all hash functions"
@echo " blockcipher_size - measure size of all blockciphers"
@echo " blockcipher_speed - measure performance of all blockciphers"
@echo " docu - build doxygen documentation"
@echo " clean - remove a lot of builded files"
@echo " depclean - also remove dependency files"
@echo " *_TESTBIN - build test program"
@echo " *_TESTRUN - run nessie test"
@echo " *_OBJ - build algorithm core"
@echo " *_FLASH - flash test program"
@echo " *_LIST - build assembler listing"
#-------------------------------------------------------------------------------
.PHONY: clean
clean:
rm -rf $(BIN_DIR)*
.PHONY: depclean
depclean: clean
rm -f $(DEP_DIR)*.d
#-------------------------------------------------------------------------------
# dependency inclusion
#
DEPS := $(wildcard $(DEP_DIR)*.d)
ifneq ($(DEPS),)
include $(DEPS)
endif
================================================
FILE: Makefile_sys_conf.inc
================================================
MAKE_DEBUG = 1
DEBUG = -gdwarf-2
WARNING = -pedantic -Wall -Werror -Wstrict-prototypes
PROGRAMMER = jtagmkII
PROG_PORT = usb
FLASHCMD = avrdude -p $(MCU_TARGET) -P $(PROG_PORT) -c $(PROGRAMMER) -U flash:w:# no space at the end
#FLASHCMD = avrdude -p $(MCU_TARGET) -c usbasp -U flash:w:# no space at the end
#RESETCMD = avrdude -p $(MCU_TARGET) -P $(PROG_PORT) -c $(PROGRAMMER)
RESETCMD = avarice -2 -R -j usb
DEP_DIR = deps/$(BOARD_NAME)/#
TEST_DIR = test/#
BIN_DIR = bin/$(BOARD_NAME)/#
TESTSRC_DIR = test_src/
#uisp -dprog=bsd -dlpt=/dev/parport1 --upload if=$(PRG).hex
ERASECMD =
TESTPORT = /dev/ttyUSB0
TESTPORTBAUDR = 115200
TESTLOG_DIR = testlog/#
TESTPREFIX = nessie-
SPEEDTOOL = host/get_performance.rb
SPEEDLOG_DIR = speed_log/$(BOARD_NAME)/#
SPEEDPREFIX =
SPEEDCMD = performance
SIZE_DIR = size_log/$(BOARD_NAME)/#
LIST_DIR = listings/$(BOARD_NAME)/#
LIST_OPT = -Wa,-adghlms -g
STAT_DIR = stats/$(BOARD_NAME)/#
CC = avr-gcc
CSTD = gnu99
SIZESTAT_FILE = sizestats.txt
OBJCOPY = avr-objcopy
OBJDUMP = avr-objdump
SIZE = avr-size
READELF = readelf
HASH_TOOL = sha256sum
RUBY = ruby
GET_TEST = host/get_test.rb
MAKE = make
MAKE2GRAPH = ~/bin/make2graph.rb
TWOPI = twopi
================================================
FILE: USAGE.blockciphers
================================================
===================================
= Usage of blockciphers =
===================================
Author: Daniel Otte
email: daniel.otte@rub.de
0. Foreword
This file will describe how to use the blockcipher implementations provided by
this library. It will not only show how to call the cryptographic functions
but also discuss a little how to build security mechanisms from that.
So you will also be introduced to the basic "modes of operation".
1. What a blockcipher does
A blockcipher is a algorithm which turn an input of fixed length into an
output of the same length (enciphering or encrypting). The transformation is
specified by a key which has to be of a fixed length, or a length of a given
set or range.
Generally there is also an algorithm which turns the output back to the
previous input (deciphering or decrypting) when supplied with te same key.
1.1. high frequent parameters:
block size: 64 bits, 128 bits
key size: 64 bits, 80 bits, 128 bits, 192 bits, 256 bits
(note that some blockciphers use different sizes)
2. Parts of a blockcipher
* encryption algorithm
* decryption algorithm
* mostly a set of subkeys
* mostly a keyschedule which generates the subkeys from the supplied key.
As we can see here a blockcipher normally has an algorithm besides the
encryption and decryption algorithm, which we call keyschedule.
Mostly the encryption and decryption algorithm consist of multiple rounds,
where each round (and sometimes between rounds) subkeys are needed to modify
the data. This subkeys are generated by the keyschedule and stored in a state
or context variable.
Note that not all algorithms need a pregenerated context, sometimes it is easy
to generate the subkeys "on the fly" so there is not always the need of a
context variable.
3. blockcipher API
The API is not always consistent due to the fact that we tried to optimize the
code for size (flash, heap and stack) and speed (runtime of the different
components).
Generally the API of the implemented blockciphers consists of:
*_init function, which implements the keyschedule
*_enc function, which implements the encryption algorithm
*_dec function, which implements the decryption algorithm
*_free function, which frees memory allocated for the keyschedule
*_ctx_t context type, which can contain a keyschedule and other information
3.1 look at the prototypes
Generally the prototypes (defined in the *.h files) will tell you what
parameter means what.
3.1.2 sizes in bits and bytes
Working with cryptographical functions involves working with different
lengths. Some times you want to know it in bits and sometimes in bytes. To
reduce frustration and to avoid bugs we suffix a length parameter with either
_b or _B depending on the meaning. _b means in bits and _B means in bytes
(big b big word).
3.2. *_init function
The *_init function generally takes a pointer to the key as first parameter.
For ciphers where the keysize is not fixed the second parameter gives the
keysize (in bits regularly) and the last parameter points to the context
variable to fill.
For some ciphers there are additional parameters like the number of rounds,
these parameters generally occur before the context pointer.
3.3. *_enc and *_dec functions
The encryption and decryption function of a specific algorithm normally do not
differ in their parameters. Generally these functions take a pointer to the
block to operate on. Some ciphers allow to specify two blocks, where the first
one will be written to and the second will contain the source block. The two
blocks may overlap or be the same. The last parameter specifies either the key
direct (with a pointer to it) or is a pointer to a context created with the
*_init function.
3.4. *_free function
A *_free function is only provided where needed (so most ciphers do not have
it). It is used to free memory dynamically allocated by the *_init function.
4. modes of operation
The usage of cryptographic algorithms is usually motivated by the intend to
fight potential threads. Blockciphers are generally good building blocks.
There are different attacks to the cipher itself, but this is work to be done
by cryptographers, but what stays up to you is using this building blocks in a
secure manner.
You may read http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation to
learn more.
4.1. ECB (electronic codebook mode)
Electronic codebook mode is the simplest mode of operation and its usages is
generally not suggested. In ECB-mode a message which is to encrypt is simply
split up in blocks and each block gets independently encrypted. The problem
with this mode is that, for example same data produces the same ciphertext,
which may also allows an attack to inject selected data.
+----+ +----+ +----+ +----+ +----+ +----+
| P1 | | P2 | | P3 | | C1 | | C2 | | C3 |
+----+ +----+ +----+ +----+ +----+ +----+
| | | | | |
V V V V V V
o---o o---o o---o o---o o---o o---o
| E | | E | | E | | D | | D | | D |
o---o o---o o---o o---o o---o o---o
| | | | | |
V V V V V V
+----+ +----+ +----+ +----+ +----+ +----+
| C1 | | C2 | | C3 | | P1 | | P2 | | P3 |
+----+ +----+ +----+ +----+ +----+ +----+
4.2. CBC (chipher-block-chaining mode)
CBC-mode is a more advanced mode of operation. It solves most problems of
ECB-mode. It again works by split ing up the message into blocks and
introducing a initialization vector (IV) at the beginning. The IV should be
randomly generated and is not required to be kept secret. The plaintext of
each block is XORed with the ciphertext of the previous block (the first block
is XORed with the IV) and then gets encrypted producing the ciphertext block.
For decryption of a block simply decrypt the block an XOR it with the previous
ciphertext block (or the IV in the case of the first block).
CBC-mode has some properties which make it quite useless for some application.
For example if you want to store a large amount of data, and you want to make
a change in one block you would have to decrypt and re-encrypt all following
blocks. If you have such a case read more about block cipher modes.
The wikipedia article http://en.wikipedia.org/wiki/Block_cipher_modes_of_
operation#Other_modes_and_other_cryptographic_primitives would make a good
start.
+----+ +----+ +----+ +----+ +----+ +----+ +----+ +----+
| IV | | P1 | | P2 | | P3 | | IV | | C1 | | C2 | | C3 |
+----+ +----+ +----+ +----+ +----+ +----+ +----+ +----+
| | | | | | | |
+------> X +--> X +--> X | +---+ +---+ |
| | | | | | | | | | | |
| V | V | V | V | V | V
| o---o | o---o | o---o | o---o | o---o | o---o
| | E | | | E | | | E | | | D | | | D | | | D |
| o---o | o---o | o---o | o---o | o---o | o---o
| | | | | | | | | | | |
| +---+ +---+ + +------> X +--> X +--> X
| | | | | | | |
V V V V V V V V
+----+ +----+ +----+ +----+ +----+ +----+ +----+ +----+
| IV | | C1 | | C2 | | C3 | | IV | | P1 | | P2 | | P3 |
+----+ +----+ +----+ +----+ +----+ +----+ +----+ +----+
4.3. stream cipher modes
The following modes of operation turn the blockcipher in something better
described as stream cipher. So you may consider reading USAGE.streamciphers
or anything else about streamcipher if you wish to use this modes.
4.3.1. CTR (counter mode)
This is quite simple. You use a counter which gets encrypted to produce a
key stream. This key stream may be used to encrypt data by XOR-ing the
plaintext with the key stream. Decrypting is exactly the same then encrypting
BE WARNED, an attacker might flip a bit in the ciphertext and the
corresponding bit in the plaintext gets flipped.
+---------+ o--o +---------+ o--o +---------+ o--o +---------+
| counter |-|+1|->| counter |-|+1|->| counter |-|+1|->| counter |
+---------+ o--o +---------+ o--o +---------+ o--o +---------+
| | | |
V V V V
o---o o---o o---o o---o
| E | | E | | E | | E |
o---o o---o o---o o---o
| | | |
V V V V
+--------+ +--------+ +--------+ +--------+
| key | | key | | key | | key |
| stream | | stream | | stream | | stream |
+--------+ +--------+ +--------+ +--------+
4.3.2 OFB (output-feedback mode)
OFB-mode is much like CTR-mode. In fact the only difference is that you do not
increment a counter, but use the output of the encryption operation before as
input.
+-------+ +-------+ +-------+
| IV | +---->| input | +---->| input |
+-------+ | +-------+ | +-------+
| | | | |
V | V | V
o---o | o---o | o---o
| E | | | E | | | E |
o---o | o---o | o---o
| | | | |
V | V | V
+--------+ | +--------+ | +--------+
| output |--+ | output |--+ | output |
+--------+ +--------+ +--------+
| | |
V V V
+--------+ +--------+ +--------+
| key | | key | | key |
| stream | | stream | | stream |
+--------+ +--------+ +--------+
4.3.2 CFB (cipher-feedback mode)
CFB-mode looks much like OFB-mode, but it has a lot of different properties.
Instead of using the previous output block as input the resulting ciphertext
is used as input. Due to the fact that not the entire output-block needs to be
used, the ciphertext does not form the entire input block for the next
operation but it is shifted in the input block.
The resulting cipher is something known as self synchronizing stream cipher.
This means that a manipulation of a single bit in the ciphertext will result
in this bit flipped in the corresponding plaintext but the following blocks
will be "destroyed" until the cipher "heald" itself, meaning the manipulated
ciphertext block gets shift out of the input block.
+-------+ +-------+ +-------+
| IV | +--------->>| input | +--------->>| input |
+-------+ | +-------+ | +-------+
| | | | |
V | V | V
o---o | o---o | o---o
| E | | | E | | | E |
o---o | o---o | o---o
| | | | |
V | V | V
+--------+ | +--------+ | +--------+
| output | | | output | | | output |
+--------+ | +--------+ | +--------+
| | | | |
+----+ V +----+ +----+ V +----+ +----+ V +----+
| P1 |-->X-->| C1 | | P2 |-->X-->| C2 | | P3 |-->X-->| C3 |
+----+ +----+ +----+ +----+ +----+ +----+
+-------------+ +-------------+
| +-------+ | | +-------+ | +-------+
| | IV | +---------|>>| input | +-------->>| input |
| +-------+ | +-------+ +-------+
| | | | |
| V | V V
| o---o | o---o o---o
| | E | | | E | | E |
| o---o | o---o o---o
| | | | |
| V | V V
| +--------+ | +--------+ +--------+
| | output | | | output | | output |
| +--------+ | +--------+ +--------+
| | | | |
+----+ V +----+ +----+ V +----+ +----+ V +----+
| C1 |-->X-->| P1 | | C2 |-->X-->| P2 | | C3 |-->X-->| P3 |
+----+ +----+ +----+ +----+ +----+ +----+
================================================
FILE: USAGE.hashfunctions
================================================
===================================
= Usage of hash functions =
===================================
Author: Daniel Otte
email: daniel.otte@rub.de
0. Foreword
This file will describe how to use the hash function implementations provided
by this library.
1. What a hash function does
A hash function is an algorithm to map an arbitrary long message (in the form
of a bit string) to a fixed length message digest or hash value.
The hash function aims to be collision free, which means that it is not
practicable to find two messages with the same hash value (although this
collision must exist). Also it should not be practicable to construct a
message which maps to a given hash value.
1.1. high frequent parameters:
block size: 512 bits
hash value size: 128 bits, 160 bits, 224 bits, 256 bits, 384 bits, 512 bits
2. Parts of a hash function
* initialization function
* compression algorithm
* finalization function
3. hash function API
The API is not always consistent due to the fact that we tried to optimize the
code for size (flash, heap and stack) and speed (runtime of the different
components).
Generally the API of the implemented block ciphers consists of:
*_init function, which implements the initialisation of the context
*_nextBlock function, which implements the compression algorithm
*_lastBlock function, which implements the the padding algorithm
*_ctx2hash function, which turns a context into an actual hash value
*_ctx_t context type, which can contains the state of a hashing process
3.1 look at the prototypes
Generally the prototypes (defined in the *.h files) will tell you what
parameter means what.
3.1.2 sizes in bits and bytes
Working with cryptographic functions involves working with different
lengths. Some times you want to know it in bits and sometimes in bytes. To
reduce frustration and to avoid bugs we suffix a length parameter with either
_b or _B depending on the meaning. _b means in bits and _B means in bytes
(big b big word).
3.2. *_init function
The *_init function generally takes a pointer to the context as parameter.
This function initializes the context with algorithm specific values.
3.3. *_nextBlock function
The *_nextBlock function is the core of each hash function. It updates the hash
state with a given message block. So this function uses a context pointer and
a message pointer as parameters. The size of a message block is fixed for each
hash function (mostly 512 bit). For the last block of a messages which may be
smaller than the blocksize you have to use the *_lastBlock function described
below.
3.4 *_lastBlock function
The *_lastBlock function finalizes the context with the last bits of a
message. Since the last block is not required to have the blocksize you have
to specify the length of the last block (normally in bits). This function
performs the padding and final processing.
3.5. *_ctx2hash function
The *_ctx2hash function turns a given hash context into an actual hash value.
If multiple sized hash value may be created from a context it is necessary to
give the the size of the hash value as parameter.
================================================
FILE: USAGE.streamciphers
================================================
====================================
= Usage of streamciphers =
====================================
Author: Daniel Otte
email: daniel.otte@rub.de
0. Foreword
This file will describe how to use the streamcipher implementations provided
by this library. It will not only show how to call the cryptographic functions
but also discuss a little how to build security mechanisms from that.
1. What a streamcipher does
A streamcipher normally generates a deterministic, random looking stream of
bits, known as keystream. For encryption purpose this keystream is XORed with
the data stream. So decryption is exactly the same as encryption. The
data-stream is XORed with the keystream giving the plaintext. So both sides
need exactly the same streamcipher in the same state.
1.1. high frequent parameters:
output-size: 8 bit, 1 bit
keysize: 64 bit, 80 bit, 128 bit
IVsize: 64 bit
2. Parts of a streamcipher
* generation algorithm
* initialization algorithm
* state
As we can see all streamciphers seem to utilize an internal state which
determines the output. This state is initialized by the initialization
algorithm with a key and an IV (initialization vector). It is very important
for security that _never_ the same key with the same IV is used again. The
IV is not required to be kept secret.
3. streamcipher API
The API is not always consistent due to the fact that we tried to optimize the
code for size (flash, heap and stack) and speed (runtime of the different
components).
Generally the API of the implemented streamciphers consists of:
*_init function, which implements the initialization
*_gen function, which implements the streamcipher algorithm and generates a
keystream output
*_ctx_t context type, which contains internal state information
3.1 look at the prototypes
Generally the prototypes (defined in the *.h files) will tell you what
parameter means what.
3.1.2 sizes in bits and bytes
Working with cryptographical functions involves working with different lengths.
Some times you want to know it in bits and sometimes in bytes. To reduce
frustration and to avoid bugs we suffix a length parameter with either _b or
_B depending on the meaning. _b means in bits and _B means in bytes
(big b big word).
3.2. *_init function
The *_init function generally takes a pointer to the key as first parameter.
For ciphers where the keysize is not fixed the second parameter gives the
keysize (in bits regularly) followed by a pointer to the IV and a length
parameter for not fixed IV sizes (both are omitted if the algorithm does not
specify IV handling, in this case a part of the key should be used as IV).
The last parameter points to the context variable to fill.
3.3. *_gen function
The *_gen function updates the internal state to which a pointer is given as
parameter and returns a fixed length part of the keystream as return value.
================================================
FILE: __gmsl
================================================
# ----------------------------------------------------------------------------
#
# GNU Make Standard Library (GMSL)
#
# A library of functions to be used with GNU Make's $(call) that
# provides functionality not available in standard GNU Make.
#
# Copyright (c) 2005-2007 John Graham-Cumming
#
# This file is part of GMSL
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
#
# Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# Neither the name of the John Graham-Cumming nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
# FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
# COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
# ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
# ----------------------------------------------------------------------------
# This is the GNU Make Standard Library version number as a list with
# three items: major, minor, revision
gmsl_version := 1 0 9
# Used to output warnings and error from the library, it's possible to
# disable any warnings or errors by overriding these definitions
# manually or by setting GMSL_NO_WARNINGS or GMSL_NO_ERRORS
__gmsl_name := GNU Make Standard Library
__gmsl_warning = $(warning $(__gmsl_name): $1)
__gmsl_error = $(error $(__gmsl_name): $1)
ifdef GMSL_NO_WARNINGS
__gmsl_warning :=
endif
ifdef GMSL_NO_ERRORS
__gmsl_error :=
endif
# If GMSL_TRACE is enabled then calls to the library functions are
# traced to stdout using warning messages with their arguments
ifdef GMSL_TRACE
__gmsl_tr1 = $(warning $0('$1'))
__gmsl_tr2 = $(warning $0('$1','$2'))
__gmsl_tr3 = $(warning $0('$1','$2','$3'))
else
__gmsl_tr1 :=
__gmsl_tr2 :=
__gmsl_tr3 :=
endif
# Figure out whether we have $(eval) or not (GNU Make 3.80 and above)
# if we do not then output a warning message, if we do then some
# functions will be enabled.
__gmsl_have_eval := $(false)
__gmsl_ignore := $(eval __gmsl_have_eval := $(true))
# See if we have $(lastword) (GNU Make 3.81 and above)
__gmsl_have_lastword := $(lastword $(false) $(true))
# See if we have native or and and (GNU Make 3.81 and above)
__gmsl_have_or := $(if $(filter-out undefined, \
$(origin or)),$(call or,$(true),$(false)))
__gmsl_have_and := $(if $(filter-out undefined, \
$(origin and)),$(call and,$(true),$(true)))
ifneq ($(__gmsl_have_eval),$(true))
$(call __gmsl_warning,GNU Make $(MAKE_VERSION) does not support $$(eval): some functions disabled)
endif
# ----------------------------------------------------------------------------
# Function: gmsl_compatible
# Arguments: List containing the desired library version number (maj min rev)
# Returns: $(true) if this version of the library is compatible
# with the requested version number, otherwise $(false)
# ----------------------------------------------------------------------------
gmsl_compatible = $(strip \
$(if $(call gt,$(word 1,$1),$(word 1,$(gmsl_version))), \
$(false), \
$(if $(call lt,$(word 1,$1),$(word 1,$(gmsl_version))), \
$(true), \
$(if $(call gt,$(word 2,$1),$(word 2,$(gmsl_version))), \
$(false), \
$(if $(call lt,$(word 2,$1),$(word 2,$(gmsl_version))), \
$(true), \
$(call lte,$(word 3,$1),$(word 3,$(gmsl_version))))))))
# ###########################################################################
# LOGICAL OPERATORS
# ###########################################################################
# not is defined in gmsl
# ----------------------------------------------------------------------------
# Function: and
# Arguments: Two boolean values
# Returns: Returns $(true) if both of the booleans are true
# ----------------------------------------------------------------------------
ifneq ($(__gmsl_have_and),$(true))
and = $(__gmsl_tr2)$(if $1,$(if $2,$(true),$(false)),$(false))
endif
# ----------------------------------------------------------------------------
# Function: or
# Arguments: Two boolean values
# Returns: Returns $(true) if either of the booleans is true
# ----------------------------------------------------------------------------
ifneq ($(__gmsl_have_or),$(true))
or = $(__gmsl_tr2)$(if $1$2,$(true),$(false))
endif
# ----------------------------------------------------------------------------
# Function: xor
# Arguments: Two boolean values
# Returns: Returns $(true) if exactly one of the booleans is true
# ----------------------------------------------------------------------------
xor = $(__gmsl_tr2)$(if $1,$(if $2,$(false),$(true)),$(if $2,$(true),$(false)))
# ----------------------------------------------------------------------------
# Function: nand
# Arguments: Two boolean values
# Returns: Returns value of 'not and'
# ----------------------------------------------------------------------------
nand = $(__gmsl_tr2)$(if $1,$(if $2,$(false),$(true)),$(true))
# ----------------------------------------------------------------------------
# Function: nor
# Arguments: Two boolean values
# Returns: Returns value of 'not or'
# ----------------------------------------------------------------------------
nor = $(__gmsl_tr2)$(if $1$2,$(false),$(true))
# ----------------------------------------------------------------------------
# Function: xnor
# Arguments: Two boolean values
# Returns: Returns value of 'not xor'
# ----------------------------------------------------------------------------
xnor =$(__gmsl_tr2)$(if $1,$(if $2,$(true),$(false)),$(if $2,$(false),$(true)))
# ###########################################################################
# LIST MANIPULATION FUNCTIONS
# ###########################################################################
# ----------------------------------------------------------------------------
# Function: first (same as LISP's car, or head)
# Arguments: 1: A list
# Returns: Returns the first element of a list
# ----------------------------------------------------------------------------
first = $(__gmsl_tr1)$(firstword $1)
# ----------------------------------------------------------------------------
# Function: last
# Arguments: 1: A list
# Returns: Returns the last element of a list
# ----------------------------------------------------------------------------
ifeq ($(__gmsl_have_lastword),$(true))
last = $(__gmsl_tr1)$(lastword $1)
else
last = $(__gmsl_tr1)$(if $1,$(word $(words $1),$1))
endif
# ----------------------------------------------------------------------------
# Function: rest (same as LISP's cdr, or tail)
# Arguments: 1: A list
# Returns: Returns the list with the first element removed
# ----------------------------------------------------------------------------
rest = $(__gmsl_tr1)$(wordlist 2,$(words $1),$1)
# ----------------------------------------------------------------------------
# Function: chop
# Arguments: 1: A list
# Returns: Returns the list with the last element removed
# ----------------------------------------------------------------------------
chop = $(__gmsl_tr1)$(wordlist 2,$(words $1),x $1)
# ----------------------------
gitextract_lajz5270/
├── COPYING
├── COPYING.gpl2
├── COPYING.gpl3
├── Doxyfile
├── LICENSE
├── LICENSE.gpl2
├── LICENSE.gpl3
├── Makefile_en21
├── Makefile_en21_conf.inc
├── Makefile_m644
├── Makefile_m644_conf.inc
├── Makefile_main.inc
├── Makefile_sys_conf.inc
├── USAGE.blockciphers
├── USAGE.hashfunctions
├── USAGE.streamciphers
├── __gmsl
├── a51/
│ ├── A5_1.c
│ └── A5_1.h
├── aes/
│ ├── aes.h
│ ├── aes128_dec.c
│ ├── aes128_dec.h
│ ├── aes128_enc.c
│ ├── aes128_enc.h
│ ├── aes192_dec.c
│ ├── aes192_dec.h
│ ├── aes192_enc.c
│ ├── aes192_enc.h
│ ├── aes256_dec.c
│ ├── aes256_dec.h
│ ├── aes256_enc.c
│ ├── aes256_enc.h
│ ├── aes_dec-asm.S
│ ├── aes_dec-asm_faster.S
│ ├── aes_dec.c
│ ├── aes_dec.h
│ ├── aes_enc-asm.S
│ ├── aes_enc.c
│ ├── aes_enc.h
│ ├── aes_invsbox-asm.S
│ ├── aes_invsbox.c
│ ├── aes_invsbox.h
│ ├── aes_keyschedule-asm.S
│ ├── aes_keyschedule.c
│ ├── aes_keyschedule.h
│ ├── aes_sbox-asm.S
│ ├── aes_sbox.c
│ ├── aes_sbox.h
│ └── aes_types.h
├── arcfour/
│ ├── arcfour-asm.S
│ ├── arcfour.c
│ └── arcfour.h
├── avr-asm-macros.S
├── avr-makefile.inc
├── base64/
│ ├── base64_dec.c
│ ├── base64_dec.h
│ ├── base64_enc.c
│ └── base64_enc.h
├── bcal/
│ ├── bcal-basic.c
│ ├── bcal-basic.h
│ ├── bcal-cbc.c
│ ├── bcal-cbc.h
│ ├── bcal-cfb_bit.c
│ ├── bcal-cfb_bit.h
│ ├── bcal-cfb_byte.c
│ ├── bcal-cfb_byte.h
│ ├── bcal-cmac.c
│ ├── bcal-cmac.h
│ ├── bcal-ctr.c
│ ├── bcal-ctr.h
│ ├── bcal-eax.c
│ ├── bcal-eax.h
│ ├── bcal-nessie.c
│ ├── bcal-nessie.h
│ ├── bcal-ofb.c
│ ├── bcal-ofb.h
│ ├── bcal-performance.c
│ ├── bcal-performance.h
│ ├── bcal_aes128.c
│ ├── bcal_aes128.h
│ ├── bcal_aes192.c
│ ├── bcal_aes192.h
│ ├── bcal_aes256.c
│ ├── bcal_aes256.h
│ ├── bcal_camellia128.c
│ ├── bcal_camellia128.h
│ ├── bcal_cast5.c
│ ├── bcal_cast5.h
│ ├── bcal_cast6.c
│ ├── bcal_cast6.h
│ ├── bcal_cscipher.c
│ ├── bcal_cscipher.h
│ ├── bcal_des.c
│ ├── bcal_des.h
│ ├── bcal_khazad.c
│ ├── bcal_khazad.h
│ ├── bcal_noekeon.c
│ ├── bcal_noekeon.h
│ ├── bcal_present128.c
│ ├── bcal_present128.h
│ ├── bcal_present80.c
│ ├── bcal_present80.h
│ ├── bcal_rc5.c
│ ├── bcal_rc5.h
│ ├── bcal_rc6.c
│ ├── bcal_rc6.h
│ ├── bcal_seed.c
│ ├── bcal_seed.h
│ ├── bcal_serpent.c
│ ├── bcal_serpent.h
│ ├── bcal_skipjack.c
│ ├── bcal_skipjack.h
│ ├── bcal_tdes.c
│ ├── bcal_tdes.h
│ ├── bcal_tdes2.c
│ ├── bcal_tdes2.h
│ ├── bcal_threefish1024.c
│ ├── bcal_threefish1024.h
│ ├── bcal_threefish256.c
│ ├── bcal_threefish256.h
│ ├── bcal_threefish512.c
│ ├── bcal_threefish512.h
│ ├── bcal_xtea.c
│ ├── bcal_xtea.h
│ └── mov1.sed
├── bigint/
│ ├── bigint-stub.c
│ ├── bigint.c
│ ├── bigint.h
│ ├── bigint_add_u.S
│ ├── bigint_adjust.S
│ ├── bigint_asm.S
│ ├── bigint_io.c
│ └── bigint_io.h
├── blake/
│ ├── blake_common.c
│ ├── blake_common.h
│ ├── blake_large.c
│ ├── blake_large.h
│ ├── blake_small.c
│ └── blake_small.h
├── blockcipher_descriptor.h
├── bmw/
│ ├── bmw_224-tinyasm.S
│ ├── bmw_256-tinyasm.S
│ ├── bmw_large.c
│ ├── bmw_large.h
│ ├── bmw_small-asm.S
│ ├── bmw_small-tinyasm.S
│ ├── bmw_small.c
│ ├── bmw_small.h
│ └── f0-opt-table.txt
├── camellia/
│ ├── camellia-asm.S
│ ├── camellia.h
│ ├── camellia128-stub.c
│ └── camellia_C.c
├── cast5/
│ ├── cast5-sbox.c
│ ├── cast5-sbox.h
│ ├── cast5.c
│ └── cast5.h
├── cast6/
│ ├── cast6-sbox.c
│ ├── cast6-sbox.h
│ ├── cast6.c
│ └── cast6.h
├── cscipher/
│ ├── cscipher.h
│ ├── cscipher_sbox.c
│ ├── cscipher_sbox.h
│ ├── cscipher_small.c
│ ├── cscipher_tiny_asm.S
│ └── sbox_check.rb
├── cubehash/
│ ├── cubehash.c
│ ├── cubehash.h
│ ├── cubehash_rotates.S
│ ├── cubehash_rotates.h
│ ├── xchg.S
│ └── xchg.h
├── debug.h
├── des/
│ ├── des.c
│ └── des.h
├── doc/
│ ├── acl-guide.texi
│ ├── acl_blockciphers.texi
│ ├── acl_hashes.texi
│ ├── acl_keysizes.texi
│ └── acl_streamciphers.texi
├── dsa/
│ ├── dsa.h
│ ├── dsa_key_blob.c
│ ├── dsa_key_blob.h
│ ├── dsa_sign.c
│ └── dsa_verify.c
├── ecdsa/
│ ├── ecc.h
│ ├── ecc_chudnovsky.c
│ ├── ecdsa.h
│ ├── ecdsa_sign.c
│ ├── ecdsa_sign.h
│ ├── ecdsa_verify.c
│ ├── nist_p192.c
│ ├── nist_p192.h
│ ├── random_dummy.c
│ └── random_dummy.h
├── echo/
│ ├── aes_enc_round-asm.S
│ ├── aes_enc_round.h
│ ├── echo.c
│ └── echo.h
├── entropium/
│ ├── entropium.c
│ └── entropium.h
├── gf256mul/
│ ├── gf256mul.S
│ └── gf256mul.h
├── gmsl
├── gmsl-tests
├── grain/
│ ├── grain.c
│ └── grain.h
├── groestl/
│ ├── groestl_large.c
│ ├── groestl_large.h
│ ├── groestl_small.c
│ └── groestl_small.h
├── hashfunction_descriptor.h
├── hfal/
│ ├── hfal-basic.c
│ ├── hfal-basic.h
│ ├── hfal-hmac.c
│ ├── hfal-hmac.h
│ ├── hfal-nessie.c
│ ├── hfal-nessie.h
│ ├── hfal-performance.c
│ ├── hfal-performance.h
│ ├── hfal-test.c
│ ├── hfal-test.h
│ ├── hfal_blake_large.c
│ ├── hfal_blake_large.h
│ ├── hfal_blake_small.c
│ ├── hfal_blake_small.h
│ ├── hfal_bmw_large.c
│ ├── hfal_bmw_large.h
│ ├── hfal_bmw_small.c
│ ├── hfal_bmw_small.h
│ ├── hfal_cubehash.c
│ ├── hfal_cubehash.h
│ ├── hfal_echo.c
│ ├── hfal_echo.h
│ ├── hfal_groestl_large.c
│ ├── hfal_groestl_large.h
│ ├── hfal_groestl_small.c
│ ├── hfal_groestl_small.h
│ ├── hfal_jh.c
│ ├── hfal_jh.h
│ ├── hfal_keccak.c
│ ├── hfal_keccak.h
│ ├── hfal_md5.c
│ ├── hfal_md5.h
│ ├── hfal_sha1.c
│ ├── hfal_sha1.h
│ ├── hfal_sha224.c
│ ├── hfal_sha224.h
│ ├── hfal_sha256.c
│ ├── hfal_sha256.h
│ ├── hfal_sha384.c
│ ├── hfal_sha384.h
│ ├── hfal_sha512.c
│ ├── hfal_sha512.h
│ ├── hfal_shabal.c
│ ├── hfal_shabal.h
│ ├── hfal_skein1024.c
│ ├── hfal_skein1024.h
│ ├── hfal_skein256.c
│ ├── hfal_skein256.h
│ ├── hfal_skein512.c
│ ├── hfal_skein512.h
│ ├── hfal_twister224.c
│ ├── hfal_twister224.h
│ ├── hfal_twister256.c
│ ├── hfal_twister256.h
│ ├── hfal_twister384.c
│ ├── hfal_twister384.h
│ ├── hfal_twister512.c
│ ├── hfal_twister512.h
│ ├── hfal_whirlpool.c
│ ├── hfal_whirlpool.h
│ ├── hfal_whirlpool_0.c
│ ├── hfal_whirlpool_0.h
│ ├── hfal_whirlpool_t.c
│ └── hfal_whirlpool_t.h
├── hmac-md5/
│ ├── hmac-md5.c
│ └── hmac-md5.h
├── hmac-sha1/
│ ├── hmac-sha1.c
│ └── hmac-sha1.h
├── hmac-sha256/
│ ├── hmac-sha256.c
│ └── hmac-sha256.h
├── host/
│ ├── bigint_test.rb
│ ├── cmacvs_test.rb
│ ├── data2wiki.rb
│ ├── fix-wiki-size.rb
│ ├── get_performance.rb
│ ├── get_test.rb
│ ├── gf256_table_gen.c
│ ├── gf256mul.c
│ ├── nessie_check.rb
│ ├── optimize_shift.rb
│ ├── rsa_pkcs1v15_check.rb
│ ├── shavs_test2.rb
│ ├── sumsize.rb
│ └── threefish_helper.rb
├── jh/
│ ├── jh_simple.h
│ ├── jh_simple_aux.c
│ ├── jh_simple_small_core.c
│ ├── jh_simple_speed_core.c
│ ├── jh_tablegen.rb
│ ├── jh_tables.c
│ └── jh_tables.h
├── keccak/
│ ├── keccak-asm.S
│ ├── keccak.c
│ ├── keccak.h
│ ├── rotate64.S
│ └── rotate64.h
├── keysize_descriptor.c
├── keysize_descriptor.h
├── khazad/
│ ├── khazad.c
│ └── khazad.h
├── main.dox
├── md5/
│ ├── md5-asm.S
│ ├── md5.c
│ ├── md5.h
│ ├── md5_sbox.c
│ └── md5_sbox.h
├── memxor/
│ ├── memxor.S
│ ├── memxor.h
│ ├── memxor_c.c
│ └── memxor_p.S
├── mgf1/
│ ├── mgf1.c
│ └── mgf1.h
├── mickey128/
│ ├── mickey128.c
│ └── mickey128.h
├── mkfiles/
│ ├── 001_bcal_std.mk
│ ├── 001_cli_std.mk
│ ├── 001_hfal_std.mk
│ ├── 001_scal_std.mk
│ ├── a5_1.mk
│ ├── aes.mk
│ ├── aes_asm_faster.mk
│ ├── aes_c.mk
│ ├── arcfour.mk
│ ├── arcfour_c.mk
│ ├── base64.mk
│ ├── bigint.mk
│ ├── blake_c.mk
│ ├── bmw.mk
│ ├── bmw_c.mk
│ ├── bmw_tiny.mk
│ ├── bmw_tiny_sep.mk
│ ├── camellia.mk
│ ├── camellia_c.mk
│ ├── cast5.mk
│ ├── cast6.mk
│ ├── cscipher_small_c.mk
│ ├── cscipher_tiny.mk
│ ├── cscipher_tiny_c.mk
│ ├── cubehash_c.mk
│ ├── des.mk
│ ├── dsa.mk
│ ├── ecdsa.mk
│ ├── echo_c.mk
│ ├── entropium.mk
│ ├── grain.mk
│ ├── groestl_c.mk
│ ├── hmac-md5.mk
│ ├── hmac-sha1.mk
│ ├── hmac-sha256.mk
│ ├── jh_simple_small_c.mk
│ ├── jh_simple_speed_c.mk
│ ├── keccak_asm.mk
│ ├── keccak_c.mk
│ ├── khazad_small_c.mk
│ ├── md5.mk
│ ├── md5_c.mk
│ ├── mickey128.mk
│ ├── mqq160-sign.mk
│ ├── mqq160-sign_c.mk
│ ├── mugi.mk
│ ├── noekeon.mk
│ ├── noekeon_c.mk
│ ├── omac_noekeon.mk
│ ├── omac_noekeon_c.mk
│ ├── present.mk
│ ├── rabbit_c.mk
│ ├── rabbit_estream_c.mk
│ ├── rc5.mk
│ ├── rc6.mk
│ ├── rsaes_oaep.mk
│ ├── rsaes_pkcs1v15.mk
│ ├── salsa20_c.mk
│ ├── seed.mk
│ ├── seed_C.mk
│ ├── serpent-bitslice.mk
│ ├── serpent_asm_bitslice.mk
│ ├── serpent_asm_fast.mk
│ ├── serpent_asm_small.mk
│ ├── serpent_c.mk
│ ├── sha1.mk
│ ├── sha1_c.mk
│ ├── sha256.mk
│ ├── sha256_c.mk
│ ├── sha2_c.mk
│ ├── shabal.mk
│ ├── shabal_c.mk
│ ├── shabea.mk
│ ├── shacal1enc.mk
│ ├── shacal2enc.mk
│ ├── skein.mk
│ ├── skein_c.mk
│ ├── skipjack.mk
│ ├── skipjack_nessie.mk
│ ├── skipjack_nofix.mk
│ ├── tdes.mk
│ ├── threefish.mk
│ ├── threefish_C.mk
│ ├── threefish_small.mk
│ ├── trivium.mk
│ ├── twister.mk
│ ├── twister_c.mk
│ ├── ubi.mk
│ ├── ubi_c.mk
│ ├── whirlpool_0_fast_c.mk
│ ├── whirlpool_fast_c.mk
│ ├── whirlpool_small_c.mk
│ ├── whirlpool_t_fast_c.mk
│ ├── whirlpool_t_small_c.mk
│ ├── xtea.mk
│ ├── xtea_c.mk
│ └── xtea_new.mk
├── mqq-sign/
│ ├── mqq160-sign-asm.S
│ ├── mqq160-sign.c
│ ├── mqq160-sign.h
│ ├── mqq160-sign_P-asm.S
│ ├── mqq160-sign_P-stub.c
│ ├── mqq160-sign_P.c
│ ├── mqq160-sign_P.h
│ ├── mqq160-sign_testkey.c
│ └── mqq160-sign_testkey.h
├── mugi/
│ ├── mugi.c
│ └── mugi.h
├── noekeon/
│ ├── noekeon.c
│ ├── noekeon.h
│ ├── noekeon_asm.S
│ ├── noekeon_cbc_enc.S
│ ├── noekeon_cbc_enc.h
│ ├── noekeon_ctr.S
│ ├── noekeon_ctr.h
│ ├── noekeon_prng.c
│ ├── noekeon_prng.h
│ ├── omac_noekeon.S
│ ├── omac_noekeon.h
│ └── omac_noekeon_C.c
├── present/
│ ├── present128.c
│ ├── present128.h
│ ├── present80.c
│ ├── present80.h
│ ├── present_common.c
│ ├── present_common.h
│ ├── present_speed.c
│ └── present_speed.h
├── rabbit/
│ ├── rabbit.h
│ └── rabbit_c.c
├── rc5/
│ ├── rc5.c
│ └── rc5.h
├── rc6/
│ ├── rc6.c
│ └── rc6.h
├── rsa/
│ ├── random_dummy.c
│ ├── random_dummy.h
│ ├── random_message_1024
│ ├── random_message_1024.enc
│ ├── random_message_1024.plain
│ ├── rsa_basic.c
│ ├── rsa_basic.h
│ ├── rsa_der_structure
│ ├── rsa_privatekey_1024.ascii
│ ├── rsa_privatekey_2048.ascii
│ ├── rsa_privatekey_2048.der
│ ├── rsa_publickey_2048.ascii
│ ├── rsa_publickey_2048.der
│ ├── rsaes_oaep.c
│ ├── rsaes_oaep.h
│ ├── rsaes_pkcs1v15.c
│ └── rsaes_pkcs1v15.h
├── salsa20/
│ ├── salsa20.c
│ └── salsa20.h
├── scal/
│ ├── scal-basic.c
│ ├── scal-basic.h
│ ├── scal-nessie.c
│ ├── scal-nessie.h
│ ├── scal_arcfour.c
│ ├── scal_arcfour.h
│ ├── scal_grain.c
│ ├── scal_grain.h
│ ├── scal_mickey128.c
│ ├── scal_mickey128.h
│ ├── scal_rabbit.c
│ ├── scal_rabbit.h
│ ├── scal_salsa20.c
│ ├── scal_salsa20.h
│ ├── scal_trivium.c
│ └── scal_trivium.h
├── seed/
│ ├── seed-asm.S
│ ├── seed.h
│ ├── seed_C.c
│ ├── seed_sbox.c
│ └── seed_sbox.h
├── serpent/
│ ├── serpent-asm.S
│ ├── serpent-sboxes-bitslice-asm.S
│ ├── serpent-sboxes-bitslice.c
│ ├── serpent-sboxes-fast.S
│ ├── serpent-sboxes-small.S
│ ├── serpent-sboxes.h
│ ├── serpent-sboxes_c.c
│ ├── serpent.c
│ └── serpent.h
├── sha1/
│ ├── sha1-asm.S
│ ├── sha1.c
│ └── sha1.h
├── sha2/
│ ├── sha224.c
│ ├── sha224.h
│ ├── sha256.c
│ ├── sha256.h
│ ├── sha2_large_common.c
│ ├── sha2_large_common.h
│ ├── sha2_small_common.c
│ ├── sha2_small_common.h
│ ├── sha384.c
│ ├── sha384.h
│ ├── sha512.c
│ └── sha512.h
├── sha256/
│ ├── sha256-asm.S
│ ├── sha256.c
│ └── sha256.h
├── sha3-api.h
├── shabal/
│ ├── shabal-asm.S
│ ├── shabal.c
│ ├── shabal.h
│ ├── shabal192-asm.S
│ ├── shabal192.c
│ ├── shabal224-asm.S
│ ├── shabal224.c
│ ├── shabal256-asm.S
│ ├── shabal256.c
│ ├── shabal384-asm.S
│ ├── shabal384.c
│ ├── shabal512-asm.S
│ ├── shabal512.c
│ ├── shabal_shorttest.log
│ └── shabal_shorttest.log.ps
├── shabea/
│ ├── shabea.c
│ └── shabea.h
├── shacal1/
│ ├── shacal1_enc.c
│ └── shacal1_enc.h
├── shacal2/
│ ├── shacal2_enc.c
│ └── shacal2_enc.h
├── skein/
│ ├── skein-speed.log
│ ├── skein.h
│ ├── skein1024.c
│ ├── skein1024_asm.S
│ ├── skein256.c
│ ├── skein256_asm.S
│ ├── skein512.c
│ ├── skein512_asm.S
│ ├── skein_algo_list.txt
│ ├── threefish.h
│ ├── threefish1024_dec.c
│ ├── threefish1024_dec_asm.S
│ ├── threefish1024_dec_cstub.c
│ ├── threefish1024_enc.c
│ ├── threefish1024_enc_asm.S
│ ├── threefish256_dec.c
│ ├── threefish256_dec_asm.S
│ ├── threefish256_dec_cstub.c
│ ├── threefish256_enc.c
│ ├── threefish256_enc_asm.S
│ ├── threefish256_enc_small.S
│ ├── threefish512_dec.c
│ ├── threefish512_dec_asm.S
│ ├── threefish512_dec_cstub.c
│ ├── threefish512_enc.c
│ ├── threefish512_enc_asm.S
│ ├── threefish_invmix.S
│ ├── threefish_invmix_4c.S
│ ├── threefish_invmix_c.c
│ ├── threefish_mix.S
│ ├── threefish_mix_4c.S
│ ├── threefish_mix_c.c
│ ├── ubi.h
│ ├── ubi1024.c
│ ├── ubi1024_asm.S
│ ├── ubi256.c
│ ├── ubi256_asm.S
│ ├── ubi512.c
│ └── ubi512_asm.S
├── skipjack/
│ ├── skipjack.c
│ ├── skipjack.h
│ └── skipjack_nofix.c
├── stack_measuring.S
├── stack_measuring.h
├── streamcipher_descriptor.h
├── string-extras.h
├── test_src/
│ ├── avr-asm-macros.S
│ ├── circularbytebuffer-asm.S
│ ├── circularbytebuffer.h
│ ├── cli-basics.S
│ ├── cli-core.S
│ ├── cli-hexdump.S
│ ├── cli-stub.c
│ ├── cli.h
│ ├── cmacvs.c
│ ├── cmacvs.h
│ ├── config.h
│ ├── dbz_strings.c
│ ├── dbz_strings.h
│ ├── debug.c
│ ├── dump-asm.S
│ ├── dump-decl.c
│ ├── dump.h
│ ├── hexdigit_tab.S
│ ├── hexdigit_tab.h
│ ├── hexdigit_tab_c.c
│ ├── main-a5_1-test.c
│ ├── main-aes-test.c
│ ├── main-arcfour-test.c
│ ├── main-base64-test.c
│ ├── main-bigint-test.c
│ ├── main-blake-test.c
│ ├── main-bmw-test.c
│ ├── main-camellia-test.c
│ ├── main-cast5-test.c
│ ├── main-cast6-test.c
│ ├── main-cscipher-test.c
│ ├── main-cubehash-test.c
│ ├── main-des-test.c
│ ├── main-dsa-test.c
│ ├── main-ecdsa-test.c
│ ├── main-echo-test.c
│ ├── main-entropium-test.c
│ ├── main-grain-test.c
│ ├── main-groestl-test.c
│ ├── main-hmac-md5-test.c
│ ├── main-hmac-sha1-test.c
│ ├── main-hmac-sha256-test.c
│ ├── main-jh-test.c
│ ├── main-keccak-test.c
│ ├── main-khazad-test.c
│ ├── main-md5-test.c
│ ├── main-mickey128-test.c
│ ├── main-mqq160-sign-test.c
│ ├── main-mugi-test.c
│ ├── main-noekeon-test.c
│ ├── main-omac-noekeon-test.c
│ ├── main-present-test.c
│ ├── main-rabbit-test.c
│ ├── main-rc5-test.c
│ ├── main-rc6-test.c
│ ├── main-rsaes_oaep-test.c
│ ├── main-rsaes_pkcs1v15-test.c
│ ├── main-salsa20-test.c
│ ├── main-seed-test.c
│ ├── main-serpent-test.c
│ ├── main-sha1-test.c
│ ├── main-sha2-test.c
│ ├── main-sha256-test.c
│ ├── main-shabal-test.c
│ ├── main-shabea-test.c
│ ├── main-shacal1_enc-test.c
│ ├── main-shacal2_enc-test.c
│ ├── main-skein-test.c
│ ├── main-skipjack-test.c
│ ├── main-tdes-test.c
│ ├── main-test-common.c
│ ├── main-test-common.h
│ ├── main-threefish-test.c
│ ├── main-trivium-test.c
│ ├── main-twister-test.c
│ ├── main-ubi-test.c
│ ├── main-whirlpool-0-test.c
│ ├── main-whirlpool-t-test.c
│ ├── main-whirlpool-test.c
│ ├── main-xtea-test.c
│ ├── nessie_bc_test.c
│ ├── nessie_bc_test.h
│ ├── nessie_common.c
│ ├── nessie_common.h
│ ├── nessie_hash_test.c
│ ├── nessie_hash_test.h
│ ├── nessie_mac_test.c
│ ├── nessie_mac_test.h
│ ├── nessie_stream_test.c
│ ├── nessie_stream_test.h
│ ├── performance_test.c
│ ├── performance_test.h
│ ├── setbaud_asm.inc
│ ├── shavs.c
│ ├── shavs.h
│ ├── string-extras-asm.S
│ ├── string-extras.h
│ ├── uart_defs.h
│ ├── uart_i-asm.S
│ └── uart_i.h
├── testconf/
│ ├── AES_CMAC.conf
│ ├── Blake.conf
│ ├── BlueMidnightWish.conf
│ ├── CubeHash.conf
│ ├── Echo.conf
│ ├── Groestl.conf
│ ├── JH.conf
│ ├── Keccak.conf
│ ├── Sha1.conf
│ ├── Sha256.conf
│ ├── Shabal.conf
│ ├── Skein.conf
│ └── Twister.conf
├── testport.conf
├── testvectors/
│ ├── CAST-256.rfc2612.testvectors.txt
│ ├── Camellia-128-128.verified.test-vectors
│ ├── Cast-128-128-64.verified.test-vectors
│ ├── Cs-cipher-128-64.test-vectors
│ ├── Des-64-64.test-vectors
│ ├── HMAC-Md5-512-128.unverified.test-vectors
│ ├── HMAC-Sha-1-512-160.unverified.test-vectors
│ ├── HMAC-Sha-2-512-256.unverified.test-vectors
│ ├── Khazad-Tweaked-128-64.verified.test-vectors
│ ├── Md5-128.unverified.test-vectors
│ ├── Mickey-v2-128-unverified.test-vectors
│ ├── Noekeon-Direct-128-128.verified.test-vectors
│ ├── Rc4-arcfour-128.verified.test-vectors
│ ├── Rc5-128-64.verified.test-vectors
│ ├── Rc6-128-128.verified.test-vectors
│ ├── Rc6-192-128.verified.test-vectors
│ ├── Rc6-256-128.verified.test-vectors
│ ├── Rc6-256-256.verified.test-vectors
│ ├── Rijndael-128-128.unverified.test-vectors
│ ├── Rijndael-192-128.unverified.test-vectors
│ ├── Rijndael-256-128.unverified.test-vectors
│ ├── Seed-128-128.unverified.test-vectors
│ ├── Serpent-128-128.verified.test-vectors
│ ├── Serpent-192-128.verified.test-vectors
│ ├── Serpent-256-128.verified.test-vectors
│ ├── Sha-1-160.test-vectors
│ ├── Sha-2-256.unverified.test-vectors
│ ├── Shacal-512-160.verified.test-vectors
│ ├── Shacal-512-256.verified.test-vectors
│ ├── Skipjack-80-64.unverified.test-vectors
│ ├── Triple-Des-2-Key-128-64.unverified.test-vectors
│ ├── Triple-Des-3-Key-192-64.unverified.test-vectors
│ ├── Whirlpool-Final-512.unverified.test-vectors
│ ├── Whirlpool-Final-512.verified.cut.test-vectors
│ ├── Whirlpool-Orig-512.fixed.test-vectors
│ ├── Whirlpool-Tweak-512.verified.test-vectors
│ ├── cmacvs/
│ │ ├── CMACGenAES128.fax
│ │ ├── CMACGenAES192.fax
│ │ ├── CMACGenAES256.fax
│ │ ├── CMACGenTDES2.fax
│ │ ├── CMACGenTDES3.fax
│ │ ├── CMACVerAES128.fax
│ │ ├── CMACVerAES192.fax
│ │ ├── CMACVerAES256.fax
│ │ ├── CMACVerTDES2.fax
│ │ └── CMACVerTDES3.fax
│ ├── grain-128-unverified.test-vectors
│ ├── grain-v1-verified.test-vectors
│ ├── grain__verified.test-vectors
│ ├── mickey-v2-128-unverified.test-vectors
│ ├── present/
│ │ ├── nessie-present-128_le.txt
│ │ └── nessie-present-80_le.txt
│ ├── rabbit-verified.test-vectors
│ ├── rsa-pkcs-1v2-1-vec/
│ │ ├── oaep-vect.txt
│ │ └── pkcs1v15crypt-vectors.txt
│ ├── salsa20-full-128-verified.test-vectors
│ ├── salsa20-full-256-verified.test-vectors
│ ├── salsa20-full-verified.test-vectors
│ ├── shavs/
│ │ ├── Blake/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── Readme.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Blake-round2/
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── BlueMidnightWish/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── CubeHash/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Echo/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Groestl-0/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── IntermediateValues_1BlockMsg_224.txt
│ │ │ ├── IntermediateValues_1BlockMsg_256.txt
│ │ │ ├── IntermediateValues_1BlockMsg_384.txt
│ │ │ ├── IntermediateValues_1BlockMsg_512.txt
│ │ │ ├── IntermediateValues_2BlockMsg_224.txt
│ │ │ ├── IntermediateValues_2BlockMsg_256.txt
│ │ │ ├── IntermediateValues_2BlockMsg_384.txt
│ │ │ ├── IntermediateValues_2BlockMsg_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Groestl-round2/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── IntermediateValues_1BlockMsg_224.txt
│ │ │ ├── IntermediateValues_1BlockMsg_256.txt
│ │ │ ├── IntermediateValues_1BlockMsg_384.txt
│ │ │ ├── IntermediateValues_1BlockMsg_512.txt
│ │ │ ├── IntermediateValues_2BlockMsg_224.txt
│ │ │ ├── IntermediateValues_2BlockMsg_256.txt
│ │ │ ├── IntermediateValues_2BlockMsg_384.txt
│ │ │ ├── IntermediateValues_2BlockMsg_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── JH/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── JH-round2/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Keccak/
│ │ │ ├── DuplexKAT.txt
│ │ │ ├── DuplexKAT_r1026c574.txt
│ │ │ ├── DuplexKAT_r1027c573.txt
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_0.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── KeccakDuplexIntermediateValues_r1026c574.txt
│ │ │ ├── KeccakDuplexIntermediateValues_r1027c573.txt
│ │ │ ├── KeccakPermutationIntermediateValues.txt
│ │ │ ├── KeccakPermutationIntermediateValues32BI.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1024c576.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1088c512.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r1152c448.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r576c1024.txt
│ │ │ ├── KeccakSpongeIntermediateValues_r832c768.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_0.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_0.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_0.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ ├── ShortMsgKAT_512.txt
│ │ │ ├── ShortMsgKAT_r128c272.txt
│ │ │ ├── ShortMsgKAT_r1344c256.txt
│ │ │ ├── ShortMsgKAT_r144c256.txt
│ │ │ ├── ShortMsgKAT_r256c544.txt
│ │ │ ├── ShortMsgKAT_r40c160.txt
│ │ │ ├── ShortMsgKAT_r512c288.txt
│ │ │ └── ShortMsgKAT_r544c256.txt
│ │ ├── SHA1+2/
│ │ │ ├── BitTestVectors/
│ │ │ │ ├── SHA1LongMsg.txt
│ │ │ │ ├── SHA1Monte.txt
│ │ │ │ ├── SHA1ShortMsg.txt
│ │ │ │ ├── SHA224LongMsg.txt
│ │ │ │ ├── SHA224Monte.txt
│ │ │ │ ├── SHA224ShortMsg.txt
│ │ │ │ ├── SHA256LongMsg.txt
│ │ │ │ ├── SHA256Monte.txt
│ │ │ │ ├── SHA256ShortMsg.txt
│ │ │ │ ├── SHA384LongMsg.txt
│ │ │ │ ├── SHA384Monte.txt
│ │ │ │ ├── SHA384ShortMsg.txt
│ │ │ │ ├── SHA512LongMsg.txt
│ │ │ │ ├── SHA512Monte.txt
│ │ │ │ └── SHA512ShortMsg.txt
│ │ │ └── ByteTestVectors/
│ │ │ ├── SHA1LongMsg.txt
│ │ │ ├── SHA1Monte.txt
│ │ │ ├── SHA1ShortMsg.txt
│ │ │ ├── SHA256LongMsg.txt
│ │ │ ├── SHA256Monte.txt
│ │ │ └── SHA256ShortMsg.txt
│ │ ├── Shabal/
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ └── ShortMsgKAT_512.txt
│ │ ├── Skein/
│ │ │ ├── ExtremelyLongMsgKAT.txt
│ │ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ │ ├── LongMsgKAT.txt
│ │ │ ├── LongMsgKAT_224.txt
│ │ │ ├── LongMsgKAT_256.txt
│ │ │ ├── LongMsgKAT_384.txt
│ │ │ ├── LongMsgKAT_512.txt
│ │ │ ├── MonteCarlo.txt
│ │ │ ├── MonteCarlo_224.txt
│ │ │ ├── MonteCarlo_256.txt
│ │ │ ├── MonteCarlo_384.txt
│ │ │ ├── MonteCarlo_512.txt
│ │ │ ├── Readme.txt
│ │ │ ├── ShortMsgKAT.txt
│ │ │ ├── ShortMsgKAT_224.txt
│ │ │ ├── ShortMsgKAT_256.txt
│ │ │ ├── ShortMsgKAT_384.txt
│ │ │ ├── ShortMsgKAT_512.txt
│ │ │ ├── skein_golden_kat.txt
│ │ │ ├── skein_golden_kat_internals.txt
│ │ │ ├── skein_golden_kat_short.txt
│ │ │ └── skein_golden_kat_short_internals.txt
│ │ └── Twister/
│ │ ├── ExtremelyLongMsgKAT_224.txt
│ │ ├── ExtremelyLongMsgKAT_256.txt
│ │ ├── ExtremelyLongMsgKAT_384.txt
│ │ ├── ExtremelyLongMsgKAT_512.txt
│ │ ├── LongMsgKAT_224.txt
│ │ ├── LongMsgKAT_256.txt
│ │ ├── LongMsgKAT_384.txt
│ │ ├── LongMsgKAT_512.txt
│ │ ├── MonteCarlo_224.txt
│ │ ├── MonteCarlo_256.txt
│ │ ├── MonteCarlo_384.txt
│ │ ├── MonteCarlo_512.txt
│ │ ├── ShortMsgKAT_224.txt
│ │ ├── ShortMsgKAT_256.txt
│ │ ├── ShortMsgKAT_384.txt
│ │ └── ShortMsgKAT_512.txt
│ ├── trivium-80.32.test-vectors
│ ├── trivium-80.64.test-vectors
│ ├── trivium-80.80.test-vectors
│ └── trivium-unverified.test-vectors
├── trivium/
│ ├── trivium.c
│ └── trivium.h
├── twister/
│ ├── twister-asm.S
│ ├── twister-asm.S_shiftmul
│ ├── twister-large-asm.S
│ ├── twister-large.c
│ ├── twister-large.h
│ ├── twister-sha3api.c
│ ├── twister-sha3api.h
│ ├── twister-small-asm.S
│ ├── twister-small-stub.c
│ ├── twister-small.c
│ ├── twister-small.h
│ ├── twister-speed.log
│ ├── twister.c
│ ├── twister.h
│ ├── twister224.S
│ ├── twister256.S
│ ├── twister384.S
│ ├── twister512.S
│ ├── twister_ref.h
│ ├── twister_tables.c
│ └── twister_tables.h
├── whirlpool/
│ ├── whirlpool.c
│ └── whirlpool.h
└── xtea/
├── xtea-asm.S
├── xtea.c
└── xtea.h
SYMBOL INDEX (1554 symbols across 299 files)
FILE: a51/A5_1.c
function a5_1_init (line 42) | void a5_1_init(a5_1_ctx_t *c, void *key, uint8_t keylength_b, void *iv, ...
function shiftreg (line 67) | static
function a5_1_clock_core (line 82) | uint8_t a5_1_clock_core(a5_1_ctx_t *c, uint8_t clockoverride){
function a5_1_clock (line 123) | uint8_t a5_1_clock(a5_1_ctx_t *c){
function a5_1_gen (line 128) | uint8_t a5_1_gen(a5_1_ctx_t *c){
FILE: a51/A5_1.h
type a5_1_ctx_t (line 55) | typedef struct {
FILE: aes/aes128_dec.c
function aes128_dec (line 31) | void aes128_dec(void *buffer, aes128_ctx_t *ctx){
FILE: aes/aes128_enc.c
function aes128_enc (line 31) | void aes128_enc(void *buffer, aes128_ctx_t *ctx){
FILE: aes/aes192_dec.c
function aes192_dec (line 31) | void aes192_dec(void *buffer, aes192_ctx_t *ctx){
FILE: aes/aes192_enc.c
function aes192_enc (line 31) | void aes192_enc(void *buffer, aes192_ctx_t *ctx){
FILE: aes/aes256_dec.c
function aes256_dec (line 31) | void aes256_dec(void *buffer, aes256_ctx_t *ctx){
FILE: aes/aes256_enc.c
function aes256_enc (line 31) | void aes256_enc(void *buffer, aes256_ctx_t *ctx){
FILE: aes/aes_dec.c
function aes_invshiftrow (line 28) | void aes_invshiftrow(void *data, uint8_t shift){
function aes_invshiftcol (line 37) | void aes_invshiftcol(void *data, uint8_t shift){
function aes_dec_round (line 48) | static
function aes_dec_firstround (line 104) | static
function aes_decrypt_core (line 121) | void aes_decrypt_core(aes_cipher_state_t *state, const aes_genctx_t *ks,...
FILE: aes/aes_enc.c
function aes_shiftcol (line 36) | void aes_shiftcol(void *data, uint8_t shift){
function aes_enc_round (line 52) | static
function aes_enc_lastround (line 92) | static
function aes_encrypt_core (line 109) | void aes_encrypt_core(aes_cipher_state_t *state, const aes_genctx_t *ks,...
FILE: aes/aes_keyschedule.c
function aes_rotword (line 35) | static
function aes_init (line 49) | void aes_init(const void *key, uint16_t keysize_b, aes_genctx_t *ctx){
function aes128_init (line 84) | void aes128_init(const void *key, aes128_ctx_t *ctx){
function aes192_init (line 88) | void aes192_init(const void *key, aes192_ctx_t *ctx){
function aes256_init (line 92) | void aes256_init(const void *key, aes256_ctx_t *ctx){
FILE: aes/aes_types.h
type aes_roundkey_t (line 32) | typedef struct{
type aes128_ctx_t (line 36) | typedef struct{
type aes192_ctx_t (line 40) | typedef struct{
type aes256_ctx_t (line 44) | typedef struct{
type aes_genctx_t (line 48) | typedef struct{
type aes_cipher_state_t (line 52) | typedef struct{
FILE: arcfour/arcfour.c
function arcfour_init (line 36) | void arcfour_init(const void *key, uint16_t length_b, arcfour_ctx_t *ctx){
function arcfour_gen (line 62) | uint8_t arcfour_gen(arcfour_ctx_t *ctx){
FILE: arcfour/arcfour.h
type arcfour_ctx_t (line 61) | typedef struct arcfour_ctx_st {
FILE: base64/base64_dec.c
function ascii2bit6 (line 41) | static
function ascii2bit6 (line 63) | static
function ascii2bit6 (line 107) | static
function base64_binlength (line 134) | int base64_binlength(char *str, uint8_t strict){
function base64dec (line 190) | int base64dec(void *dest, const char *b64str, uint8_t strict){
FILE: base64/base64_enc.c
function bit6toAscii (line 45) | static
function bit6toAscii (line 53) | static
function base64enc (line 78) | void base64enc(char *dest,const void *src, uint16_t length){
FILE: bcal/bcal-basic.c
function bcal_cipher_init (line 27) | uint8_t bcal_cipher_init(const bcdesc_t *cipher_descriptor,
function bcal_cipher_free (line 55) | void bcal_cipher_free(bcgen_ctx_t *ctx){
function bcal_cipher_enc (line 65) | void bcal_cipher_enc(void *block, const bcgen_ctx_t *ctx){
function bcal_cipher_dec (line 76) | void bcal_cipher_dec(void *block, const bcgen_ctx_t *ctx){
function bcal_cipher_getBlocksize_b (line 86) | uint16_t bcal_cipher_getBlocksize_b(const bcdesc_t *desc){
function PGM_VOID_P (line 90) | PGM_VOID_P bcal_cipher_getKeysizeDesc(const bcdesc_t *desc){
FILE: bcal/bcal-cbc.c
function bcal_cbc_init (line 26) | uint8_t bcal_cbc_init(const bcdesc_t *desc, const void *key, uint16_t ke...
function bcal_cbc_free (line 37) | void bcal_cbc_free(bcal_cbc_ctx_t *ctx){
function bcal_cbc_loadIV (line 43) | void bcal_cbc_loadIV(const void *iv, bcal_cbc_ctx_t *ctx){
function bcal_cbc_encNext (line 49) | void bcal_cbc_encNext(void *block, bcal_cbc_ctx_t *ctx){
function bcal_cbc_decNext (line 55) | void bcal_cbc_decNext(void *block, bcal_cbc_ctx_t *ctx){
function bcal_cbc_decRand (line 62) | void bcal_cbc_decRand(void *block, const void *prev_block, bcal_cbc_ctx_...
function bcal_cbc_encMsg (line 67) | void bcal_cbc_encMsg(const void *iv, void *msg, uint16_t msg_blocks, bca...
function bcal_cbc_decMsg (line 75) | void bcal_cbc_decMsg(const void *iv, void *msg, uint16_t msg_blocks, bca...
FILE: bcal/bcal-cbc.h
type bcal_cbc_ctx_t (line 27) | typedef struct{
FILE: bcal/bcal-cfb_bit.c
function read_bit (line 26) | static uint8_t read_bit(void *block, uint32_t index){
function write_bit (line 33) | static void write_bit(void *block, uint32_t index, uint8_t value){
function bcal_cfb_b_init (line 43) | uint8_t bcal_cfb_b_init(const bcdesc_t *desc, const void *key, uint16_t ...
function bcal_cfb_b_free (line 57) | void bcal_cfb_b_free(bcal_cfb_b_ctx_t *ctx){
function bcal_cfb_b_loadIV (line 62) | void bcal_cfb_b_loadIV(const void *iv, bcal_cfb_b_ctx_t *ctx){
function bcal_cfb_b_encNext (line 68) | void bcal_cfb_b_encNext(void *block, uint8_t offset, bcal_cfb_b_ctx_t *c...
function bcal_cfb_b_decNext (line 86) | void bcal_cfb_b_decNext(void *block, uint8_t offset, bcal_cfb_b_ctx_t *c...
function bcal_cfb_b_encMsg (line 106) | void bcal_cfb_b_encMsg(const void *iv, void *msg, uint8_t offset, uint32...
function bcal_cfb_b_decMsg (line 118) | void bcal_cfb_b_decMsg(const void *iv, void *msg, uint8_t offset, uint32...
FILE: bcal/bcal-cfb_bit.h
type bcal_cfb_b_ctx_t (line 29) | typedef struct{
FILE: bcal/bcal-cfb_byte.c
function bcal_cfb_B_init (line 28) | uint8_t bcal_cfb_B_init(const bcdesc_t *desc, const void *key, uint16_t ...
function bcal_cfb_B_free (line 42) | void bcal_cfb_B_free(bcal_cfb_B_ctx_t *ctx){
function bcal_cfb_B_loadIV (line 47) | void bcal_cfb_B_loadIV(const void *iv, bcal_cfb_B_ctx_t *ctx){
function bcal_cfb_B_encNext (line 53) | void bcal_cfb_B_encNext(void *block, bcal_cfb_B_ctx_t *ctx){
function bcal_cfb_B_decNext (line 62) | void bcal_cfb_B_decNext(void *block, bcal_cfb_B_ctx_t *ctx){
function bcal_cfb_B_encMsg (line 73) | void bcal_cfb_B_encMsg(const void *iv, void *msg, uint16_t msg_blocks, b...
function bcal_cfb_B_decMsg (line 81) | void bcal_cfb_B_decMsg(const void *iv, void *msg, uint16_t msg_blocks, b...
FILE: bcal/bcal-cfb_byte.h
type bcal_cfb_B_ctx_t (line 28) | typedef struct{
FILE: bcal/bcal-cmac.c
function left_shift_be_block (line 28) | static uint8_t left_shift_be_block(void *block, uint8_t blocksize_B){
function bcal_cmac_init (line 43) | uint8_t bcal_cmac_init(const bcdesc_t *desc, const void *key, uint16_t k...
function bcal_cmac_free (line 90) | void bcal_cmac_free(bcal_cmac_ctx_t *ctx){
function bcal_cmac_nextBlock (line 97) | void bcal_cmac_nextBlock (bcal_cmac_ctx_t *ctx, const void *block){
function bcal_cmac_lastBlock (line 107) | void bcal_cmac_lastBlock(bcal_cmac_ctx_t *ctx, const void *block, uint16...
function bcal_cmac_ctx2mac (line 134) | void bcal_cmac_ctx2mac(void *dest, uint16_t length_b, const bcal_cmac_ct...
function bcal_cmac (line 142) | void bcal_cmac(void *dest, uint16_t out_length_b, const void *block, uin...
FILE: bcal/bcal-cmac.h
type bcal_cmac_ctx_t (line 27) | typedef struct{
FILE: bcal/bcal-ctr.c
function increment_be (line 27) | static void increment_be(void *block, uint8_t size_B){
function bcal_ctr_init (line 37) | uint8_t bcal_ctr_init(const bcdesc_t *desc, const void *key, uint16_t ke...
function bcal_ctr_free (line 52) | void bcal_ctr_free(bcal_ctr_ctx_t *ctx){
function bcal_ctr_loadIV (line 57) | void bcal_ctr_loadIV(const void *iv, bcal_ctr_ctx_t *ctx){
function bcal_ctr_encNext (line 63) | void bcal_ctr_encNext(void *block, bcal_ctr_ctx_t *ctx){
function bcal_ctr_decNext (line 71) | void bcal_ctr_decNext(void *block, bcal_ctr_ctx_t *ctx){
function bcal_ctr_encMsg (line 75) | void bcal_ctr_encMsg(const void *iv, void *msg, uint32_t msg_len_b, bcal...
function bcal_ctr_decMsg (line 92) | void bcal_ctr_decMsg(const void *iv, void *msg, uint32_t msg_len_b, bcal...
FILE: bcal/bcal-ctr.h
type bcal_ctr_ctx_t (line 29) | typedef struct{
FILE: bcal/bcal-eax.c
function bcal_eax_init (line 29) | uint8_t bcal_eax_init(const bcdesc_t *desc, const void *key, uint16_t ke...
function bcal_eax_free (line 63) | void bcal_eax_free(bcal_eax_ctx_t *ctx){
function bcal_eax_loadNonce (line 71) | void bcal_eax_loadNonce(const void *nonce, uint16_t length_b, bcal_eax_c...
function bcal_eax_addNextHeader (line 77) | void bcal_eax_addNextHeader(const void *header, bcal_eax_ctx_t *ctx){
function bcal_eax_addLastHeader (line 81) | void bcal_eax_addLastHeader(const void *header, uint16_t length_b, bcal_...
function bcal_eax_encNextBlock (line 86) | void bcal_eax_encNextBlock(void *block, bcal_eax_ctx_t *ctx){
function bcal_eax_encLastBlock (line 91) | void bcal_eax_encLastBlock(void *block, uint16_t length_b, bcal_eax_ctx_...
function bcal_eax_decNextBlock (line 96) | void bcal_eax_decNextBlock(void *block, bcal_eax_ctx_t *ctx){
function bcal_eax_decLastBlock (line 101) | void bcal_eax_decLastBlock(void *block, uint16_t length_b, bcal_eax_ctx_...
function bcal_eax_ctx2tag (line 106) | void bcal_eax_ctx2tag(void *dest, uint16_t length_b, bcal_eax_ctx_t *ctx){
FILE: bcal/bcal-eax.h
type bcal_eax_ctx_t (line 30) | typedef struct{
FILE: bcal/bcal-nessie.c
function bcal_nessie_dummy_init (line 31) | void bcal_nessie_dummy_init(const void *key, uint16_t keysize, void *ctx){
function bcal_nessie (line 39) | void bcal_nessie(const bcdesc_t *bcd){
function bcal_nessie_multiple (line 72) | void bcal_nessie_multiple(const bcdesc_t *const *bcd_list){
FILE: bcal/bcal-ofb.c
function bcal_ofb_init (line 27) | uint8_t bcal_ofb_init(const bcdesc_t *desc, const void *key, uint16_t ke...
function bcal_ofb_free (line 37) | void bcal_ofb_free(bcal_ofb_ctx_t *ctx){
function bcal_ofb_loadIV (line 42) | void bcal_ofb_loadIV(const void *iv, bcal_ofb_ctx_t *ctx){
function bcal_ofb_encNext (line 48) | void bcal_ofb_encNext(void *block, bcal_ofb_ctx_t *ctx){
function bcal_ofb_decNext (line 53) | void bcal_ofb_decNext(void *block, bcal_ofb_ctx_t *ctx){
function bcal_ofb_encMsg (line 59) | void bcal_ofb_encMsg(const void *iv, void *msg, uint32_t msg_len_b, bcal...
function bcal_ofb_decMsg (line 73) | void bcal_ofb_decMsg(const void *iv, void *msg, uint32_t msg_len_b, bcal...
FILE: bcal/bcal-ofb.h
type bcal_ofb_ctx_t (line 29) | typedef struct{
FILE: bcal/bcal-performance.c
function bcal_performance (line 58) | void bcal_performance(const bcdesc_t *bcd){
function bcal_stacksize (line 139) | void bcal_stacksize(const bcdesc_t *bcd){
function bcal_performance_multiple (line 208) | void bcal_performance_multiple(const bcdesc_t *const *bcd_list){
FILE: bcal/bcal_des.c
function des_dummy_enc (line 38) | static
function des_dummy_dec (line 43) | static
FILE: bcal/bcal_rc5.c
function rc5_dummy_init (line 41) | static
FILE: bcal/bcal_tdes.c
function tdes_dummy_enc (line 39) | static
function tdes_dummy_dec (line 44) | static
FILE: bcal/bcal_tdes2.c
function tdes_dummy_enc (line 40) | static
function tdes_dummy_dec (line 45) | static
function tdes2_init (line 50) | static
FILE: bcal/bcal_threefish1024.c
function threefish1024_dummy_init (line 39) | static void threefish1024_dummy_init(void *key, void *ctx){
FILE: bcal/bcal_threefish256.c
function threefish256_dummy_init (line 39) | static void threefish256_dummy_init(void *key, void *ctx){
FILE: bcal/bcal_threefish512.c
function threefish512_dummy_init (line 39) | static void threefish512_dummy_init(void *key, void *ctx){
FILE: bcal/bcal_xtea.c
function xtea_dummy_enc (line 39) | static
function xtea_dummy_dec (line 44) | static
FILE: bigint/bigint-stub.c
function bigint_sub_u (line 125) | void bigint_sub_u(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_cmp_u (line 186) | int8_t bigint_cmp_u(const bigint_t *a, const bigint_t *b){
function bigint_add_s (line 212) | void bigint_add_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_sub_s (line 238) | void bigint_sub_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_cmp_s (line 265) | int8_t bigint_cmp_s(const bigint_t *a, const bigint_t *b){
function bigint_shiftleft (line 293) | void bigint_shiftleft(bigint_t *a, uint16_t shift){
function bigint_shiftright (line 327) | void bigint_shiftright(bigint_t *a, uint16_t shift){
function bigint_xor (line 362) | void bigint_xor(bigint_t *dest, const bigint_t *a){
function bigint_set_zero (line 372) | void bigint_set_zero(bigint_t *a){
function bigint_mul_u (line 380) | void bigint_mul_u(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_mul_s (line 473) | void bigint_mul_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_square (line 503) | void bigint_square(bigint_t *dest, const bigint_t *a){
function bigint_sub_u_bitscale (line 541) | void bigint_sub_u_bitscale(bigint_t *a, const bigint_t *b, uint16_t bits...
function bigint_reduce (line 582) | void bigint_reduce(bigint_t *a, const bigint_t *r){
function bigint_expmod_u (line 605) | void bigint_expmod_u(bigint_t *dest, const bigint_t *a, const bigint_t *...
function bigint_gcdext (line 650) | void bigint_gcdext(bigint_t *gcd, bigint_t *a, bigint_t *b, const bigint...
function bigint_inverse (line 747) | void bigint_inverse(bigint_t *dest, const bigint_t *a, const bigint_t *m){
function bigint_changeendianess (line 756) | void bigint_changeendianess(bigint_t *a){
FILE: bigint/bigint.c
function bigint_adjust (line 65) | void bigint_adjust(bigint_t *a){
function bigint_length_t (line 85) | bigint_length_t bigint_length_b(const bigint_t *a){
function bigint_length_t (line 94) | bigint_length_t bigint_length_B(const bigint_t *a){
function bigint_get_first_set_bit (line 100) | uint32_t bigint_get_first_set_bit(const bigint_t *a){
function bigint_get_last_set_bit (line 110) | uint32_t bigint_get_last_set_bit(const bigint_t *a){
function bigint_copy (line 132) | void bigint_copy(bigint_t *dest, const bigint_t *src){
function bigint_add_u (line 143) | void bigint_add_u(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_add_scale_u (line 171) | void bigint_add_scale_u(bigint_t *dest, const bigint_t *a, bigint_length...
function bigint_sub_u (line 222) | void bigint_sub_u(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_cmp_u (line 267) | int8_t bigint_cmp_u(const bigint_t *a, const bigint_t *b){
function bigint_add_s (line 293) | void bigint_add_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_sub_s (line 319) | void bigint_sub_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_cmp_s (line 346) | int8_t bigint_cmp_s(const bigint_t *a, const bigint_t *b){
function bigint_shiftleft (line 374) | void bigint_shiftleft(bigint_t *a, bigint_length_t shift){
function bigint_shiftright (line 412) | void bigint_shiftright(bigint_t *a, bigint_length_t shift){
function bigint_xor (line 449) | void bigint_xor(bigint_t *dest, const bigint_t *a){
function bigint_set_zero (line 459) | void bigint_set_zero(bigint_t *a){
function bigint_mul_u (line 467) | void bigint_mul_u(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_mul_s (line 568) | void bigint_mul_s(bigint_t *dest, const bigint_t *a, const bigint_t *b){
function bigint_square (line 603) | void bigint_square(bigint_t *dest, const bigint_t *a){
function bigint_square (line 692) | void bigint_square(bigint_t *dest, const bigint_t *a) {
function bigint_sub_u_bitscale (line 749) | void bigint_sub_u_bitscale(bigint_t *a, const bigint_t *b, bigint_length...
function bigint_reduce (line 776) | void bigint_reduce(bigint_t *a, const bigint_t *r){
function bigint_expmod_u_sam (line 812) | void bigint_expmod_u_sam(bigint_t *dest, const bigint_t *a, const bigint...
function bigint_gcdext (line 868) | void bigint_gcdext(bigint_t *gcd, bigint_t *a, bigint_t *b, const bigint...
function bigint_inverse (line 1009) | void bigint_inverse(bigint_t *dest, const bigint_t *a, const bigint_t *m){
function bigint_changeendianess (line 1018) | void bigint_changeendianess(bigint_t *a){
function bigint_mul_word_u (line 1032) | void bigint_mul_word_u(bigint_t *a, bigint_word_t b){
function bigint_clip (line 1057) | void bigint_clip(bigint_t *dest, bigint_length_t length_W){
function bigint_mont_mul (line 1069) | void bigint_mont_mul(bigint_t *dest, const bigint_t *a, const bigint_t *...
function bigint_mont_red (line 1108) | void bigint_mont_red(bigint_t *dest, const bigint_t *a, const bigint_t *...
function bigint_mont_gen_m_ (line 1136) | void bigint_mont_gen_m_(bigint_t* dest, const bigint_t* m){
function bigint_mont_trans (line 1172) | void bigint_mont_trans(bigint_t *dest, const bigint_t *a, const bigint_t...
function bigint_expmod_u_mont_sam (line 1189) | void bigint_expmod_u_mont_sam(bigint_t *dest, const bigint_t *a, const b...
function bigint_expmod_u (line 1249) | void bigint_expmod_u(bigint_t *dest, const bigint_t *a, const bigint_t *...
FILE: bigint/bigint.h
type bigint_word_t (line 34) | typedef uint8_t bigint_word_t;
type bigint_wordplus_t (line 35) | typedef uint16_t bigint_wordplus_t;
type bigint_wordplus_signed_t (line 36) | typedef int16_t bigint_wordplus_signed_t;
type bigint_length_t (line 42) | typedef size_t bigint_length_t;
type uint_fast8_t (line 43) | typedef uint_fast8_t bigint_info_t;
type bigint_t (line 45) | typedef struct{
FILE: bigint/bigint_io.c
function bigint_print_hex (line 26) | void bigint_print_hex(const bigint_t *a) {
function char2nibble (line 59) | static uint8_t char2nibble(char c) {
function read_byte (line 70) | static uint16_t read_byte(void) {
function bigint_read_hex_echo (line 89) | uint8_t bigint_read_hex_echo(bigint_t *a) {
FILE: blake/blake_large.c
function pgm_read_qword (line 35) | static
function blake_large_expand (line 67) | static
function blake_large_changeendian (line 78) | static
function blake_large_compress (line 89) | static
function blake_large_collapse (line 118) | static
function blake_large_nextBlock (line 126) | void blake_large_nextBlock(blake_large_ctx_t *ctx, const void *msg){
function blake_large_lastBlock (line 143) | void blake_large_lastBlock(blake_large_ctx_t *ctx, const void *msg, uint...
function blake512_init (line 189) | void blake512_init(blake512_ctx_t *ctx){
function blake384_init (line 206) | void blake384_init(blake384_ctx_t *ctx){
function blake512_ctx2hash (line 216) | void blake512_ctx2hash(void *dest, const blake512_ctx_t *ctx){
function blake384_ctx2hash (line 224) | void blake384_ctx2hash(void *dest, const blake384_ctx_t *ctx){
function blake512_nextBlock (line 232) | void blake512_nextBlock(blake512_ctx_t *ctx, const void *block){
function blake384_nextBlock (line 236) | void blake384_nextBlock(blake384_ctx_t *ctx, const void *block){
function blake512_lastBlock (line 240) | void blake512_lastBlock(blake512_ctx_t *ctx, const void *block, uint16_t...
function blake384_lastBlock (line 244) | void blake384_lastBlock(blake384_ctx_t *ctx, const void *block, uint16_t...
function blake512 (line 248) | void blake512(void *dest, const void *msg, uint32_t length_b){
function blake384 (line 260) | void blake384(void *dest, const void *msg, uint32_t length_b){
FILE: blake/blake_large.h
type blake_large_ctx_t (line 39) | typedef struct {
type blake_large_ctx_t (line 46) | typedef blake_large_ctx_t blake384_ctx_t;
type blake_large_ctx_t (line 47) | typedef blake_large_ctx_t blake512_ctx_t;
FILE: blake/blake_small.c
function blake_small_expand (line 53) | static
function blake_small_changeendian (line 64) | static
function blake_small_compress (line 72) | static
function blake_small_collapse (line 111) | static
function blake_small_nextBlock (line 119) | void blake_small_nextBlock(blake_small_ctx_t *ctx, const void *msg){
function blake_small_lastBlock (line 138) | void blake_small_lastBlock(blake_small_ctx_t *ctx, const void *msg, uint...
function blake256_init (line 192) | void blake256_init(blake256_ctx_t *ctx){
function blake224_init (line 209) | void blake224_init(blake224_ctx_t *ctx){
function blake256_ctx2hash (line 219) | void blake256_ctx2hash(void *dest, const blake256_ctx_t *ctx){
function blake224_ctx2hash (line 226) | void blake224_ctx2hash(void *dest, const blake224_ctx_t *ctx){
function blake256_nextBlock (line 233) | void blake256_nextBlock(blake256_ctx_t *ctx, const void *block){
function blake224_nextBlock (line 237) | void blake224_nextBlock(blake224_ctx_t *ctx, const void *block){
function blake256_lastBlock (line 241) | void blake256_lastBlock(blake256_ctx_t *ctx, const void *block, uint16_t...
function blake224_lastBlock (line 245) | void blake224_lastBlock(blake224_ctx_t *ctx, const void *block, uint16_t...
function blake256 (line 249) | void blake256(void *dest, const void *msg, uint32_t length_b){
function blake224 (line 261) | void blake224(void *dest, const void *msg, uint32_t length_b){
FILE: blake/blake_small.h
type blake_small_ctx_t (line 39) | typedef struct {
type blake_small_ctx_t (line 46) | typedef blake_small_ctx_t blake224_ctx_t;
type blake_small_ctx_t (line 47) | typedef blake_small_ctx_t blake256_ctx_t;
FILE: blockcipher_descriptor.h
type bc_init_fpt (line 47) | typedef union{
type bc_enc_fpt (line 53) | typedef union{
type bc_dec_fpt (line 59) | typedef union{
type bcdesc_t (line 79) | typedef struct {
type bcgen_ctx_t (line 92) | typedef struct{
FILE: bmw/bmw_large.c
function ctx_dump (line 46) | void ctx_dump(const bmw_large_ctx_t *ctx){
function dump_x (line 59) | void dump_x(const uint64_t *q, uint8_t elements, char x){
function rotl64 (line 78) | static
function rotr64 (line 83) | static
function shiftl64 (line 88) | static
function shiftr64 (line 93) | static
function bmw_large_s0 (line 98) | static
function bmw_large_s1 (line 108) | static
function bmw_large_s2 (line 118) | static
function bmw_large_s3 (line 128) | static
function bmw_large_s4 (line 138) | static
function bmw_large_s5 (line 146) | static
function bmw_large_r1 (line 154) | static
function bmw_large_r2 (line 161) | static
function bmw_large_r3 (line 168) | static
function bmw_large_r4 (line 175) | static
function bmw_large_r5 (line 182) | static
function bmw_large_r6 (line 189) | static
function bmw_large_r7 (line 196) | static
function bmw_large_expand1 (line 222) | static
function bmw_large_expand2 (line 252) | static
function bmw_large_f0 (line 315) | static
function bmw_large_f0 (line 377) | static
function bmw_large_f0 (line 419) | static
function bmw_large_f1 (line 460) | static
function bmw_large_f2 (line 470) | static
function bmw_large_nextBlock (line 513) | void bmw_large_nextBlock(bmw_large_ctx_t *ctx, const void *block){
function bmw_large_lastBlock (line 525) | void bmw_large_lastBlock(bmw_large_ctx_t *ctx, const void *block, uint16...
function bmw384_init (line 559) | void bmw384_init(bmw384_ctx_t *ctx){
function bmw512_init (line 572) | void bmw512_init(bmw512_ctx_t *ctx){
function bmw384_nextBlock (line 582) | void bmw384_nextBlock(bmw384_ctx_t *ctx, const void *block){
function bmw512_nextBlock (line 586) | void bmw512_nextBlock(bmw512_ctx_t *ctx, const void *block){
function bmw384_lastBlock (line 590) | void bmw384_lastBlock(bmw384_ctx_t *ctx, const void *block, uint16_t len...
function bmw512_lastBlock (line 594) | void bmw512_lastBlock(bmw512_ctx_t *ctx, const void *block, uint16_t len...
function bmw384_ctx2hash (line 598) | void bmw384_ctx2hash(void *dest, const bmw384_ctx_t *ctx){
function bmw512_ctx2hash (line 602) | void bmw512_ctx2hash(void *dest, const bmw512_ctx_t *ctx){
function bmw384 (line 606) | void bmw384(void *dest, const void *msg, uint32_t length_b){
function bmw512 (line 618) | void bmw512(void *dest, const void *msg, uint32_t length_b){
FILE: bmw/bmw_large.h
type bmw_large_ctx_t (line 39) | typedef struct {
type bmw_large_ctx_t (line 44) | typedef bmw_large_ctx_t bmw384_ctx_t;
type bmw_large_ctx_t (line 45) | typedef bmw_large_ctx_t bmw512_ctx_t;
FILE: bmw/bmw_small.c
function ctx_dump (line 59) | void ctx_dump(const bmw_small_ctx_t *ctx){
function dump_x (line 72) | void dump_x(const uint32_t *q, uint8_t elements, char x){
function bmw_small_s0 (line 91) | static
function bmw_small_s1 (line 101) | static
function bmw_small_s2 (line 111) | static
function bmw_small_s3 (line 121) | static
function bmw_small_s4 (line 131) | static
function bmw_small_s5 (line 139) | static
function bmw_small_r1 (line 147) | static
function bmw_small_r2 (line 154) | static
function bmw_small_r3 (line 161) | static
function bmw_small_r4 (line 168) | static
function bmw_small_r5 (line 175) | static
function bmw_small_r6 (line 182) | static
function bmw_small_r7 (line 189) | static
function bmw_small_expand1 (line 214) | static
function bmw_small_expand2 (line 239) | static
function bmw_small_f0 (line 279) | static
function bmw_small_f0 (line 341) | static
function bmw_small_f0 (line 383) | static
function bmw_small_f1 (line 423) | static
function bmw_small_f2 (line 433) | static
function bmw_small_nextBlock (line 489) | void bmw_small_nextBlock(bmw_small_ctx_t *ctx, const void *block){
function bmw_small_lastBlock (line 501) | void bmw_small_lastBlock(bmw_small_ctx_t *ctx, const void *block, uint16...
function bmw224_init (line 541) | void bmw224_init(bmw224_ctx_t *ctx){
function bmw256_init (line 554) | void bmw256_init(bmw256_ctx_t *ctx){
function bmw224_nextBlock (line 564) | void bmw224_nextBlock(bmw224_ctx_t *ctx, const void *block){
function bmw256_nextBlock (line 568) | void bmw256_nextBlock(bmw256_ctx_t *ctx, const void *block){
function bmw224_lastBlock (line 572) | void bmw224_lastBlock(bmw224_ctx_t *ctx, const void *block, uint16_t len...
function bmw256_lastBlock (line 576) | void bmw256_lastBlock(bmw256_ctx_t *ctx, const void *block, uint16_t len...
function bmw224_ctx2hash (line 580) | void bmw224_ctx2hash(void *dest, const bmw224_ctx_t *ctx){
function bmw256_ctx2hash (line 584) | void bmw256_ctx2hash(void *dest, const bmw256_ctx_t *ctx){
function bmw224 (line 588) | void bmw224(void *dest, const void *msg, uint32_t length_b){
function bmw256 (line 600) | void bmw256(void *dest, const void *msg, uint32_t length_b){
FILE: bmw/bmw_small.h
type bmw_small_ctx_t (line 39) | typedef struct {
type bmw_small_ctx_t (line 44) | typedef bmw_small_ctx_t bmw224_ctx_t;
type bmw_small_ctx_t (line 45) | typedef bmw_small_ctx_t bmw256_ctx_t;
FILE: camellia/camellia.h
type camellia128_ctx_t (line 24) | typedef struct camellia128_ctx_s{
FILE: camellia/camellia128-stub.c
function camellia128_init (line 86) | void camellia128_init(const void *key, camellia128_ctx_t *s){
function camellia128_enc (line 141) | void camellia128_enc(void *block, const camellia128_ctx_t *s){
function camellia128_dec (line 195) | void camellia128_dec(void *block, const camellia128_ctx_t *s){
FILE: camellia/camellia_C.c
function rol (line 37) | static
function ror (line 44) | static
function rol32 (line 51) | static
function camellia_s1 (line 87) | static
function camellia_s2 (line 94) | static
function camellia_s3 (line 101) | static
function camellia_s4 (line 108) | static
function camellia_s (line 115) | static
function camellia_p (line 135) | static
function camellia_f (line 171) | static
function camellia_fl (line 180) | static
function camellia_fl_inv (line 211) | static
function camellia128_ctx_dump (line 253) | void camellia128_ctx_dump(camellia128_ctx_t *s){
function camellia_sigma (line 263) | static
function camellia128_init (line 275) | void camellia128_init(const void *key, camellia128_ctx_t *s){
function camellia128_keyop (line 308) | static
function camellia128_keyop_inv (line 325) | static
function camellia_6rounds (line 357) | static
function change_endian (line 386) | static
function camellia128_enc (line 398) | void camellia128_enc(void *block, const camellia128_ctx_t *s){
function camellia128_dec (line 452) | void camellia128_dec(void *block, const camellia128_ctx_t *s){
FILE: cast5/cast5.c
function cast5_init_A (line 50) | static
function cast5_init_M (line 73) | static
function cast5_init_rM (line 96) | static
function cast5_init (line 132) | void cast5_init(const void *key, uint16_t keylength_b, cast5_ctx_t *s){
function cast5_f1 (line 200) | static
function cast5_f2 (line 230) | static
function cast5_f3 (line 261) | static
function cast5_enc (line 294) | void cast5_enc(void *block, const cast5_ctx_t *s){
function cast5_dec (line 318) | void cast5_dec(void *block, const cast5_ctx_t *s){
FILE: cast5/cast5.h
type cast5_ctx_t (line 51) | typedef struct cast5_ctx_st{
FILE: cast6/cast6.c
function kr (line 19) | static
function set_kr (line 33) | static
function f1 (line 59) | static
function f2 (line 71) | static
function f3 (line 83) | static
function q (line 105) | static
function qbar (line 113) | static
function cast6_enc (line 121) | void cast6_enc(void *buffer, const cast6_ctx_t *ctx){
function cast6_dec (line 137) | void cast6_dec(void *buffer, const cast6_ctx_t *ctx){
function w (line 182) | static
function cast6_init (line 231) | void cast6_init(const void *key, uint16_t keysize_b, cast6_ctx_t *ctx){
FILE: cast6/cast6.h
type cast6_ctx_t (line 9) | typedef struct cast6_ctx_st{
FILE: cscipher/cscipher.h
type cscipher_ctx_t (line 23) | typedef struct {
FILE: cscipher/cscipher_small.c
function p (line 45) | static
function m (line 76) | static uint16_t m(uint16_t a){
function m_inv (line 87) | static uint16_t m_inv(uint16_t a){
function cscipher_enc (line 98) | void cscipher_enc(void *buffer, const cscipher_ctx_t *ctx){
function cscipher_dec (line 126) | void cscipher_dec(void *buffer, const cscipher_ctx_t *ctx){
function cscipher_init (line 149) | void cscipher_init(const void *key, cscipher_ctx_t *ctx){
FILE: cubehash/cubehash.c
function cubehash_round (line 49) | static void cubehash_round(cubehash_ctx_t *ctx){
function cubehash_init (line 82) | void cubehash_init(uint8_t r, uint8_t b, uint16_t h, cubehash_ctx_t *ctx){
function cubehash_nextBlock (line 94) | void cubehash_nextBlock(cubehash_ctx_t *ctx, void *block){
function cubehash_lastBlock (line 102) | void cubehash_lastBlock(cubehash_ctx_t *ctx, void *block, uint16_t lengt...
function cubehash_ctx2hash (line 120) | void cubehash_ctx2hash(void *dest, uint16_t length_b, cubehash_ctx_t *ctx){
function cubehash224_init (line 126) | void cubehash224_init(cubehash_ctx_t *ctx){
function cubehash224_ctx2hash (line 130) | void cubehash224_ctx2hash(void *dest, cubehash_ctx_t *ctx){
function cubehash256_init (line 136) | void cubehash256_init(cubehash_ctx_t *ctx){
function cubehash256_ctx2hash (line 140) | void cubehash256_ctx2hash(void *dest, cubehash_ctx_t *ctx){
function cubehash384_init (line 146) | void cubehash384_init(cubehash_ctx_t *ctx){
function cubehash384_ctx2hash (line 150) | void cubehash384_ctx2hash(void *dest, cubehash_ctx_t *ctx){
function cubehash512_init (line 156) | void cubehash512_init(cubehash_ctx_t *ctx){
function cubehash512_ctx2hash (line 160) | void cubehash512_ctx2hash(void *dest, cubehash_ctx_t *ctx){
FILE: cubehash/cubehash.h
type cubehash_ctx_t (line 34) | typedef struct {
FILE: des/des.c
function permute (line 206) | void permute(const uint8_t *ptable, const uint8_t *in, uint8_t *out){
function changeendian32 (line 226) | void changeendian32(uint32_t * a){
function shiftkey (line 234) | static inline
function shiftkey_inv (line 242) | static inline
function splitin6bitwords (line 251) | static inline
function substitute (line 261) | static inline
function des_f (line 272) | uint32_t des_f(uint32_t r, uint8_t *kr){
function des_enc (line 300) | void des_enc(void *out, const void *in, const void *key){
function des_dec (line 336) | void des_dec(void *out, const void *in, const uint8_t *key){
function tdes_enc (line 371) | void tdes_enc(void *out, void *in, const void *key){
function tdes_dec (line 379) | void tdes_dec(void *out, void *in, const uint8_t *key){
FILE: dsa/dsa.h
type dsa_domainparameters_t (line 27) | typedef struct{
type bigint_t (line 33) | typedef bigint_t dsa_pubkey_t;
type bigint_t (line 34) | typedef bigint_t dsa_privkey_t;
type dsa_signature_t (line 36) | typedef struct{
type dsa_ctx_t (line 41) | typedef struct{
FILE: dsa/dsa_key_blob.c
function load_dsa_key_blob (line 273) | void load_dsa_key_blob(dsa_ctx_t *ctx){
FILE: dsa/dsa_sign.c
function dsa_sign_bigint (line 27) | uint8_t dsa_sign_bigint(dsa_signature_t *s, const bigint_t *m,
function dsa_sign_message (line 50) | uint8_t dsa_sign_message(dsa_signature_t *s, const void *m, uint16_t m_l...
FILE: dsa/dsa_verify.c
function dsa_verify_bigint (line 25) | uint8_t dsa_verify_bigint(const dsa_signature_t *s, const bigint_t *m,
function dsa_verify_message (line 57) | uint8_t dsa_verify_message(const dsa_signature_t *s, const void *m, uint...
FILE: ecdsa/ecc.h
type ecc_chudnovsky_point_t (line 25) | typedef struct {
type ecc_affine_point_t (line 33) | typedef struct {
type ecc_curve_sp_t (line 43) | typedef struct {
FILE: ecdsa/ecc_chudnovsky.c
function ecc_chudnovsky_point_alloc (line 41) | uint8_t ecc_chudnovsky_point_alloc(ecc_chudnovsky_point_t *p, size_t len...
function ecc_chudnovsky_point_free (line 80) | void ecc_chudnovsky_point_free(ecc_chudnovsky_point_t *p){
function ecc_affine_to_chudnovsky_point (line 101) | uint8_t ecc_affine_to_chudnovsky_point(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_to_affine_point (line 125) | uint8_t ecc_chudnovsky_to_affine_point(ecc_affine_point_t *dest,
function ecc_chudnovsky_point_print (line 157) | void ecc_chudnovsky_point_print(const ecc_chudnovsky_point_t *p){
function ecc_chudnovsky_point_double_sp (line 175) | uint8_t ecc_chudnovsky_point_double_sp(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_point_copy (line 255) | void ecc_chudnovsky_point_copy(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_point_add_sp (line 264) | uint8_t ecc_chudnovsky_point_add_sp(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_double_and_add (line 378) | uint8_t ecc_chudnovsky_double_and_add(ecc_chudnovsky_point_t *dest,
function bigint_to_naf (line 407) | uint8_t bigint_to_naf(uint8_t *dest, uint16_t *length, const bigint_t *s...
function print_naf (line 446) | void print_naf(uint8_t *naf, uint16_t length){
function ecc_chudnovsky_naf_multiplication (line 466) | uint8_t ecc_chudnovsky_naf_multiplication(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_multiplication (line 515) | uint8_t ecc_chudnovsky_multiplication(ecc_chudnovsky_point_t *dest,
function ecc_chudnovsky_multipy_and_sum (line 524) | uint8_t ecc_chudnovsky_multipy_and_sum(ecc_chudnovsky_point_t *dest,
FILE: ecdsa/ecdsa.h
type ecdsa_signature_t (line 26) | typedef struct{
type bigint_t (line 31) | typedef bigint_t ecdsa_privkey_t;
type ecc_affine_point_t (line 32) | typedef ecc_affine_point_t ecdsa_pubkey_t;
type ecdsa_ctx_t (line 34) | typedef struct{
FILE: ecdsa/ecdsa_sign.c
function ecdsa_signature_alloc (line 34) | uint8_t ecdsa_signature_alloc(ecdsa_signature_t *s, size_t length_B){
function ecdsa_signature_free (line 49) | void ecdsa_signature_free(ecdsa_signature_t *s){
function ecdsa_sign_bigint (line 54) | uint8_t ecdsa_sign_bigint(ecdsa_signature_t *s, const bigint_t *m,
function ecdsa_sign_hash (line 114) | uint8_t ecdsa_sign_hash(ecdsa_signature_t *s, const void *hash,
function ecdsa_sign_message (line 172) | uint8_t ecdsa_sign_message(ecdsa_signature_t *s, const void *m, uint16_t...
FILE: ecdsa/nist_p192.c
function bigint_reduce_p192 (line 142) | int bigint_reduce_p192(bigint_t *a){
FILE: echo/aes_enc_round.h
type aes_cipher_state_t (line 23) | typedef struct{
type aes_roundkey_t (line 27) | typedef struct{
FILE: echo/echo.c
function mixcol (line 46) | static void mixcol(uint8_t *s){
function dump_state (line 73) | static void dump_state(void *s){
function echo_compress (line 94) | static void echo_compress(uint8_t *s, uint8_t iterations, uint64_t *c, v...
function compress512 (line 172) | static void compress512(void *v, void *m, uint64_t *c, void *salt){
function compress1024 (line 189) | static void compress1024(void *v, void *m, uint64_t *c, void *salt){
function echo_small_nextBlock (line 204) | void echo_small_nextBlock(echo_small_ctx_t *ctx, void *block){
function echo_small_lastBlock (line 209) | void echo_small_lastBlock(echo_small_ctx_t *ctx, void *block, uint16_t l...
function echo_large_nextBlock (line 236) | void echo_large_nextBlock(echo_large_ctx_t *ctx, void *block){
function echo_large_lastBlock (line 241) | void echo_large_lastBlock(echo_large_ctx_t *ctx, void *block, uint16_t l...
function echo_ctx2hash (line 267) | void echo_ctx2hash(void *dest, uint16_t length_b, echo_small_ctx_t *ctx){
function echo224_ctx2hash (line 271) | void echo224_ctx2hash(void *dest, echo_small_ctx_t *ctx){
function echo256_ctx2hash (line 275) | void echo256_ctx2hash(void *dest, echo_small_ctx_t *ctx){
function echo384_ctx2hash (line 281) | void echo384_ctx2hash(void *dest, echo_large_ctx_t *ctx){
function echo512_ctx2hash (line 285) | void echo512_ctx2hash(void *dest, echo_large_ctx_t *ctx){
function echo224_init (line 291) | void echo224_init(echo_small_ctx_t *ctx){
function echo256_init (line 302) | void echo256_init(echo_small_ctx_t *ctx){
function echo384_init (line 315) | void echo384_init(echo_large_ctx_t *ctx){
function echo512_init (line 327) | void echo512_init(echo_large_ctx_t *ctx){
FILE: echo/echo.h
type echo_small_ctx_t (line 39) | typedef struct{
type echo_large_ctx_t (line 46) | typedef struct{
FILE: entropium/entropium.c
function entropium_addEntropy (line 68) | void entropium_addEntropy(unsigned length_b, const void *data){
function entropium_getRandomBlock (line 88) | void entropium_getRandomBlock(void *b){
function entropium_getRandomByte (line 108) | uint8_t entropium_getRandomByte(void){
function entropium_fillBlockRandom (line 119) | void entropium_fillBlockRandom(void *block, unsigned length_B){
FILE: grain/grain.c
function grain_enc (line 57) | uint8_t grain_enc(grain_ctx_t *ctx){
function grain_getbyte (line 140) | uint8_t grain_getbyte(grain_ctx_t *ctx){
function reverse_bits (line 152) | static
function grain_init (line 169) | void grain_init(const void *key, const void *iv, grain_ctx_t *ctx){
FILE: grain/grain.h
type grain_ctx_t (line 33) | typedef struct gain_ctx_st{
FILE: groestl/groestl_large.c
function dump_m (line 43) | void dump_m(const uint8_t *m){
function shift_columns (line 68) | static
function groestl_large_rounds (line 96) | void groestl_large_rounds(uint8_t *m, uint8_t q){
function groestl384_init (line 155) | void groestl384_init(groestl384_ctx_t *ctx){
function groestl512_init (line 162) | void groestl512_init(groestl512_ctx_t *ctx){
function groestl_large_nextBlock (line 168) | void groestl_large_nextBlock(groestl_large_ctx_t *ctx, const void *block){
function groestl_large_lastBlock (line 187) | void groestl_large_lastBlock(groestl_large_ctx_t *ctx, const void *block...
function groestl_large_ctx2hash (line 209) | void groestl_large_ctx2hash(void *dest, const groestl_large_ctx_t *ctx, ...
function groestl384_ctx2hash (line 221) | void groestl384_ctx2hash(void *dest, const groestl384_ctx_t *ctx){
function groestl512_ctx2hash (line 225) | void groestl512_ctx2hash(void *dest, const groestl512_ctx_t *ctx){
function groestl384_nextBlock (line 229) | void groestl384_nextBlock(groestl384_ctx_t *ctx, const void *block){
function groestl512_nextBlock (line 233) | void groestl512_nextBlock(groestl512_ctx_t *ctx, const void *block){
function groestl384_lastBlock (line 237) | void groestl384_lastBlock(groestl384_ctx_t *ctx, const void *block, uint...
function groestl512_lastBlock (line 241) | void groestl512_lastBlock(groestl512_ctx_t *ctx, const void *block, uint...
function groestl384 (line 245) | void groestl384(void *dest, const void *msg, uint32_t length_b){
function groestl512 (line 257) | void groestl512(void *dest, const void *msg, uint32_t length_b){
FILE: groestl/groestl_large.h
type groestl_large_ctx_t (line 39) | typedef struct {
type groestl_large_ctx_t (line 44) | typedef groestl_large_ctx_t groestl384_ctx_t;
type groestl_large_ctx_t (line 45) | typedef groestl_large_ctx_t groestl512_ctx_t;
FILE: groestl/groestl_small.c
function dump_m (line 43) | void dump_m(const uint8_t *m){
function shift_columns (line 78) | static
function groestl_small_rounds (line 100) | void groestl_small_rounds(uint8_t *m, uint8_t q){
function groestl224_init (line 163) | void groestl224_init(groestl224_ctx_t *ctx){
function groestl256_init (line 169) | void groestl256_init(groestl256_ctx_t *ctx){
function groestl_small_nextBlock (line 175) | void groestl_small_nextBlock(groestl_small_ctx_t *ctx, const void *block){
function groestl_small_lastBlock (line 193) | void groestl_small_lastBlock(groestl_small_ctx_t *ctx, const void *block...
function groestl_small_ctx2hash (line 215) | void groestl_small_ctx2hash(void *dest, const groestl_small_ctx_t *ctx, ...
function groestl224_ctx2hash (line 227) | void groestl224_ctx2hash(void *dest, const groestl224_ctx_t *ctx){
function groestl256_ctx2hash (line 231) | void groestl256_ctx2hash(void *dest, const groestl256_ctx_t *ctx){
function groestl224_nextBlock (line 235) | void groestl224_nextBlock(groestl224_ctx_t *ctx, const void *block){
function groestl256_nextBlock (line 239) | void groestl256_nextBlock(groestl256_ctx_t *ctx, const void *block){
function groestl224_lastBlock (line 243) | void groestl224_lastBlock(groestl224_ctx_t *ctx, const void *block, uint...
function groestl256_lastBlock (line 247) | void groestl256_lastBlock(groestl256_ctx_t *ctx, const void *block, uint...
function groestl224 (line 251) | void groestl224(void *dest, const void *msg, uint32_t length_b){
function groestl256 (line 263) | void groestl256(void *dest, const void *msg, uint32_t length_b){
FILE: groestl/groestl_small.h
type groestl_small_ctx_t (line 39) | typedef struct {
type groestl_small_ctx_t (line 44) | typedef groestl_small_ctx_t groestl224_ctx_t;
type groestl_small_ctx_t (line 45) | typedef groestl_small_ctx_t groestl256_ctx_t;
FILE: hashfunction_descriptor.h
type hfdesc_t (line 23) | typedef struct {
type hfgen_ctx_t (line 52) | typedef struct{
FILE: hfal/hfal-basic.c
function hfal_hash_init (line 25) | uint8_t hfal_hash_init(const hfdesc_t *hash_descriptor, hfgen_ctx_t *ctx){
function hfal_hash_nextBlock (line 37) | void hfal_hash_nextBlock(hfgen_ctx_t *ctx, const void *block){
function hfal_hash_lastBlock (line 44) | void hfal_hash_lastBlock(hfgen_ctx_t *ctx, const void *block, uint16_t l...
function hfal_hash_ctx2hash (line 51) | void hfal_hash_ctx2hash(void *dest, hfgen_ctx_t *ctx){
function hfal_hash_free (line 58) | void hfal_hash_free(hfgen_ctx_t *ctx){
function hfal_hash_mem (line 67) | void hfal_hash_mem(const hfdesc_t *hash_descriptor, void *dest, const vo...
function hfal_hash_getBlocksize (line 92) | uint16_t hfal_hash_getBlocksize(const hfdesc_t *hash_descriptor){
function hfal_hash_getHashsize (line 98) | uint16_t hfal_hash_getHashsize(const hfdesc_t *hash_descriptor){
function hfal_hash_getCtxsize_B (line 104) | uint16_t hfal_hash_getCtxsize_B(const hfdesc_t *hash_descriptor){
FILE: hfal/hfal-hmac.c
function hfal_hmac_init (line 28) | uint8_t hfal_hmac_init(const hfdesc_t *hash_descriptor,
function hfal_hmac_nextBlock (line 70) | void hfal_hmac_nextBlock(hfhmacgen_ctx_t *ctx, const void *block){
function hfal_hmac_lastBlock (line 76) | void hfal_hmac_lastBlock(hfhmacgen_ctx_t *ctx, const void *block, uint16...
function hfal_hmac_ctx2mac (line 88) | void hfal_hmac_ctx2mac(void *dest, hfhmacgen_ctx_t *ctx){
function hfal_hmac_free (line 94) | void hfal_hmac_free(hfhmacgen_ctx_t *ctx){
function hfal_hmac_mem (line 105) | void hfal_hmac_mem(const hfdesc_t *hash_descriptor, const void *key, uin...
function hfal_hmac_getBlocksize (line 119) | uint16_t hfal_hmac_getBlocksize(const hfdesc_t *hash_descriptor){
function hfal_hmac_getMACsize (line 123) | uint16_t hfal_hmac_getMACsize(const hfdesc_t *hash_descriptor){
FILE: hfal/hfal-hmac.h
type hfhmacgen_ctx_t (line 26) | typedef struct {
FILE: hfal/hfal-nessie.c
function hfal_nessie (line 33) | void hfal_nessie(const hfdesc_t *hd){
function hfal_nessie_multiple (line 51) | void hfal_nessie_multiple(const hfdesc_t *const *hd_list){
FILE: hfal/hfal-performance.c
function hfal_performance (line 42) | void hfal_performance(const hfdesc_t *hd){
function hfal_stacksize (line 114) | void hfal_stacksize(const hfdesc_t *hd){
function hfal_performance_multiple (line 180) | void hfal_performance_multiple(const hfdesc_t *const *hd_list){
FILE: hfal/hfal-test.c
function hfal_test (line 34) | void hfal_test(const hfdesc_t *hd, void *msg, uint32_t length_b){
FILE: hfal/hfal_skein1024.c
function skein1024_128_init (line 42) | void skein1024_128_init(skein1024_ctx_t *ctx){
function skein1024_160_init (line 45) | void skein1024_160_init(skein1024_ctx_t *ctx){
function skein1024_224_init (line 48) | void skein1024_224_init(skein1024_ctx_t *ctx){
function skein1024_256_init (line 51) | void skein1024_256_init(skein1024_ctx_t *ctx){
function skein1024_384_init (line 54) | void skein1024_384_init(skein1024_ctx_t *ctx){
function skein1024_512_init (line 57) | void skein1024_512_init(skein1024_ctx_t *ctx){
function skein1024_1024_init (line 60) | void skein1024_1024_init(skein1024_ctx_t *ctx){
FILE: hfal/hfal_skein256.c
function skein256_128_init (line 41) | void skein256_128_init(skein256_ctx_t *ctx){
function skein256_160_init (line 44) | void skein256_160_init(skein256_ctx_t *ctx){
function skein256_224_init (line 47) | void skein256_224_init(skein256_ctx_t *ctx){
function skein256_256_init (line 50) | void skein256_256_init(skein256_ctx_t *ctx){
function skein256_384_init (line 53) | void skein256_384_init(skein256_ctx_t *ctx){
function skein256_512_init (line 56) | void skein256_512_init(skein256_ctx_t *ctx){
FILE: hfal/hfal_skein512.c
function skein512_128_init (line 42) | void skein512_128_init(skein512_ctx_t *ctx){
function skein512_160_init (line 45) | void skein512_160_init(skein512_ctx_t *ctx){
function skein512_224_init (line 48) | void skein512_224_init(skein512_ctx_t *ctx){
function skein512_256_init (line 51) | void skein512_256_init(skein512_ctx_t *ctx){
function skein512_384_init (line 54) | void skein512_384_init(skein512_ctx_t *ctx){
function skein512_512_init (line 57) | void skein512_512_init(skein512_ctx_t *ctx){
function skein512_1024_init (line 60) | void skein512_1024_init(skein512_ctx_t *ctx){
FILE: hmac-md5/hmac-md5.c
function hmac_md5_init (line 42) | void hmac_md5_init(hmac_md5_ctx_t *s, void *key, uint16_t keylength_b){
function hmac_md5_nextBlock (line 70) | void hmac_md5_nextBlock(hmac_md5_ctx_t *s, const void *block){
function hmac_md5_lastBlock (line 74) | void hmac_md5_lastBlock(hmac_md5_ctx_t *s, const void *block, uint16_t l...
function hmac_md5_final (line 78) | void hmac_md5_final(void *dest, hmac_md5_ctx_t *s){
function hmac_md5 (line 95) | void hmac_md5(void *dest, void *key, uint16_t keylength_b, void *msg, ui...
FILE: hmac-md5/hmac-md5.h
type hmac_md5_ctx_t (line 29) | typedef struct{
FILE: hmac-sha1/hmac-sha1.c
function hmac_sha1_init (line 43) | void hmac_sha1_init(hmac_sha1_ctx_t *s, const void *key, uint16_t keylen...
function hmac_sha1_nextBlock (line 72) | void hmac_sha1_nextBlock(hmac_sha1_ctx_t *s, const void *block){
function hmac_sha1_lastBlock (line 75) | void hmac_sha1_lastBlock(hmac_sha1_ctx_t *s, const void *block, uint16_t...
function hmac_sha1_final (line 84) | void hmac_sha1_final(void *dest, hmac_sha1_ctx_t *s){
function hmac_sha1 (line 96) | void hmac_sha1(void *dest, const void *key, uint16_t keylength_b, const ...
FILE: hmac-sha1/hmac-sha1.h
type hmac_sha1_ctx_t (line 29) | typedef struct{
FILE: hmac-sha256/hmac-sha256.c
function hmac_sha256_init (line 42) | void hmac_sha256_init(hmac_sha256_ctx_t *s, const void *key, uint16_t ke...
function hmac_sha256_nextBlock (line 71) | void hmac_sha256_nextBlock(hmac_sha256_ctx_t *s, const void *block){
function hmac_sha256_lastBlock (line 75) | void hmac_sha256_lastBlock(hmac_sha256_ctx_t *s, const void *block, uint...
function hmac_sha256_final (line 84) | void hmac_sha256_final(void *dest, hmac_sha256_ctx_t *s){
function hmac_sha256 (line 96) | void hmac_sha256(void *dest, const void *key, uint16_t keylength_b, cons...
FILE: hmac-sha256/hmac-sha256.h
type hmac_sha256_ctx_t (line 30) | typedef struct {
FILE: host/bigint_test.rb
function readconfigfile (line 36) | def readconfigfile(fname, conf)
function expmod (line 68) | def expmod(base, power, mod)
function gcdext (line 82) | def gcdext(x,y)
function reset_system (line 119) | def reset_system
function init_system (line 130) | def init_system(test_prog)
function wait_for_prompt (line 146) | def wait_for_prompt(prompt)
function screen_progress (line 169) | def screen_progress(v)
function add_test (line 182) | def add_test(a,b)
function mul_test (line 231) | def mul_test(a,b)
function add_scale_test_dummy (line 279) | def add_scale_test_dummy(a, b, scale)
function add_scale_test (line 284) | def add_scale_test(a, b, scale)
function square_test (line 325) | def square_test(a)
function reduce_test (line 363) | def reduce_test(a,b)
function mulmod_test (line 414) | def mulmod_test(a,b,c)
function expmod_test (line 479) | def expmod_test(a,b,c)
function gcdext_test (line 542) | def gcdext_test(a,b)
function run_test_add (line 602) | def run_test_add(skip=0)
function run_test_add_scale (line 638) | def run_test_add_scale(skip=0)
function run_test_add_scale_dummy (line 675) | def run_test_add_scale_dummy(skip=0)
function run_test_mul (line 712) | def run_test_mul(skip=0)
function run_test_mul_word (line 747) | def run_test_mul_word(skip=0)
function run_test_square (line 765) | def run_test_square(skip=0)
function run_test_reduce (line 782) | def run_test_reduce(skip=0)
function run_test_expmod (line 809) | def run_test_expmod(skip=0)
function run_test_expmodmont (line 839) | def run_test_expmodmont(skip=0)
function run_test_mulmod (line 869) | def run_test_mulmod(skip=0)
function run_test_gcdext (line 904) | def run_test_gcdext(skip=0)
function init_serialport (line 929) | def init_serialport(conf)
FILE: host/cmacvs_test.rb
function readconfigfile (line 35) | def readconfigfile(fname, conf)
function reset_system (line 67) | def reset_system
function scan_system (line 78) | def scan_system
function init_system (line 94) | def init_system(algo_select, algo_id)
function get_mac (line 113) | def get_mac
function get_result (line 126) | def get_result
function send_test (line 140) | def send_test(klen, mlen, tlen, key, msg, mac=nil)
function get_next_kv_pair (line 163) | def get_next_kv_pair(file)
function run_test_gen (line 177) | def run_test_gen(filename, skip=0)
function run_test_ver (line 226) | def run_test_ver(filename, skip=0)
FILE: host/data2wiki.rb
function get_size_string (line 37) | def get_size_string(impl, algo)
function process_hashfunction (line 68) | def process_hashfunction(fin, name, impl)
function process_file (line 126) | def process_file(fname)
FILE: host/fix-wiki-size.rb
function fix_file (line 39) | def fix_file(fin, fout, supress)
FILE: host/get_performance.rb
function readconfigfile (line 32) | def readconfigfile(fname, conf)
function read_line (line 64) | def read_line(error_msg=true)
function readPerformanceVector (line 80) | def readPerformanceVector(param)
FILE: host/get_test.rb
function read_line (line 27) | def read_line(error_msg=true)
function readTestVector (line 44) | def readTestVector(param)
FILE: host/gf256_table_gen.c
function print_help (line 46) | void print_help(void){
function main (line 64) | int main(int argc, char** argv){
FILE: host/gf256mul.c
function gf256mul (line 30) | uint8_t gf256mul(uint8_t a, uint8_t b, uint8_t reducer){
FILE: host/nessie_check.rb
function skip_header (line 23) | def skip_header(file)
function get_next_assign (line 42) | def get_next_assign(file, i)
function compare (line 76) | def compare(fname1, fname2)
FILE: host/optimize_shift.rb
function transform_shift (line 38) | def transform_shift(value)
function transform_singleshift (line 48) | def transform_singleshift(value)
FILE: host/rsa_pkcs1v15_check.rb
function read_line_from_device (line 36) | def read_line_from_device()
function readconfigfile (line 53) | def readconfigfile(fname, conf)
function reset_system (line 85) | def reset_system
function read_block (line 95) | def read_block(f)
function get_next_block (line 127) | def get_next_block(f)
function key_consitency_check (line 154) | def key_consitency_check(k)
function process_file (line 158) | def process_file(f, skip_key=1, skip_vec=1)
function convert_key (line 217) | def convert_key(k_seq)
function wait_for_dot (line 228) | def wait_for_dot
function load_bigint (line 234) | def load_bigint(d)
function hexdump (line 252) | def hexdump(a)
function str_hexdump (line 262) | def str_hexdump(a)
function load_key (line 274) | def load_key(k)
function strip_leading_zeros (line 287) | def strip_leading_zeros(a)
function check_tv (line 295) | def check_tv(tv)
FILE: host/shavs_test2.rb
function readconfigfile (line 35) | def readconfigfile(fname, conf)
function reset_system (line 67) | def reset_system
function scan_system (line 78) | def scan_system
function init_system (line 94) | def init_system(algo_select)
function get_md (line 114) | def get_md
function send_md (line 140) | def send_md(md_string)
function run_test (line 173) | def run_test(filename, skip=0)
FILE: host/sumsize.rb
function scanFile (line 3) | def scanFile (filename)
FILE: jh/jh_simple.h
type jh_ctx_t (line 34) | typedef struct {
FILE: jh/jh_simple_aux.c
function jh_init (line 35) | void jh_init(uint16_t hashlen_b, jh_ctx_t *ctx){
function jh_nextBlock (line 43) | void jh_nextBlock(jh_ctx_t *ctx, void *block){
function jh_lastBlock (line 50) | void jh_lastBlock(jh_ctx_t *ctx, void *block, uint16_t length_b){
function jh_ctx2hash (line 80) | void jh_ctx2hash(void *dest, uint16_t length_b, jh_ctx_t *ctx){
function jh224_init (line 85) | void jh224_init(jh_ctx_t *ctx){
function jh224_ctx2hash (line 89) | void jh224_ctx2hash(void *dest, jh_ctx_t *ctx){
function jh256_init (line 93) | void jh256_init(jh_ctx_t *ctx){
function jh256_ctx2hash (line 97) | void jh256_ctx2hash(void *dest, jh_ctx_t *ctx){
function jh384_init (line 101) | void jh384_init(jh_ctx_t *ctx){
function jh384_ctx2hash (line 105) | void jh384_ctx2hash(void *dest, jh_ctx_t *ctx){
function jh512_init (line 109) | void jh512_init(jh_ctx_t *ctx){
function jh512_ctx2hash (line 113) | void jh512_ctx2hash(void *dest, jh_ctx_t *ctx){
FILE: jh/jh_simple_small_core.c
function jh_l (line 45) | static
function jh_round (line 52) | static
function jh_next_round_const (line 81) | static
function group (line 109) | static inline
function degroup (line 125) | static inline
function jh_encrypt (line 141) | void jh_encrypt(uint8_t *a){
FILE: jh/jh_simple_speed_core.c
function jh_round (line 34) | static
function group (line 78) | static inline
function degroup (line 98) | static inline
function jh_encrypt (line 116) | void jh_encrypt(uint8_t *a){
FILE: keccak/keccak.c
function keccak_dump_state (line 37) | void keccak_dump_state(uint64_t a[5][5]){
function keccak_dump_ctx (line 50) | void keccak_dump_ctx(keccak_ctx_t *ctx){
function keccak_round (line 112) | static inline
function keccak_f1600 (line 181) | void keccak_f1600(void *a){
function keccak_nextBlock (line 193) | void keccak_nextBlock(keccak_ctx_t *ctx, const void *block){
function keccak_lastBlock (line 198) | void keccak_lastBlock(keccak_ctx_t *ctx, const void *block, uint16_t len...
function keccak_ctx2hash (line 224) | void keccak_ctx2hash(void *dest, uint16_t length_b, keccak_ctx_t *ctx){
function keccak224_ctx2hash (line 234) | void keccak224_ctx2hash(void *dest, keccak_ctx_t *ctx){
function keccak256_ctx2hash (line 238) | void keccak256_ctx2hash(void *dest, keccak_ctx_t *ctx){
function keccak384_ctx2hash (line 242) | void keccak384_ctx2hash(void *dest, keccak_ctx_t *ctx){
function keccak512_ctx2hash (line 246) | void keccak512_ctx2hash(void *dest, keccak_ctx_t *ctx){
function keccak_init (line 256) | void keccak_init(uint16_t r, keccak_ctx_t *ctx){
function keccak224_init (line 262) | void keccak224_init(keccak_ctx_t *ctx){
function keccak256_init (line 266) | void keccak256_init(keccak_ctx_t *ctx){
function keccak384_init (line 270) | void keccak384_init(keccak_ctx_t *ctx){
function keccak512_init (line 274) | void keccak512_init(keccak_ctx_t *ctx){
FILE: keccak/keccak.h
type keccak_ctx_t (line 34) | typedef struct{
FILE: keysize_descriptor.c
function is_valid_keysize_P (line 32) | uint8_t is_valid_keysize_P(PGM_VOID_P ks_desc, uint16_t keysize){
function get_keysize (line 76) | uint16_t get_keysize(PGM_VOID_P ks_desc){
function get_keysizes (line 88) | uint16_t get_keysizes(PGM_VOID_P ks_desc, uint16_t** list){
FILE: keysize_descriptor.h
type keysize_desc_list_t (line 40) | typedef struct{ /* keysize is valid if listed in items */
type keysize_desc_range_t (line 45) | typedef struct{ /* keysize is valid if min<=keysize<=max */
type keysize_desc_arg_range_t (line 50) | typedef struct{ /* keysize is valid if min<=keysize<=max and if keysize ...
FILE: khazad/khazad.c
function khazad_sbox (line 76) | uint8_t khazad_sbox(uint8_t a){
function gamma_1 (line 95) | static void gamma_1(uint8_t *a){
function theta (line 129) | static void theta(uint8_t *a){
function khazad_round (line 149) | static void khazad_round(uint8_t *a, const uint8_t *k){
function khazad_init (line 157) | void khazad_init(const void *key, khazad_ctx_t *ctx){
function khazad_enc (line 185) | void khazad_enc(void *buffer, const khazad_ctx_t *ctx){
function khazad_dec (line 197) | void khazad_dec(void *buffer, const khazad_ctx_t *ctx){
FILE: khazad/khazad.h
type khazad_ctx_t (line 25) | typedef struct {
FILE: md5/md5.c
function md5_init (line 36) | void md5_init(md5_ctx_t *s){
function md5_F (line 44) | static
function md5_G (line 49) | static
function md5_H (line 54) | static
function md5_I (line 59) | static
function md5_core (line 68) | static
function md5_nextBlock (line 88) | void md5_nextBlock(md5_ctx_t *state, const void *block){
function md5_lastBlock (line 140) | void md5_lastBlock(md5_ctx_t *state, const void *block, uint16_t length_b){
function md5_ctx2hash (line 173) | void md5_ctx2hash(md5_hash_t *dest, const md5_ctx_t *state){
function md5 (line 177) | void md5(md5_hash_t *dest, const void *msg, uint32_t length_b){
FILE: md5/md5.h
type md5_ctx_t (line 41) | typedef struct md5_ctx_st {
FILE: memxor/memxor_c.c
function memxor (line 5) | void memxor(void *dest, const void *src, uint16_t n){
FILE: mgf1/mgf1.c
function mgf1_short_seed (line 30) | void mgf1_short_seed(void *dest, const void *seed, uint8_t seed_len_B, u...
function mgf1 (line 53) | void mgf1(void *dest, const void *seed, uint16_t seed_len_B, uint16_t ou...
FILE: mgf1/mgf1.h
type mgf1_parameter_t (line 26) | typedef struct {
FILE: mickey128/mickey128.c
function memxor_P (line 47) | static
function clock_r (line 62) | static
function clock_s (line 206) | static
function clock_kg (line 230) | static
function mickey128_init (line 242) | void mickey128_init(void *key, uint16_t keysize_b,
function mickey128_getbit (line 259) | uint8_t mickey128_getbit(mickey128_ctx_t *ctx){
function mickey128_getbyte (line 266) | uint8_t mickey128_getbyte(mickey128_ctx_t *ctx){
FILE: mickey128/mickey128.h
type mickey128_ctx_t (line 6) | typedef struct mickey128_ctx_st{
FILE: mqq-sign/mqq160-sign.c
function memxor_idx (line 33) | static void memxor_idx(void *dest, const void *src, uint16_t length, uin...
function mqq_inv_affine_transformation (line 46) | static void mqq_inv_affine_transformation(const uint8_t *input_bytes, ui...
function mqq_q (line 97) | static uint8_t mqq_q(uint8_t i, uint8_t b1, uint8_t b2, const mqq160_sig...
function mqq160_sign (line 181) | void mqq160_sign(void *dest, const void *hash, const mqq160_sign_key_t *...
FILE: mqq-sign/mqq160-sign.h
type mqq160_sign_key_t (line 23) | typedef struct{
FILE: mqq-sign/mqq160-sign_P-stub.c
function mqq_q (line 51) | static uint8_t mqq_q(uint8_t i, uint8_t b1, uint8_t b2, const mqq160_sig...
function mqq160_sign_P (line 136) | void mqq160_sign_P(void *dest, const void *hash, const mqq160_sign_key_t...
FILE: mqq-sign/mqq160-sign_P.c
function memxor_idx_P (line 44) | static void memxor_idx_P(uint8_t *dest, const uint8_t *src, uint16_t len...
function mqq_inv_affine_transformation (line 57) | static void mqq_inv_affine_transformation(uint8_t *input_bytes, uint8_t ...
function mqq_q (line 106) | static uint8_t mqq_q(uint8_t i, uint8_t b1, uint8_t b2, const mqq160_sig...
function mqq160_sign_P (line 189) | void mqq160_sign_P(void *dest, const void *hash, const mqq160_sign_key_t...
FILE: mqq-sign/mqq160-sign_testkey.c
function mqq_load_pgm_key (line 88) | void mqq_load_pgm_key(void *buffer, mqq160_sign_key_t *key, const mqq160...
FILE: mugi/mugi.c
function changeendian64 (line 67) | uint64_t changeendian64(uint64_t a){
function rotl64 (line 83) | static
function rotr64 (line 92) | static
function mugi_f (line 104) | static void mugi_f(uint64_t *dest, uint64_t *a, uint64_t *b){
function mugi_rho (line 149) | static
function mugi_rho_init (line 163) | static
function mugi_lambda (line 176) | static
function mugi_init (line 189) | void mugi_init(const void *key, const void *iv, mugi_ctx_t *ctx){
function mugi_gen (line 212) | uint64_t mugi_gen(mugi_ctx_t *ctx){
FILE: mugi/mugi.h
type mugi_ctx_t (line 32) | typedef struct{
FILE: noekeon/noekeon.c
function gamma_1 (line 41) | static
function pi1 (line 58) | static
function pi2 (line 65) | static
function theta (line 72) | static
function noekeon_round (line 91) | static
function changendian32 (line 116) | static
function changendian (line 127) | static
function noekeon_enc (line 137) | void noekeon_enc(void *buffer, const void *key){
function noekeon_dec (line 161) | void noekeon_dec(void *buffer, const void *key){
function noekeon_init (line 192) | void noekeon_init(const void *key, noekeon_ctx_t *ctx){
FILE: noekeon/noekeon_ctr.h
type noekeon_ctr_ctx_t (line 35) | typedef struct{
FILE: noekeon/noekeon_prng.c
function random8 (line 36) | uint8_t random8(void){
function random_block (line 49) | void random_block(void *dest){
function srandom32 (line 55) | void srandom32(uint32_t seed){
function random_seed (line 59) | void random_seed(const void *buffer){
function random_add (line 63) | void random_add(const void *buffer){
FILE: noekeon/omac_noekeon_C.c
function omac_noekeon_init (line 8) | void omac_noekeon_init(omac_noekeon_ctx_t *ctx){
function omac_noekeon_tweak (line 13) | void omac_noekeon_tweak(uint8_t t, const void *key, omac_noekeon_ctx_t *...
function omac_noekeon_next (line 18) | void omac_noekeon_next(const void *buffer, const void *key, omac_noekeon...
function omac_noekeon_comppad (line 23) | static
function omac_noekeon_last (line 45) | void omac_noekeon_last(const void *buffer, uint8_t length_b, const void ...
function omac_noekeon (line 58) | void omac_noekeon(void *dest, const void *msg, uint16_t msglength_b,
FILE: present/present128.c
function key_update_128 (line 35) | static
function key_update_128_inv (line 65) | static
function present128_init (line 96) | void present128_init(const uint8_t *key, uint8_t keysize_b, present128_c...
function present128_enc (line 105) | void present128_enc(void *buffer, present128_ctx_t *ctx){
function present128_dec (line 109) | void present128_dec(void *buffer, present128_ctx_t *ctx){
FILE: present/present128.h
type present128_ctx_t (line 24) | typedef struct __attribute__((packed)) present128_ctx_st {
FILE: present/present80.c
function key_update (line 35) | static
function key_update_inv (line 65) | static
function present80_init (line 95) | void present80_init(const uint8_t *key, uint8_t keysize_b, present80_ctx...
function present80_enc (line 104) | void present80_enc(void *buffer, present80_ctx_t *ctx){
function present80_dec (line 108) | void present80_dec(void *buffer, present80_ctx_t *ctx){
FILE: present/present80.h
type present80_ctx_t (line 24) | typedef struct __attribute__((packed)) present80_ctx_st {
FILE: present/present_common.c
function present_sbox (line 33) | uint8_t present_sbox(uint8_t b){
function present_sbox_inv (line 43) | uint8_t present_sbox_inv(uint8_t b){
function present_p (line 53) | void present_p(uint8_t *o, uint8_t *i){
function present_generic_enc (line 70) | void present_generic_enc(void *buffer, uint8_t *ctx, uint8_t ksize_B,
function present_generic_dec (line 86) | void present_generic_dec(void *buffer, uint8_t *ctx, uint8_t ksize_B,
FILE: present/present_speed.c
function key_update (line 33) | static
function present_init (line 63) | void present_init(const uint8_t *key, uint8_t keysize_b, present_ctx_t *...
function present_enc (line 74) | void present_enc(void *buffer, present_ctx_t *ctx){
function present_dec (line 89) | void present_dec(void *buffer, present_ctx_t *ctx){
FILE: present/present_speed.h
type present_ctx_t (line 24) | typedef struct present_ctx_st{
FILE: rabbit/rabbit.h
type rabbit_ctx_t (line 25) | typedef struct {
FILE: rabbit/rabbit_c.c
function gen_g (line 64) | static
function update_c (line 78) | static
function step (line 99) | static
function keysetup (line 113) | static
function ivsetup (line 141) | static
function extract (line 175) | static
function rabbit_init (line 207) | void rabbit_init(const void *key, uint16_t keysize_b,
function rabbit_gen (line 235) | uint8_t rabbit_gen(rabbit_ctx_t *ctx){
FILE: rc5/rc5.c
function rc5_enc (line 40) | void rc5_enc(void *buffer, const rc5_ctx_t *ctx){
function rc5_dec (line 50) | void rc5_dec(void *buffer, const rc5_ctx_t *ctx){
function rc5_init (line 67) | void rc5_init(void *key, uint16_t keysize_b, uint8_t rounds, rc5_ctx_t *...
function rc5_free (line 94) | void rc5_free(rc5_ctx_t *ctx){
FILE: rc5/rc5.h
type rc5_ctx_t (line 36) | typedef struct rc5_ctx_st {
FILE: rc6/rc6.c
function rotl32 (line 39) | uint32_t rotl32(uint32_t a, uint8_t n){
function rotr32 (line 44) | uint32_t rotr32(uint32_t a, uint8_t n){
function rc6_init (line 49) | uint8_t rc6_init(void *key, uint16_t keylength_b, rc6_ctx_t *s){
function rc6_initl (line 54) | uint8_t rc6_initl(void *key, uint16_t keylength_b, uint8_t rounds, rc6_c...
function rc6_free (line 97) | void rc6_free(rc6_ctx_t *s){
function rc6_enc (line 107) | void rc6_enc(void *block, rc6_ctx_t *s){
function rc6_dec (line 127) | void rc6_dec(void *block, rc6_ctx_t *s){
FILE: rc6/rc6.h
type rc6_ctx_t (line 35) | typedef struct rc6_ctx_st{
FILE: rsa/rsa_basic.c
function rsa_enc (line 33) | void rsa_enc(bigint_t *data, const rsa_publickey_t *key){
function rsa_dec_crt_mono (line 53) | uint8_t rsa_dec_crt_mono(bigint_t *data, const rsa_privatekey_t *key){
function rsa_dec (line 163) | uint8_t rsa_dec(bigint_t *data, const rsa_privatekey_t *key){
function rsa_os2ip (line 181) | void rsa_os2ip(bigint_t *dest, const void *data, uint32_t length_B){
function rsa_i2osp (line 217) | void rsa_i2osp(void *dest, bigint_t *src, uint16_t *out_length_B){
FILE: rsa/rsa_basic.h
type rsa_publickey_t (line 25) | typedef struct {
type rsa_privatekey_t (line 30) | typedef struct {
type rsa_fullkey_t (line 37) | typedef struct {
FILE: rsa/rsaes_oaep.c
function rsa_encrypt_oaep (line 54) | uint8_t rsa_encrypt_oaep(void *dest, uint16_t *out_length,
function rsa_decrypt_oaep (line 143) | uint8_t rsa_decrypt_oaep(void *dest, uint16_t *out_length,
FILE: rsa/rsaes_oaep.h
type rsa_oaep_parameter_t (line 30) | typedef struct {
type rsa_label_t (line 36) | typedef struct {
FILE: rsa/rsaes_pkcs1v15.c
function rsa_pkcs1v15_compute_padlength_B (line 36) | uint16_t rsa_pkcs1v15_compute_padlength_B(bigint_t *modulus, uint16_t ms...
function rsa_encrypt_pkcs1v15 (line 40) | uint8_t rsa_encrypt_pkcs1v15(void *dest, uint16_t *out_length, const voi...
function rsa_decrypt_pkcs1v15 (line 88) | uint8_t rsa_decrypt_pkcs1v15(void *dest, uint16_t *out_length, const voi...
FILE: salsa20/salsa20.c
function quaterround (line 28) | static
function rowround (line 36) | static
function columnround (line 44) | static
function doubleround (line 52) | static
function salsa20_hash (line 60) | void salsa20_hash(uint32_t *a){
function salsa_k32 (line 75) | void salsa_k32(uint32_t *dest, const uint32_t *k, const uint32_t *n){
function salsa_k16 (line 86) | void salsa_k16(uint32_t *dest, const uint32_t *k, const uint32_t *n){
function salsa20_genBlock256 (line 97) | void salsa20_genBlock256(void *dest, const void *k, const void *iv, uint...
function salsa20_genBlock128 (line 104) | void salsa20_genBlock128(void *dest, const void *k, const void *iv, uint...
function salsa20_init (line 112) | void salsa20_init(void *key, uint16_t keylength_b, void *iv, salsa20_ctx...
function salsa20_gen (line 134) | uint8_t salsa20_gen(salsa20_ctx_t *ctx){
FILE: salsa20/salsa20.h
type salsa20_ctx_t (line 25) | typedef struct{
FILE: scal/scal-basic.c
function scal_cipher_init (line 27) | uint8_t scal_cipher_init(const scdesc_t *cipher_descriptor,
function scal_cipher_free (line 82) | void scal_cipher_free(scgen_ctx_t *ctx){
function scal_cipher_gen_byte (line 91) | uint8_t scal_cipher_gen_byte(scgen_ctx_t *ctx){
function scal_cipher_gen_block (line 128) | void scal_cipher_gen_block(void *block, scgen_ctx_t *ctx){
function scal_cipher_gen_fillblock (line 140) | void scal_cipher_gen_fillblock(void *block, uint16_t blocksize_B, scgen_...
function scal_cipher_getBlocksize_b (line 148) | uint16_t scal_cipher_getBlocksize_b(const scdesc_t *desc){
function PGM_VOID_P (line 154) | PGM_VOID_P scal_cipher_getKeysizeDesc(const scdesc_t *desc){
function PGM_VOID_P (line 158) | PGM_VOID_P scal_cipher_getIVsizeDesc(const scdesc_t *desc){
FILE: scal/scal-nessie.c
function scal_nessie_set_estream (line 31) | void scal_nessie_set_estream(uint8_t v){
function scal_nessie_get_estream (line 35) | uint8_t scal_nessie_get_estream(void){
function normal_block (line 94) | static
function long_block (line 118) | static
function scal_nessie_stream_run (line 145) | void scal_nessie_stream_run(const scdesc_t *desc, uint16_t keysize_b, ui...
function scal_nessie_run (line 282) | void scal_nessie_run(const scdesc_t *desc){
FILE: seed/seed.h
type seed_ctx_t (line 39) | typedef struct{
FILE: seed/seed_C.c
function changeendian32 (line 40) | static
function bigendian_sum32 (line 49) | static
function bigendian_sub32 (line 59) | static
function bigendian_rotl8_64 (line 69) | static inline
function bigendian_rotr8_64 (line 81) | static inline
function f_function (line 93) | static
function g_function (line 127) | static
type keypair_t (line 143) | typedef struct {
function keypair_t (line 147) | keypair_t getnextkeys(uint32_t *keystate, uint8_t curround){
function keypair_t (line 176) | keypair_t getprevkeys(uint32_t *keystate, uint8_t curround){
type seed_ctx_t (line 203) | typedef struct{
function seed_init (line 209) | void seed_init(const void * key, seed_ctx_t * ctx){
function seed_enc (line 218) | void seed_enc(void * buffer, const seed_ctx_t * ctx){
function seed_dec (line 251) | void seed_dec(void * buffer, seed_ctx_t * ctx){
FILE: serpent/serpent-sboxes-bitslice.c
function sb0 (line 37) | static
function sb0_inv (line 64) | static
function sb1 (line 91) | static
function sb1_inv (line 117) | static void sb1_inv(uint8_t *out, const uint8_t *in){
function sb2 (line 142) | static void sb2(uint8_t *out, const uint8_t *in){
function sb2_inv (line 165) | static void sb2_inv(uint8_t *out, const uint8_t *in){
function sb3 (line 190) | static void sb3(uint8_t *out, const uint8_t *in){
function sb3_inv (line 215) | static void sb3_inv(uint8_t *out, const uint8_t *in){
function sb4 (line 239) | static void sb4(uint8_t *out, const uint8_t *in){
function sb4_inv (line 265) | static void sb4_inv(uint8_t *out, const uint8_t *in){
function sb5 (line 289) | static void sb5(uint8_t *out, const uint8_t *in){
function sb5_inv (line 313) | static void sb5_inv(uint8_t *out, const uint8_t *in){
function sb6 (line 337) | static void sb6(uint8_t *out, const uint8_t *in){
function sb6_inv (line 363) | static void sb6_inv(uint8_t *out, const uint8_t *in){
function sb7 (line 389) | static void sb7(uint8_t *out, const uint8_t *in){
function sb7_inv (line 415) | static void sb7_inv(uint8_t *out, const uint8_t *in){
function sbox128 (line 449) | void sbox128(void * w, uint8_t box){
function inv_sbox128 (line 461) | void inv_sbox128(void * w, uint8_t box){
FILE: serpent/serpent-sboxes_c.c
function serpent_ip (line 55) | static void serpent_ip(uint32_t *i, uint8_t *o){
function serpent_fp (line 76) | static void serpent_fp(uint32_t *i, uint32_t *o){
function sbox128x (line 95) | static void sbox128x(uint8_t box, void *w){
function sbox128 (line 118) | void sbox128(void * w, uint8_t box){
function inv_sbox128 (line 123) | void inv_sbox128(void * w, uint8_t box){
FILE: serpent/serpent.c
function rotl32 (line 35) | uint32_t rotl32(uint32_t a, uint8_t n){
function rotr32 (line 40) | uint32_t rotr32(uint32_t a, uint8_t n){
function serpent_lt (line 50) | static void serpent_lt(uint8_t *b){
function serpent_inv_lt (line 63) | static void serpent_inv_lt(uint8_t *b){
function serpent_gen_w (line 78) | static uint32_t serpent_gen_w(uint32_t * b, uint8_t i){
function serpent_init (line 85) | void serpent_init(const void *key, uint16_t keysize_b, serpent_ctx_t *ctx){
function serpent_enc (line 109) | void serpent_enc(void *buffer, const serpent_ctx_t *ctx){
function serpent_dec (line 122) | void serpent_dec(void *buffer, const serpent_ctx_t *ctx){
FILE: serpent/serpent.h
type serpent_ctx_t (line 32) | typedef struct serpent_ctx_st {
FILE: sha1/sha1.c
function sha1_init (line 48) | void sha1_init(sha1_ctx_t *state){
function rotl32 (line 60) | uint32_t rotl32(uint32_t n, uint8_t bits){
function change_endian32 (line 64) | uint32_t change_endian32(uint32_t x){
function ch (line 70) | uint32_t ch(uint32_t x, uint32_t y, uint32_t z){
function maj (line 75) | uint32_t maj(uint32_t x, uint32_t y, uint32_t z){
function parity (line 80) | uint32_t parity(uint32_t x, uint32_t y, uint32_t z){
function sha1_nextBlock (line 96) | void sha1_nextBlock (sha1_ctx_t *state, const void *block){
function sha1_lastBlock (line 176) | void sha1_lastBlock(sha1_ctx_t *state, const void *block, uint16_t length){
function sha1_ctx2hash (line 210) | void sha1_ctx2hash (void *dest, sha1_ctx_t *state){
function sha1 (line 229) | void sha1 (void *dest, const void *msg, uint32_t length){
FILE: sha1/sha1.h
type sha1_ctx_t (line 59) | typedef struct {
FILE: sha2/sha224.c
function sha224_init (line 64) | void sha224_init(sha224_ctx_t *state){
function sha224_nextBlock (line 70) | void sha224_nextBlock (sha224_ctx_t *state, const void *block){
function sha224_lastBlock (line 75) | void sha224_lastBlock (sha224_ctx_t *state, const void *block, uint16_t ...
function sha224 (line 94) | void sha224(void *dest, const void *msg, uint32_t length_b){ /* length c...
function sha224_ctx2hash (line 110) | void sha224_ctx2hash(void *dest, const sha224_ctx_t *state){
FILE: sha2/sha224.h
type sha2_small_common_ctx_t (line 58) | typedef sha2_small_common_ctx_t sha224_ctx_t;
FILE: sha2/sha256.c
function sha256_init (line 63) | void sha256_init(sha256_ctx_t *state){
function sha256_nextBlock (line 69) | void sha256_nextBlock (sha256_ctx_t *state, const void *block){
function sha256_lastBlock (line 74) | void sha256_lastBlock (sha256_ctx_t *state, const void *block, uint16_t ...
function sha256 (line 93) | void sha256(void *dest, const void *msg, uint32_t length_b){ /* length c...
function sha256_ctx2hash (line 109) | void sha256_ctx2hash(void *dest, const sha256_ctx_t *state){
FILE: sha2/sha256.h
type sha2_small_common_ctx_t (line 58) | typedef sha2_small_common_ctx_t sha256_ctx_t;
FILE: sha2/sha2_large_common.c
function change_endian64 (line 50) | static const
function rotr64 (line 64) | static const
function rotl64 (line 69) | static const
function pgm_read_uint64_t_P (line 74) | static const
function sha2_large_common_nextBlock (line 92) | void sha2_large_common_nextBlock(sha2_large_common_ctx_t *ctx, const voi...
function sha2_large_common_lastBlock (line 125) | void sha2_large_common_lastBlock(sha2_large_common_ctx_t *ctx, const voi...
FILE: sha2/sha2_large_common.h
type sha2_large_common_ctx_t (line 23) | typedef struct {
FILE: sha2/sha2_small_common.c
function rotr32 (line 31) | static
function rotl32 (line 36) | static
function change_endian32 (line 45) | static
function sha2_small_common_nextBlock (line 78) | void sha2_small_common_nextBlock (sha2_small_common_ctx_t *state, const ...
function sha2_small_common_lastBlock (line 123) | void sha2_small_common_lastBlock(sha2_small_common_ctx_t *state, const v...
FILE: sha2/sha2_small_common.h
type sha2_small_common_ctx_t (line 23) | typedef struct {
FILE: sha2/sha384.c
function sha384_nextBlock (line 28) | void sha384_nextBlock (sha384_ctx_t *ctx, const void *block){
function sha384_lastBlock (line 32) | void sha384_lastBlock(sha384_ctx_t *ctx, const void *block, uint16_t len...
function sha384_init (line 43) | void sha384_init(sha384_ctx_t *ctx){
function sha384_ctx2hash (line 48) | void sha384_ctx2hash(void *dest, const sha384_ctx_t *ctx){
function sha384 (line 61) | void sha384(void *dest, const void *msg, uint32_t length_b){
FILE: sha2/sha384.h
type sha2_large_common_ctx_t (line 32) | typedef sha2_large_common_ctx_t sha384_ctx_t;
FILE: sha2/sha512.c
function sha512_nextBlock (line 27) | void sha512_nextBlock (sha512_ctx_t *ctx, const void *block){
function sha512_lastBlock (line 31) | void sha512_lastBlock(sha512_ctx_t *ctx, const void *block, uint16_t len...
function sha512_init (line 42) | void sha512_init(sha512_ctx_t *ctx){
function sha512_ctx2hash (line 47) | void sha512_ctx2hash(void *dest, const sha512_ctx_t *ctx){
function sha512 (line 60) | void sha512(void *dest, const void *msg, uint32_t length_b){
FILE: sha2/sha512.h
type sha2_large_common_ctx_t (line 31) | typedef sha2_large_common_ctx_t sha512_ctx_t;
FILE: sha256/sha256.c
function sha256_init (line 60) | void sha256_init(sha256_ctx_t *state){
function rotr32 (line 70) | uint32_t rotr32( uint32_t x, uint8_t n){
function change_endian32 (line 79) | uint32_t change_endian32(uint32_t x){
function sha256_nextBlock (line 114) | void sha256_nextBlock (sha256_ctx_t *state, const void *block){
function sha256_lastBlock (line 161) | void sha256_lastBlock(sha256_ctx_t *state, const void *block, uint16_t l...
function sha256 (line 207) | void sha256(sha256_hash_t *dest, const void *msg, uint32_t length){ /* l...
function sha256_ctx2hash (line 223) | void sha256_ctx2hash(sha256_hash_t *dest, const sha256_ctx_t *state){
FILE: sha256/sha256.h
type sha256_ctx_t (line 61) | typedef struct {
FILE: sha3-api.h
type BitSequence (line 20) | typedef unsigned char BitSequence;
type DataLength (line 21) | typedef unsigned long long DataLength;
type HashReturn (line 22) | typedef enum { SUCCESS = 0, FAIL = 1, BAD_HASHBITLEN = 2 } HashReturn;
FILE: shabal/shabal.c
function shabal_u (line 37) | static inline
function shabal_v (line 42) | static inline
function shabal_p (line 49) | static
function shabal_nextBlock (line 73) | void shabal_nextBlock(shabal_ctx_t *ctx, const void *block){
function shabal_lastBlock (line 91) | void shabal_lastBlock(shabal_ctx_t *ctx, const void *block, uint16_t len...
function shabal_ctx2hash (line 119) | void shabal_ctx2hash(void *dest, const shabal_ctx_t *ctx, uint16_t outle...
FILE: shabal/shabal.h
type shabal_ctx_t (line 39) | typedef struct{
FILE: shabal/shabal192.c
function shabal192_init (line 50) | void shabal192_init(shabal_ctx_t *ctx){
function shabal192_ctx2hash (line 66) | void shabal192_ctx2hash(void *dest, const shabal_ctx_t *ctx){
function shabal192 (line 70) | void shabal192(void *dest, void *msg, uint32_t length_b){
FILE: shabal/shabal224.c
function shabal224_init (line 50) | void shabal224_init(shabal_ctx_t *ctx){
function shabal224_ctx2hash (line 66) | void shabal224_ctx2hash(void *dest, const shabal_ctx_t *ctx){
function shabal224 (line 70) | void shabal224(void *dest, void *msg, uint32_t length_b){
FILE: shabal/shabal256.c
function shabal256_init (line 50) | void shabal256_init(shabal_ctx_t *ctx){
function shabal256_ctx2hash (line 66) | void shabal256_ctx2hash(void *dest, const shabal_ctx_t *ctx){
function shabal256 (line 70) | void shabal256(void *dest, void *msg, uint32_t length_b){
FILE: shabal/shabal384.c
function shabal384_init (line 50) | void shabal384_init(shabal_ctx_t *ctx){
function shabal384_ctx2hash (line 66) | void shabal384_ctx2hash(void *dest, const shabal_ctx_t *ctx){
function shabal384 (line 70) | void shabal384(void *dest, void *msg, uint32_t length_b){
FILE: shabal/shabal512.c
function shabal512_init (line 50) | void shabal512_init(shabal_ctx_t *ctx){
function shabal512_ctx2hash (line 66) | void shabal512_ctx2hash(void *dest, const shabal_ctx_t *ctx){
function shabal512 (line 70) | void shabal512(void *dest, void *msg, uint32_t length_b){
FILE: shabea/shabea.c
function shabea256 (line 53) | void shabea256(void * block, void * key, uint16_t keysize_b, uint8_t enc...
FILE: shacal1/shacal1_enc.c
function shacal1_enc (line 34) | void shacal1_enc(void *buffer, void *key, uint16_t keysize_b){
FILE: shacal2/shacal2_enc.c
function shacal2_enc (line 35) | void shacal2_enc(void *buffer, void *key, uint16_t keysize_b){
FILE: skein/skein.h
type skein256_ctx_t (line 43) | typedef struct{
type skein512_ctx_t (line 54) | typedef struct{
type skein1024_ctx_t (line 65) | typedef struct{
FILE: skein/skein1024.c
function skein1024_init (line 33) | void skein1024_init(skein1024_ctx_t *ctx, uint16_t outsize_b){
function skein1024_nextBlock (line 50) | void skein1024_nextBlock(skein1024_ctx_t *ctx, const void *block){
function skein1024_lastBlock (line 54) | void skein1024_lastBlock(skein1024_ctx_t *ctx, const void *block, uint16...
function skein1024_ctx2hash (line 58) | void skein1024_ctx2hash(void *dest, skein1024_ctx_t *ctx){
function skein1024 (line 83) | void skein1024(void *dest, uint16_t outlength_b, const void *msg, uint32...
FILE: skein/skein256.c
function skein256_init (line 34) | void skein256_init(skein256_ctx_t *ctx, uint16_t outsize_b){
function skein256_nextBlock (line 51) | void skein256_nextBlock(skein256_ctx_t *ctx, const void *block){
function skein256_lastBlock (line 55) | void skein256_lastBlock(skein256_ctx_t *ctx, const void *block, uint16_t...
function skein256_ctx2hash (line 59) | void skein256_ctx2hash(void *dest, skein256_ctx_t *ctx){
function skein256 (line 84) | void skein256(void *dest, uint16_t outlength_b,const void *msg, uint32_t...
FILE: skein/skein512.c
function skein512_init (line 33) | void skein512_init(skein512_ctx_t *ctx, uint16_t outsize_b){
function skein512_nextBlock (line 50) | void skein512_nextBlock(skein512_ctx_t *ctx, const void *block){
function skein512_lastBlock (line 54) | void skein512_lastBlock(skein512_ctx_t *ctx, const void *block, uint16_t...
function skein512_ctx2hash (line 58) | void skein512_ctx2hash(void *dest, skein512_ctx_t *ctx){
function skein512 (line 83) | void skein512(void *dest, uint16_t outlength_b,const void *msg, uint32_t...
FILE: skein/threefish.h
type threefish256_ctx_t (line 47) | typedef struct{
type threefish512_ctx_t (line 58) | typedef struct{
type threefish1024_ctx_t (line 69) | typedef struct{
FILE: skein/threefish1024_dec.c
function permute_inv16 (line 35) | static
function add_key_16 (line 58) | static
function threefish1024_dec (line 69) | void threefish1024_dec(void *data, const threefish1024_ctx_t *ctx){
FILE: skein/threefish1024_dec_cstub.c
function permute_inv16 (line 35) | static
function add_key_16 (line 58) | static
function threefish1024_dec (line 69) | void threefish1024_dec(void *data, const threefish1024_ctx_t *ctx){
FILE: skein/threefish1024_enc.c
function permute_16 (line 35) | static
function threefish1024_init (line 64) | void threefish1024_init(const void *key, const void *tweak, threefish102...
function add_key_16 (line 79) | static
function threefish1024_enc (line 90) | void threefish1024_enc(void *data, const threefish1024_ctx_t *ctx){
FILE: skein/threefish256_dec.c
function permute_4 (line 34) | static
function add_key_4 (line 45) | static
function threefish256_dec (line 53) | void threefish256_dec(void *data, const threefish256_ctx_t *ctx){
FILE: skein/threefish256_dec_cstub.c
function permute_4 (line 34) | static
function add_key_4 (line 42) | static
function threefish256_dec (line 50) | void threefish256_dec(void *data, const threefish256_ctx_t *ctx){
FILE: skein/threefish256_enc.c
function permute_4 (line 34) | static
function threefish256_init (line 48) | void threefish256_init(const void *key, const void *tweak, threefish256_...
function add_key_4 (line 63) | static
function threefish256_enc (line 71) | void threefish256_enc(void *data, const threefish256_ctx_t *ctx){
FILE: skein/threefish512_dec.c
function permute_inv8 (line 37) | static
function add_key_8 (line 50) | static
function threefish512_dec (line 61) | void threefish512_dec(void *data, const threefish512_ctx_t *ctx){
FILE: skein/threefish512_dec_cstub.c
function permute_inv8 (line 37) | static
function add_key_8 (line 50) | static
function threefish512_dec (line 61) | void threefish512_dec(void *data, const threefish512_ctx_t *ctx){
FILE: skein/threefish512_enc.c
function permute_8 (line 37) | static
function threefish512_init (line 70) | void threefish512_init(const void *key, const void *tweak, threefish512_...
function add_key_8 (line 85) | static
function threefish512_enc (line 96) | void threefish512_enc(void *data, const threefish512_ctx_t *ctx){
FILE: skein/threefish_invmix_c.c
function threefish_invmix (line 33) | void threefish_invmix(void *data, uint8_t rot){
FILE: skein/threefish_mix_c.c
function threefish_mix (line 33) | void threefish_mix(void *data, uint8_t rot){
FILE: skein/ubi.h
type ubi256_ctx_t (line 51) | typedef struct{
type ubi512_ctx_t (line 61) | typedef struct{
type ubi1024_ctx_t (line 71) | typedef struct{
type skein_config_t (line 96) | typedef struct{
FILE: skein/ubi1024.c
function ubi1024_init (line 33) | void ubi1024_init(ubi1024_ctx_t *ctx, const void *g, uint8_t type){
function ubi1024_nextBlock (line 39) | void ubi1024_nextBlock(ubi1024_ctx_t *ctx, const void *block){
function ubi1024_lastBlock (line 50) | void ubi1024_lastBlock(ubi1024_ctx_t *ctx, const void *block, uint16_t l...
function ubi1024_ctx2hash (line 73) | void ubi1024_ctx2hash(void *dest, const ubi1024_ctx_t *ctx){
FILE: skein/ubi256.c
function ubi256_init (line 33) | void ubi256_init(ubi256_ctx_t *ctx, const void *g, uint8_t type){
function ubi256_nextBlock (line 39) | void ubi256_nextBlock(ubi256_ctx_t *ctx, const void *block){
function ubi256_lastBlock (line 50) | void ubi256_lastBlock(ubi256_ctx_t *ctx, const void *block, uint16_t len...
function ubi256_ctx2hash (line 77) | void ubi256_ctx2hash(void *dest, const ubi256_ctx_t *ctx){
FILE: skein/ubi512.c
function ubi512_init (line 33) | void ubi512_init(ubi512_ctx_t *ctx, const void *g, uint8_t type){
function ubi512_nextBlock (line 39) | void ubi512_nextBlock(ubi512_ctx_t *ctx, const void *block){
function ubi512_lastBlock (line 50) | void ubi512_lastBlock(ubi512_ctx_t *ctx, const void *block, uint16_t len...
function ubi512_ctx2hash (line 73) | void ubi512_ctx2hash(void *dest, const ubi512_ctx_t *ctx){
FILE: skipjack/skipjack.c
function skipjack_sub_g (line 83) | static
function skipjack_g (line 88) | static
function skipjack_g_inv (line 102) | static
function skipjack_a (line 116) | static
function skipjack_a_inv (line 127) | static
function skipjack_b (line 138) | static
function skipjack_b_inv (line 149) | static
function skipjack_enc (line 164) | void skipjack_enc(void *block, void *key){
function skipjack_dec (line 179) | void skipjack_dec(void *block, void *key){
FILE: skipjack/skipjack_nofix.c
function skipjack_g (line 86) | uint16_t skipjack_g(uint16_t g, uint8_t k, uint8_t *key){
function skipjack_g_inv (line 99) | uint16_t skipjack_g_inv(uint16_t g, uint8_t k, uint8_t *key){
function skipjack_a (line 112) | void skipjack_a(uint16_t *w, uint8_t k, uint8_t *key){
function skipjack_a_inv (line 124) | void skipjack_a_inv(uint16_t *w, uint8_t k, uint8_t *key){
function skipjack_b (line 135) | void skipjack_b(uint16_t *w, uint8_t k, uint8_t *key){
function skipjack_b_inv (line 146) | void skipjack_b_inv(uint16_t *w, uint8_t k, uint8_t *key){
function skipjack_enc (line 161) | void skipjack_enc(void *block, void *key){
function skipjack_enc (line 172) | void skipjack_enc(void *block, void *key){
function skipjack_dec (line 199) | void skipjack_dec(void *block, void *key){
function skipjack_dec (line 210) | void skipjack_dec(void *block, void *key){
FILE: stack_measuring.h
type stack_measuring_ctx_t (line 25) | typedef struct {
FILE: streamcipher_descriptor.h
type sc_init_fpt (line 54) | typedef union{
type sc_gen_fpt (line 63) | typedef union{
type sc_genra_fpt (line 69) | typedef union{
type scdesc_t (line 88) | typedef struct {
type scgen_ctx_t (line 102) | typedef struct{
FILE: test_src/circularbytebuffer.h
type circularbytebuffer_t (line 40) | typedef struct {
FILE: test_src/cli-stub.c
function cli_completion (line 54) | uint8_t cli_completion(char *buffer, uint16_t maxcmdlength, PGM_VOID_P c...
function cmd_interface (line 83) | int8_t cmd_interface(PGM_VOID_P cmd_desc){
FILE: test_src/cli.h
type cmdoption_t (line 36) | typedef struct {
type cmdlist_entry_t (line 44) | typedef struct {
FILE: test_src/cmacvs.c
function cmacvs_listalgos (line 54) | void cmacvs_listalgos(void){
function cmacvs_setalgo (line 71) | void cmacvs_setalgo(char *param){
type cmacvs_ctx_t (line 103) | typedef struct {
function buffer_add (line 114) | uint8_t buffer_add(char c){
function getValue_P (line 148) | int32_t getValue_P(PGM_P key){
function getKey (line 176) | uint8_t getKey(void *key_buffer, uint8_t klen_B){
function getMac (line 216) | uint8_t getMac(void *mac_buffer, uint8_t mlen_B){
function cmacvs_test1 (line 256) | void cmacvs_test1(void){ /* Gen tests */
function cmacvs_test2 (line 420) | void cmacvs_test2(void){ /* Ver tests */
FILE: test_src/dbz_strings.c
function dbz_strcount (line 36) | uint8_t dbz_strcount(const char *str){
function dbz_splitup (line 51) | void dbz_splitup(char *dbzstr, char** strings){
function dbz_strcount_P (line 66) | uint8_t dbz_strcount_P(PGM_P str){
function dbz_splitup_P (line 81) | void dbz_splitup_P(PGM_P dbzstr, PGM_P *strings){
FILE: test_src/debug.c
function debug_init (line 33) | void debug_init(void){
function debug_char (line 41) | void debug_char(char c){
function debug_str (line 50) | void debug_str(char *s){
function debug_byte (line 57) | void debug_byte(char b){
FILE: test_src/dump-decl.c
type memtype_desc_t (line 51) | typedef const struct {
FILE: test_src/main-a5_1-test.c
function a51_genctx_dummy (line 34) | void a51_genctx_dummy(uint8_t *key, uint16_t keysize, void *ctx){
function testrun_nessie_a51 (line 40) | void testrun_nessie_a51(void){
function main (line 71) | int main (void){
FILE: test_src/main-aes-test.c
function testrun_nessie_aes (line 56) | void testrun_nessie_aes(void){
function testrun_test_aes (line 60) | void testrun_test_aes(void){
function testrun_testkey_aes128 (line 97) | void testrun_testkey_aes128(void){
function testrun_testkey_aes192 (line 116) | void testrun_testkey_aes192(void){
function testrun_testkey_aes256 (line 139) | void testrun_testkey_aes256(void){
function testrun_testkey_aes (line 163) | void testrun_testkey_aes(void){
function testrun_aes128_cbc (line 200) | void testrun_aes128_cbc(void){
function testrun_aes128_cfb8 (line 233) | void testrun_aes128_cfb8(void){
function testrun_aes128_cfb1 (line 269) | void testrun_aes128_cfb1(void){
function testrun_aes128_ofb (line 332) | void testrun_aes128_ofb(void){
function testrun_aes128_ctr (line 365) | void testrun_aes128_ctr(void){
function testrun_aes128_cmac (line 398) | void testrun_aes128_cmac(void){
function testrun_aes128_cmac72 (line 434) | void testrun_aes128_cmac72(void){
function testrun_aes192_cmac0 (line 473) | void testrun_aes192_cmac0(void){
function testrun_aes128_eax (line 568) | void testrun_aes128_eax(void){
function testrun_performance_aes (line 644) | void testrun_performance_aes(void){
function main (line 695) | int main(void) {
FILE: test_src/main-arcfour-test.c
function arcfour_genctx_dummy (line 39) | void arcfour_genctx_dummy(uint8_t *key, uint16_t keysize, void *ctx){
function testrun_nessie_arcfour (line 43) | void testrun_nessie_arcfour(void){
function testrun_performance_arcfour (line 47) | void testrun_performance_arcfour(void){
function main (line 87) | int main(void) {
FILE: test_src/main-base64-test.c
function testrun_stdtest_base64 (line 39) | void testrun_stdtest_base64(void){
function testrun_performance_base64 (line 94) | void testrun_performance_base64(void){
function main (line 146) | int main (void){
FILE: test_src/main-bigint-test.c
function test_echo_bigint (line 38) | void test_echo_bigint(void){
function test_add_bigint (line 54) | void test_add_bigint(void){
function test_add_scale_bigint (line 92) | void test_add_scale_bigint(void){
function test_mul_bigint (line 146) | void test_mul_bigint(void){
function test_mul_mont_bigint (line 184) | void test_mul_mont_bigint(void){
function test_mul_word_bigint (line 233) | void test_mul_word_bigint(void){
function test_square_bigint (line 277) | void test_square_bigint(void){
function test_reduce_bigint (line 305) | void test_reduce_bigint(void){
function test_expmod_bigint (line 333) | void test_expmod_bigint(void){
function test_expmod_mont_bigint (line 384) | void test_expmod_mont_bigint(void){
function test_gcdext_bigint (line 434) | void test_gcdext_bigint(void){
function test_simple (line 475) | void test_simple(void){
function test_mul_simple (line 511) | void test_mul_simple(void){
function test_square_simple (line 558) | void test_square_simple(void){
function test_reduce_simple (line 576) | void test_reduce_simple(void){
function test_gcdext_simple (line 605) | void test_gcdext_simple(void){
function testrun_performance_bigint (line 635) | void testrun_performance_bigint(void){
function main (line 675) | int main (void){
FILE: test_src/main-blake-test.c
function testrun_nessie_blake (line 51) | void testrun_nessie_blake(void){
function blake224_test (line 54) | void blake224_test(void *msg, uint32_t length_b){
function blake256_test (line 58) | void blake256_test(void *msg, uint32_t length_b){
function blake384_test (line 62) | void blake384_test(void *msg, uint32_t length_b){
function blake512_test (line 66) | void blake512_test(void *msg, uint32_t length_b){
function testrun_stdtest_blake (line 69) | void testrun_stdtest_blake(void){
function testshort (line 86) | void testshort(void){
function testlshort (line 90) | void testlshort(void){
function test512_32 (line 94) | void test512_32(void){
function performance_blake (line 106) | void performance_blake(void){
function main (line 142) | int main (void){
FILE: test_src/main-bmw-test.c
function performance_bmw (line 53) | void performance_bmw(void){
function testrun_nessie_bmw (line 57) | void testrun_nessie_bmw(void){
function bmw224_test (line 61) | void bmw224_test(void *msg, uint32_t length_b){
function bmw256_test (line 65) | void bmw256_test(void *msg, uint32_t length_b){
function bmw384_test (line 68) | void bmw384_test(void *msg, uint32_t length_b){
function bmw512_test (line 72) | void bmw512_test(void *msg, uint32_t length_b){
function test506 (line 76) | void test506(void){
function test507 (line 90) | void test507(void){
function testrun_stdtest_bmw (line 104) | void testrun_stdtest_bmw(void){
function bmw256_short_test (line 117) | void bmw256_short_test(void *msg, uint32_t length_b){
function testshort (line 122) | void testshort(void){
function testlshort (line 127) | void testlshort(void){
function main (line 169) | int main (void){
FILE: test_src/main-camellia-test.c
function testrun_nessie_camellia (line 43) | void testrun_nessie_camellia(void){
function hexdump128 (line 64) | void hexdump128(void *data){
function testrun_camellia128 (line 73) | void testrun_camellia128(void){
function test_performance_camellia (line 115) | void test_performance_camellia(void){
function testrun_camellia (line 129) | void testrun_camellia(void){
function main (line 177) | int main (void){
FILE: test_src/main-cast5-test.c
function testrun_nessie_cast5 (line 43) | void testrun_nessie_cast5(void){
function cast5_ctx_dump (line 51) | void cast5_ctx_dump(cast5_ctx_t *s){
function test_encrypt (line 69) | void test_encrypt(uint8_t *block, uint8_t *key, uint8_t keylength, bool ...
function test_decrypt (line 85) | void test_decrypt(uint8_t *block, uint8_t *key, uint8_t keylength, bool ...
function testrun_cast5 (line 101) | void testrun_cast5(void){
function testrun_performance_cast5 (line 145) | void testrun_performance_cast5(void){
function main (line 166) | int main (void){
FILE: test_src/main-cast6-test.c
function testrun_nessie_cast6 (line 26) | void testrun_nessie_cast6(void){
function testrun_rfc_cast6 (line 30) | void testrun_rfc_cast6(void){
function testrun_performance_cast6 (line 89) | void testrun_performance_cast6(void){
function main (line 110) | int main (void){
FILE: test_src/main-cscipher-test.c
function cscipher_init_dummy (line 43) | void cscipher_init_dummy(const uint8_t *key, uint16_t keysize_b, void *c...
function testrun_nessie_cscipher (line 47) | void testrun_nessie_cscipher(void){
function testrun_cscipher (line 51) | void testrun_cscipher(void){
function testrun_long_cscipher (line 72) | void testrun_long_cscipher(void){
function testrun_performance_cscipher (line 120) | void testrun_performance_cscipher(void){
function main (line 142) | int main (void){
FILE: test_src/main-cubehash-test.c
function cubehash256_test0 (line 50) | void cubehash256_test0(void){
function performance_cubehash (line 62) | void performance_cubehash(void){
function testrun_nessie_cubehash (line 66) | void testrun_nessie_cubehash(void){
function main (line 94) | int main (void){
FILE: test_src/main-des-test.c
function testrun_nessie_des (line 46) | void testrun_nessie_des(const char *param){
function testrun_performance_des (line 73) | void testrun_performance_des(void){
function main (line 93) | int main(void) {
FILE: test_src/main-dsa-test.c
function load_fix_dsa (line 46) | void load_fix_dsa(void){
function dsa_print_item (line 50) | void dsa_print_item(bigint_t *a, PGM_P pstr){
function dsa_print_signature_b64 (line 71) | void dsa_print_signature_b64(dsa_signature_t *s){
function dsa_print_ctx (line 95) | void dsa_print_ctx(dsa_ctx_t *ctx){
function dsa_print_signature (line 103) | void dsa_print_signature(const dsa_signature_t *sig){
function quick_test (line 110) | void quick_test(void){
function reset_prng (line 145) | void reset_prng(void){
function testrun_performance_bigint (line 152) | void testrun_performance_bigint(void){
function main (line 173) | int main (void){
FILE: test_src/main-ecdsa-test.c
function prng_get_byte (line 54) | uint8_t prng_get_byte(void){
function hfdesc_t (line 58) | const hfdesc_t *hash_select(void){
function convert_hexchar_to_value (line 80) | uint8_t convert_hexchar_to_value(char a){
function convert_hex_to_byte (line 94) | uint8_t convert_hex_to_byte(char a, char b){
function testrun_performance_invert_bigint (line 143) | void testrun_performance_invert_bigint(void){
function testrun_performance_multiply_bigint (line 178) | void testrun_performance_multiply_bigint(void){
function testrun_performance_reduce_bigint (line 237) | void testrun_performance_reduce_bigint(void){
function ecc_affine_point_alloc (line 306) | uint8_t ecc_affine_point_alloc(ecc_affine_point_t *p, uint16_t length_b){
function ecc_affine_point_free (line 318) | void ecc_affine_point_free(ecc_affine_point_t *p){
function testrun_square (line 324) | void testrun_square(void){
function testrun_genkey2 (line 422) | void testrun_genkey2(void){
function testrun_genkey1 (line 457) | void testrun_genkey1(void){
function testrun_genkey3 (line 497) | void testrun_genkey3(void){
function testrun_genkey (line 536) | void testrun_genkey(void){
function hash_mem_P (line 645) | void hash_mem_P(const hfdesc_t *hfdesc, void *dest, const void *msg, uin...
function test_sign1 (line 693) | void test_sign1(void){
function test_sign2 (line 766) | void test_sign2(void){
function main (line 874) | int main (void){
FILE: test_src/main-echo-test.c
function echo256_interm (line 92) | void echo256_interm(void){
function echo512_interm (line 106) | void echo512_interm(void){
function echo256_test0 (line 120) | void echo256_test0(void){
function performance_echo (line 132) | void performance_echo(void){
function testrun_nessie_echo (line 136) | void testrun_nessie_echo(void){
function main (line 168) | int main (void){
FILE: test_src/main-entropium-test.c
function testrun_entropium (line 36) | void testrun_entropium(void){
function testrun_performance_entropium (line 56) | void testrun_performance_entropium(void){
function main (line 99) | int main (void){
FILE: test_src/main-grain-test.c
function grain_genctx_dummy (line 37) | void grain_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function grain_getbyte_dummy (line 42) | uint8_t grain_getbyte_dummy(grain_ctx_t *ctx){
function grain_getbyte_dummy_rev (line 51) | uint8_t grain_getbyte_dummy_rev(grain_ctx_t *ctx){
function testrun_nessie_grain (line 60) | void testrun_nessie_grain(void){
function testrun_std_grain (line 66) | void testrun_std_grain(void){
function testrun_performance_grain (line 110) | void testrun_performance_grain(void){
function main (line 156) | int main (void){
FILE: test_src/main-groestl-test.c
function testrun_nessie_groestl (line 52) | void testrun_nessie_groestl(void){
function groestl224_test (line 55) | void groestl224_test(void *msg, uint32_t length_b){
function groestl256_test (line 59) | void groestl256_test(void *msg, uint32_t length_b){
function groestl384_test (line 63) | void groestl384_test(void *msg, uint32_t length_b){
function groestl512_test (line 67) | void groestl512_test(void *msg, uint32_t length_b){
function testrun_stdtest_groestl (line 72) | void testrun_stdtest_groestl(void){
function testshort (line 85) | void testshort(void){
function testlshort (line 89) | void testlshort(void){
function test505 (line 93) | void test505(void){
function performance_groestl (line 107) | void performance_groestl(void){
function main (line 141) | int main (void){
FILE: test_src/main-hmac-md5-test.c
function testrun_nessie_hmacmd5 (line 35) | void testrun_nessie_hmacmd5(void){
function testrun_test_hmacmd5 (line 49) | void testrun_test_hmacmd5(void){
function hmacmd5_interactive (line 74) | void hmacmd5_interactive(void){
function strhexdump (line 90) | void strhexdump(char *dest, void *src, uint16_t length){
function md5_interactive (line 136) | void md5_interactive(void){
function main (line 173) | int main (void){
FILE: test_src/main-hmac-sha1-test.c
function testrun_nessie_hmacsha1 (line 37) | void testrun_nessie_hmacsha1(void){
function main (line 69) | int main (void){
FILE: test_src/main-hmac-sha256-test.c
function testrun_hmacsha256 (line 37) | void testrun_hmacsha256(void){
function testrun_nessie_hmacsha256 (line 54) | void testrun_nessie_hmacsha256(void){
function main (line 87) | int main (void){
FILE: test_src/main-jh-test.c
function performance_jh (line 50) | void performance_jh(void){
function testrun_nessie_jh (line 54) | void testrun_nessie_jh(void){
function test256Null (line 58) | void test256Null(void){
function main (line 95) | int main (void){
FILE: test_src/main-keccak-test.c
function test_256 (line 49) | void test_256(void){
function performance_keccak (line 63) | void performance_keccak(void){
function testrun_nessie_keccak (line 67) | void testrun_nessie_keccak(void){
function main (line 95) | int main(void){
FILE: test_src/main-khazad-test.c
function testrun_nessie_khazad (line 42) | void testrun_nessie_khazad(void){
function testrun_performance_khazad (line 46) | void testrun_performance_khazad(void){
function test_khazad (line 50) | void test_khazad(void){
function test_sbox (line 73) | void test_sbox(void){
function main (line 106) | int main (void){
FILE: test_src/main-md5-test.c
function md5_ctx2hash_dummy (line 43) | void md5_ctx2hash_dummy(void *buffer, void *ctx){
function testrun_nessie_md5 (line 48) | void testrun_nessie_md5(void){
function testrun_md5 (line 78) | void testrun_md5(void){
function testrun_performance_md5 (line 112) | void testrun_performance_md5(void){
function main (line 134) | int main (void){
FILE: test_src/main-mickey128-test.c
function testrun_nessie_mickey128 (line 20) | void testrun_nessie_mickey128(void){
function testrun_ref_mickey128 (line 25) | void testrun_ref_mickey128(void){
function main (line 123) | int main (void){
FILE: test_src/main-mqq160-sign-test.c
function performance_mqq (line 47) | void performance_mqq(void){
function testrun_mqq_mem (line 122) | void testrun_mqq_mem(void){
function testrun_mqq_flash (line 135) | void testrun_mqq_flash(void){
function testrun_mqq (line 145) | void testrun_mqq(void){
function main (line 181) | int main (void){
FILE: test_src/main-mugi-test.c
function testrun_performance_mugi (line 36) | void testrun_performance_mugi(void){
function testrun_mugi (line 67) | void testrun_mugi(void){
function main (line 121) | int main (void){
FILE: test_src/main-noekeon-test.c
function testrun_nessie_noekeon (line 43) | void testrun_nessie_noekeon(void){
function testrun_stdtest_rundirect (line 48) | void testrun_stdtest_rundirect(void *data, void *key){
function testrun_stdtest_runindirect (line 67) | void testrun_stdtest_runindirect(void *data, void *key){
function testrun_stdtest_noekeon (line 87) | void testrun_stdtest_noekeon(void){
function testrun_performance_noekeon (line 134) | void testrun_performance_noekeon(void){
function main (line 158) | int main (void){
FILE: test_src/main-omac-noekeon-test.c
function test_mac (line 38) | void test_mac(void *key, void *data, uint16_t datalength_b){
function testrun_test_omac_noekeon (line 53) | void testrun_test_omac_noekeon(void){
function omac_noekeon_next_dummy (line 67) | void omac_noekeon_next_dummy(void *ctx, const void *buffer){
function omac_noekeon_init_dummy (line 71) | void omac_noekeon_init_dummy(void *ctx, const void *key, uint16_t keysiz...
function omac_noekeon_last_dummy (line 76) | void omac_noekeon_last_dummy(void *ctx, const void *buffer, uint16_t siz...
function omac_noekeon_conv_dummy (line 85) | void omac_noekeon_conv_dummy(void *buffer, void *ctx){
function testrun_nessie_omac_noekeon (line 89) | void testrun_nessie_omac_noekeon(void){
function testrun_performance_omac_noekeon (line 105) | void testrun_performance_omac_noekeon(void){
function main (line 160) | int main (void){
FILE: test_src/main-present-test.c
function testrun_nessie_present (line 44) | void testrun_nessie_present(void){
function testrun_selfenc (line 48) | void testrun_selfenc(uint8_t *key, uint8_t *buffer){
function testrun_selfenc_128 (line 65) | void testrun_selfenc_128(uint8_t *key, uint8_t *buffer){
function testrun_self_present (line 84) | void testrun_self_present(void){
function testrun_self_present_128 (line 101) | void testrun_self_present_128(void){
function testrun_performance_present (line 118) | void testrun_performance_present(void){
function main (line 141) | int main(void) {
FILE: test_src/main-rabbit-test.c
function test_vector (line 35) | void test_vector(void *key, void *iv, const void *ref){
function nessie_first (line 73) | void nessie_first(void){
function spec_test (line 133) | void spec_test(void){
function testrun_nessie_rabbit (line 162) | void testrun_nessie_rabbit(void){
function testrun_performance_rabbit (line 169) | void testrun_performance_rabbit(void){
function main (line 217) | int main (void){
FILE: test_src/main-rc5-test.c
function rc5_genctx_dummy (line 43) | void rc5_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function testrun_nessie_rc5 (line 47) | void testrun_nessie_rc5(void){
function testrun_performance_rc5 (line 52) | void testrun_performance_rc5(void){
function main (line 72) | int main (void){
FILE: test_src/main-rc6-test.c
function rc6_genctx_dummy (line 42) | void rc6_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function testrun_nessie_rc6 (line 46) | void testrun_nessie_rc6(void){
function testrun_performance_rc6 (line 51) | void testrun_performance_rc6(void){
function main (line 71) | int main (void){
FILE: test_src/main-rsaes_oaep-test.c
function convert_nibble (line 346) | uint8_t convert_nibble(uint8_t c){
function read_os (line 359) | uint16_t read_os(void *dst, uint16_t length, const char *ignore_string){
function own_atou (line 392) | uint16_t own_atou(const char *str){
function read_bigint (line 401) | uint8_t read_bigint(bigint_t *a, char *prompt){
function pre_alloc_key_crt (line 432) | uint8_t pre_alloc_key_crt(void){
function free_key (line 442) | void free_key(void){
function read_key_crt (line 453) | uint8_t read_key_crt(void){
function read_key_conv (line 475) | uint8_t read_key_conv(void){
function load_bigint_from_os (line 493) | uint8_t load_bigint_from_os(bigint_t *a, PGM_VOID_P os, uint16_t length_B){
function load_fix_rsa (line 508) | void load_fix_rsa(void){
function quick_test (line 530) | void quick_test(void){
function run_seed_test (line 578) | void run_seed_test(void){
function reset_prng (line 648) | void reset_prng(void){
function rsa_init (line 655) | void rsa_init(void){
function load_key (line 659) | void load_key(void){
function test_dump (line 667) | void test_dump(void){
function dump_sp (line 705) | void dump_sp(void){
function main (line 712) | int main (void){
FILE: test_src/main-rsaes_pkcs1v15-test.c
function convert_nibble (line 164) | uint8_t convert_nibble(uint8_t c){
function read_os (line 177) | uint16_t read_os(void *dst, uint16_t length, const char *ignore_string){
function own_atou (line 210) | uint16_t own_atou(const char *str){
function read_bigint (line 219) | uint8_t read_bigint(bigint_t *a, char *prompt){
function pre_alloc_key_crt (line 250) | uint8_t pre_alloc_key_crt(void){
function free_key (line 260) | void free_key(void){
function read_key_crt (line 271) | uint8_t read_key_crt(void){
function read_key_conv (line 293) | uint8_t read_key_conv(void){
function load_bigint_from_os (line 311) | uint8_t load_bigint_from_os(bigint_t *a, PGM_VOID_P os, uint16_t length_B){
function load_fix_rsa (line 326) | void load_fix_rsa(void){
function quick_test (line 564) | void quick_test(void){
function run_seed_test (line 617) | void run_seed_test(void){
function reset_prng (line 741) | void reset_prng(void){
function rsa_init (line 748) | void rsa_init(void){
function load_key (line 752) | void load_key(void){
function test_dump (line 766) | void test_dump(void){
function dump_sp (line 804) | void dump_sp(void){
function main (line 811) | int main (void){
FILE: test_src/main-salsa20-test.c
function nessie_first (line 36) | void nessie_first(void){
function spec_test (line 170) | void spec_test(void){
function testrun_nessie_salsa20 (line 222) | void testrun_nessie_salsa20(void){
function testrun_performance_salsa20 (line 227) | void testrun_performance_salsa20(void){
function main (line 273) | int main (void){
FILE: test_src/main-seed-test.c
function seed_genctx_dummy (line 48) | void seed_genctx_dummy(uint8_t *key, uint16_t keysize, void *ctx){
function testrun_nessie_seed (line 52) | void testrun_nessie_seed(void){
function testrun_performance_seed (line 57) | void testrun_performance_seed(void){
function testencrypt (line 65) | void testencrypt(uint8_t *block, uint8_t *key){
function testdecrypt (line 77) | void testdecrypt(uint8_t *block, uint8_t *key){
function testrun_seed (line 89) | void testrun_seed(void){
function main (line 136) | int main (void){
FILE: test_src/main-serpent-test.c
function serpent_genctx_dummy (line 43) | void serpent_genctx_dummy(uint8_t *key, uint16_t keysize, void *ctx){
function testrun_nessie_serpent (line 47) | void testrun_nessie_serpent(void){
function testrun_test_serpent (line 51) | void testrun_test_serpent(void){
function testrun_performance_serpent (line 65) | void testrun_performance_serpent(void){
function main (line 85) | int main (void){
FILE: test_src/main-sha1-test.c
function testrun_nessie_sha1 (line 46) | void testrun_nessie_sha1(void){
function sha1_ctx_dump (line 63) | void sha1_ctx_dump(sha1_ctx_t *s){
function testrun_sha1 (line 73) | void testrun_sha1(void){
function testrun_sha1_2 (line 121) | void testrun_sha1_2(void){
function testrun_sha1_506 (line 142) | void testrun_sha1_506(void){
function testrun_performance_sha1 (line 169) | void testrun_performance_sha1(void){
function main (line 206) | int main (void){
FILE: test_src/main-sha2-test.c
function testrun_nessie_sha2 (line 57) | void testrun_nessie_sha2(void){
function testrun_performance_sha2 (line 61) | void testrun_performance_sha2(void){
function simple_test (line 65) | void simple_test(void){
function main (line 203) | int main(void) {
FILE: test_src/main-sha256-test.c
function testrun_nessie_sha256 (line 49) | void testrun_nessie_sha256(void){
function testrun_performance_sha256 (line 53) | void testrun_performance_sha256(void){
function test_monte (line 57) | void test_monte(void){
function test_monte2 (line 94) | void test_monte2(void){
function main (line 152) | int main (void){
FILE: test_src/main-shabal-test.c
function testrun_stdtest_shabal192 (line 50) | void testrun_stdtest_shabal192(void *msg, uint16_t size_b){
function testrun_stdtest_shabal224 (line 54) | void testrun_stdtest_shabal224(void *msg, uint16_t size_b){
function testrun_stdtest_shabal256 (line 58) | void testrun_stdtest_shabal256(void *msg, uint16_t size_b){
function testrun_stdtest_shabal384 (line 62) | void testrun_stdtest_shabal384(void *msg, uint16_t size_b){
function testrun_stdtest_shabal512 (line 66) | void testrun_stdtest_shabal512(void *msg, uint16_t size_b){
function testrun_stdtest_shabal (line 70) | void testrun_stdtest_shabal(void){
function testshort (line 91) | void testshort(void){
function shabal_ctx_dump (line 97) | void shabal_ctx_dump(shabal_ctx_t *ctx){
function testinit_192 (line 134) | void testinit_192(void){
function testinit_224 (line 140) | void testinit_224(void){
function testinit_256 (line 146) | void testinit_256(void){
function testinit_384 (line 152) | void testinit_384(void){
function testinit_512 (line 158) | void testinit_512(void){
function testinit (line 163) | void testinit(void){
function performance_shabal (line 171) | void performance_shabal(void){
function testrun_nessie_shabal (line 175) | void testrun_nessie_shabal(void){
function main (line 214) | int main (void){
FILE: test_src/main-shabea-test.c
function shabea_genctx_dummy (line 40) | void shabea_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function shabea_enc_dummy (line 44) | void shabea_enc_dummy(void *buffer, void *ctx){
function shabea_dec_dummy (line 48) | void shabea_dec_dummy(void *buffer, void *ctx){
function testrun_nessie_shabea (line 53) | void testrun_nessie_shabea(void){
function testrun_performance_shabea (line 66) | void testrun_performance_shabea(void){
function testencrypt (line 99) | void testencrypt(uint8_t *block, uint8_t *key){
function testdecrypt (line 109) | void testdecrypt(uint8_t *block, uint8_t *key){
function testrun_shabea (line 120) | void testrun_shabea(void){
function main (line 175) | int main (void){
FILE: test_src/main-shacal1_enc-test.c
function shacal1_genctx_dummy (line 35) | void shacal1_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function shacal1_enc_dummy (line 39) | void shacal1_enc_dummy(void *buffer, void *ctx){
function testrun_nessie_shacal1enc (line 43) | void testrun_nessie_shacal1enc(void){
function testrun_performance_shacal1enc (line 55) | void testrun_performance_shacal1enc(void){
function main (line 91) | int main (void){
FILE: test_src/main-shacal2_enc-test.c
function shacal2_genctx_dummy (line 35) | void shacal2_genctx_dummy(uint8_t *key, uint16_t keysize_b, void *ctx){
function shacal2_enc_dummy (line 39) | void shacal2_enc_dummy(void *buffer, void *ctx){
function testrun_nessie_shacal2enc (line 43) | void testrun_nessie_shacal2enc(void){
function testrun_performance_shacal2enc (line 55) | void testrun_performance_shacal2enc(void){
function main (line 91) | int main (void){
FILE: test_src/main-skein-test.c
function testrun_stdtest_skein256 (line 68) | void testrun_stdtest_skein256(uint16_t outsize_b){
function testrun_stdtest_skein512 (line 96) | void testrun_stdtest_skein512(uint16_t outsize_b){
function testrun_stdtest_skein1024 (line 124) | void testrun_stdtest_skein1024(uint16_t outsize_b){
function testrun_stdtest_skein (line 152) | void testrun_stdtest_skein(void){
function zeromsg_test_skein (line 158) | void zeromsg_test_skein(uint16_t outsize_b){
function zeromsg_test_common (line 184) | void zeromsg_test_common(char *p){
function performance_skein (line 199) | void performance_skein(void){
function testrun_nessie_skein (line 203) | void testrun_nessie_skein(void){
function test_monte2 (line 208) | void test_monte2(void){
function main (line 268) | int main (void){
FILE: test_src/main-skipjack-test.c
function skipjack_genctx_dummy (line 42) | void skipjack_genctx_dummy(uint8_t *key, uint16_t keysize, void *ctx){
function testrun_nessie_skipjack (line 46) | void testrun_nessie_skipjack(void){
function testrun_performance_skipjack (line 51) | void testrun_performance_skipjack(void){
function test_enc (line 55) | int test_enc(const void *buffer, void *key){
function testrun_nist_vectors (line 77) | void testrun_nist_vectors(void){
function testencrypt (line 107) | void testencrypt(uint8_t *block, uint8_t *key){
function testdecrypt (line 117) | void testdecrypt(uint8_t *block, uint8_t *key){
function testrun_skipjack (line 127) | void testrun_skipjack(void){
function main (line 168) | int main (void){
FILE: test_src/main-tdes-test.c
function testrun_nessie_tdes (line 44) | void testrun_nessie_tdes(void){
function testrun_performance_tdes (line 49) | void testrun_performance_tdes(void){
function main (line 69) | int main (void){
FILE: test_src/main-test-common.c
function std_stream_put (line 22) | static
function std_stream_get (line 33) | static
function main_setup (line 38) | void main_setup(void){
function welcome_msg (line 45) | void welcome_msg(const char *algoname){
FILE: test_src/main-threefish-test.c
function threefish256_dump (line 47) | void threefish256_dump(threefish256_ctx_t *ctx){
function testrun_nessie_threefish (line 61) | void testrun_nessie_threefish(void){
function testrun_stdtest_threefish256 (line 65) | void testrun_stdtest_threefish256(void){
function testrun_stdtest_threefish512 (line 113) | void testrun_stdtest_threefish512(void){
function testrun_stdtest_threefish1024 (line 166) | void testrun_stdtest_threefish1024(void){
function testrun_stdtest_threefish (line 214) | void testrun_stdtest_threefish(void){
function testrun_performance_threefish (line 220) | void testrun_performance_threefish(void){
function init_test (line 224) | void init_test(void){
function main (line 262) | int main (void){
FILE: test_src/main-trivium-test.c
function testrun_nessie_trivium (line 38) | void testrun_nessie_trivium(void){
function testrun_trivium (line 42) | void testrun_trivium(void){
function testrun_performance_trivium (line 91) | void testrun_performance_trivium(void){
function main (line 137) | int main (void){
FILE: test_src/main-twister-test.c
function testrun_nessie_twister (line 54) | void testrun_nessie_twister(void){
function test_twister224 (line 63) | void test_twister224( void *msg, uint32_t length_b){
function test_twister256 (line 67) | void test_twister256( void *msg, uint32_t length_b){
function test_twister384 (line 71) | void test_twister384( void *msg, uint32_t length_b){
function test_twister512 (line 75) | void test_twister512( void *msg, uint32_t length_b){
function testrun_twister (line 79) | void testrun_twister(void){
function testrun_performance_twister (line 105) | void testrun_performance_twister(void){
function main (line 133) | int main (void){
FILE: test_src/main-ubi-test.c
function testrun_stdtest_ubi256 (line 34) | void testrun_stdtest_ubi256(uint16_t outsize){
function testrun_stdtest_ubi512 (line 62) | void testrun_stdtest_ubi512(uint16_t outsize){
function testrun_stdtest_ubi1024 (line 99) | void testrun_stdtest_ubi1024(uint16_t outsize){
function testrun_stdtest_ubi (line 153) | void testrun_stdtest_ubi(void){
function main (line 188) | int main (void){
FILE: test_src/main-whirlpool-0-test.c
function testrun_nessie_whirlpool (line 47) | void testrun_nessie_whirlpool(void){
function testrun_whirlpool (line 51) | void testrun_whirlpool(void){
function testrun_performance_whirlpool (line 66) | void testrun_performance_whirlpool(void){
function testrun_nessie2 (line 70) | void testrun_nessie2(void){
function main (line 151) | int main (void){
FILE: test_src/main-whirlpool-t-test.c
function testrun_nessie_whirlpool (line 48) | void testrun_nessie_whirlpool(void){
function testrun_whirlpool (line 52) | void testrun_whirlpool(void){
function testrun_performance_whirlpool (line 67) | void testrun_performance_whirlpool(void){
function testrun_nessie2 (line 71) | void testrun_nessie2(void){
function main (line 152) | int main (void){
FILE: test_src/main-whirlpool-test.c
function testrun_nessie_whirlpool (line 47) | void testrun_nessie_whirlpool(void){
function testrun_whirlpool (line 51) | void testrun_whirlpool(void){
function testrun_performance_whirlpool (line 66) | void testrun_performance_whirlpool(void){
function testrun_nessie2 (line 70) | void testrun_nessie2(void){
function main (line 151) | int main (void){
FILE: test_src/main-xtea-test.c
function testrun_nessie_xtea (line 43) | void testrun_nessie_xtea(void){
function testrun_performance_xtea (line 47) | void testrun_performance_xtea(void){
function test_xtea (line 51) | void test_xtea(void){
function main (line 87) | int main (void){
FILE: test_src/nessie_bc_test.c
function nessie_bc_init (line 35) | void nessie_bc_init(void){
function nessie_bc_free (line 38) | static
function nessie_bc_enc (line 44) | void nessie_bc_enc(uint8_t *key, uint8_t *pt){
function nessie_bc_dec (line 79) | void nessie_bc_dec(uint8_t *key, uint8_t *ct){
function nessie_bc_run (line 95) | void nessie_bc_run(void){
FILE: test_src/nessie_bc_test.h
type nessie_bc_ctx_t (line 29) | typedef struct nessie_bc_ctx_st{
FILE: test_src/nessie_common.c
function nessie_set_output_stream (line 38) | void nessie_set_output_stream(FILE *out_stream){
function nessie_send_alive (line 44) | void nessie_send_alive(void){
function nessie_send_alive_a (line 48) | void nessie_send_alive_a(uint16_t i){
function nessie_print_block (line 54) | void nessie_print_block(uint8_t *block, uint16_t blocksize_bit){
function nessie_print_item (line 65) | void nessie_print_item(const char *name, uint8_t *buffer, uint16_t size_B){
function nessie_print_set_vector (line 101) | void nessie_print_set_vector(uint8_t set, uint16_t vector){
function nessie_print_setheader (line 109) | void nessie_print_setheader(uint8_t set){
function nessie_print_header (line 124) | void nessie_print_header(const char *name,
function nessie_print_footer (line 164) | void nessie_print_footer(void){
FILE: test_src/nessie_hash_test.c
function ascii_hash_P (line 41) | static
function amillion_hash (line 66) | static
function zero_hash (line 89) | static
function one_in512_hash (line 109) | static
function tv4_hash (line 137) | static
function nessie_hash_run (line 181) | void nessie_hash_run(void){
FILE: test_src/nessie_hash_test.h
type nessie_hash_ctx_t (line 30) | typedef struct nessie_hash_ctx_st{
FILE: test_src/nessie_mac_test.c
function ascii_mac_P (line 52) | static
function amillion_mac (line 78) | static
function zero_mac (line 103) | static
function one_in512_mac (line 124) | static
function tv4_mac (line 156) | static
function nessie_mac_run (line 189) | void nessie_mac_run(void){
FILE: test_src/nessie_mac_test.h
type nessie_mac_ctx_t (line 30) | typedef struct nessie_mac_ctx_st{
FILE: test_src/nessie_stream_test.c
function nessie_gen_block (line 40) | static
function nessie_stream_enc (line 48) | static
function nessie_stream_enc_large (line 92) | static
function nessie_stream_run (line 137) | void nessie_stream_run(void){
FILE: test_src/nessie_stream_test.h
type nessie_stream_ctx_t (line 27) | typedef struct nessie_stream_ctx_st{
FILE: test_src/performance_test.c
function ISR (line 49) | ISR(TIMER1_OVF_vect){
function calibrateTimer (line 53) | void calibrateTimer(void){
function startTimer (line 64) | void startTimer(uint8_t granularity){
function stopTimer (line 73) | uint64_t stopTimer(void){
function getOverhead (line 82) | void getOverhead(uint16_t *constoh, uint16_t *intoh){
function print_time_P (line 87) | void print_time_P(PGM_P s, uint32_t t){
function print_overhead (line 91) | void print_overhead(void){
FILE: test_src/shavs.c
function shavs_listalgos (line 56) | void shavs_listalgos(void){
function shavs_setalgo (line 69) | void shavs_setalgo(char *param){
type shavs_ctx_t (line 102) | typedef struct {
function buffer_add (line 113) | uint8_t buffer_add(char c){
function my_strtoul (line 145) | static
function getLength (line 162) | int32_t getLength(void){
function shavs_test1 (line 190) | void shavs_test1(void){ /* KAT tests */
function shavs_test2 (line 327) | void shavs_test2(void){ /* Monte Carlo tests for SHA-1 & SHA-2 */
function shavs_test3 (line 412) | void shavs_test3(void){ /* Monte Carlo tests for SHA-3 */
FILE: test_src/uart_i.h
type uart0_ctx_t (line 86) | typedef struct{
type uart1_ctx_t (line 109) | typedef struct{
Copy disabled (too large)
Download .json
Condensed preview — 1086 files, each showing path, character count, and a content snippet. Download the .json file for the full structured content (107,535K chars).
[
{
"path": "COPYING",
"chars": 18321,
"preview": "\t\t GNU GENERAL PUBLIC LICENSE\r\n\t\t Version 2, June 1991\r\n\r\n Copyright (C) 1989, 1991 Free Software Foundation, I"
},
{
"path": "COPYING.gpl2",
"chars": 18321,
"preview": "\t\t GNU GENERAL PUBLIC LICENSE\r\n\t\t Version 2, June 1991\r\n\r\n Copyright (C) 1989, 1991 Free Software Foundation, I"
},
{
"path": "COPYING.gpl3",
"chars": 35147,
"preview": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free "
},
{
"path": "Doxyfile",
"chars": 9187,
"preview": "# Doxyfile 1.4.7\n\n#---------------------------------------------------------------------------\n# Project related configu"
},
{
"path": "LICENSE",
"chars": 18321,
"preview": "\t\t GNU GENERAL PUBLIC LICENSE\r\n\t\t Version 2, June 1991\r\n\r\n Copyright (C) 1989, 1991 Free Software Foundation, I"
},
{
"path": "LICENSE.gpl2",
"chars": 18321,
"preview": "\t\t GNU GENERAL PUBLIC LICENSE\r\n\t\t Version 2, June 1991\r\n\r\n Copyright (C) 1989, 1991 Free Software Foundation, I"
},
{
"path": "LICENSE.gpl3",
"chars": 35147,
"preview": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free "
},
{
"path": "Makefile_en21",
"chars": 915,
"preview": "# Makefile for the AVR-Crypto-Lib project\n#\n# This file is part of the AVR-Crypto-Lib.\n# Copyright (C) 2010 Daniel"
},
{
"path": "Makefile_en21_conf.inc",
"chars": 721,
"preview": "\nMCU_TARGET = atmega128\nF_CPU = 14745600\nOPTIMIZE = -Os # -Os\nEXTRALINK = xram.o\nDEFS "
},
{
"path": "Makefile_m644",
"chars": 915,
"preview": "# Makefile for the AVR-Crypto-Lib project\n#\n# This file is part of the AVR-Crypto-Lib.\n# Copyright (C) 2010 Daniel"
},
{
"path": "Makefile_m644_conf.inc",
"chars": 1027,
"preview": "\nMCU_TARGET = atmega644\nF_CPU = 20000000\nOPTIMIZE = -Os # -Os\nEXTRALINK = \nDEFS = -D$("
},
{
"path": "Makefile_main.inc",
"chars": 12045,
"preview": "# Makefile for the AVR-Crypto-Lib project\n#\n# This file is part of the AVR-Crypto-Lib.\n# Copyright (C) 2010 Daniel"
},
{
"path": "Makefile_sys_conf.inc",
"chars": 1418,
"preview": "MAKE_DEBUG = 1\n\nDEBUG = -gdwarf-2\nWARNING = -pedantic -Wall -Werror -Wstrict-prototypes\nPROGRAMMER "
},
{
"path": "USAGE.blockciphers",
"chars": 13529,
"preview": "===================================\n= Usage of blockciphers = \n===================================\n\nAuthor: D"
},
{
"path": "USAGE.hashfunctions",
"chars": 3198,
"preview": "===================================\n= Usage of hash functions = \n===================================\n\nAuthor: D"
},
{
"path": "USAGE.streamciphers",
"chars": 2953,
"preview": "====================================\n= Usage of streamciphers = \n====================================\n\nAuthor"
},
{
"path": "__gmsl",
"chars": 38722,
"preview": "# ----------------------------------------------------------------------------\n#\n# GNU Make Standard Library (GMSL)\n#\n# "
},
{
"path": "a51/A5_1.c",
"chars": 3407,
"preview": "/* A5_1.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "a51/A5_1.h",
"chars": 1689,
"preview": "/* A5_1.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "aes/aes.h",
"chars": 1210,
"preview": "/* aes.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "aes/aes128_dec.c",
"chars": 1072,
"preview": "/* aes128_dec.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes128_dec.h",
"chars": 1374,
"preview": "/* aes128_dec.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes128_enc.c",
"chars": 1072,
"preview": "/* aes128_enc.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes128_enc.h",
"chars": 1375,
"preview": "/* aes128_enc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes192_dec.c",
"chars": 1072,
"preview": "/* aes192_dec.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes192_dec.h",
"chars": 1374,
"preview": "/* aes192_dec.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes192_enc.c",
"chars": 1072,
"preview": "/* aes192_enc.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes192_enc.h",
"chars": 1375,
"preview": "/* aes192_enc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes256_dec.c",
"chars": 1072,
"preview": "/* aes256_dec.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes256_dec.h",
"chars": 1374,
"preview": "/* aes256_dec.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes256_enc.c",
"chars": 1072,
"preview": "/* aes256_enc.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes256_enc.h",
"chars": 1375,
"preview": "/* aes256_enc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "aes/aes_dec-asm.S",
"chars": 6173,
"preview": "/* aes_dec-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.ot"
},
{
"path": "aes/aes_dec-asm_faster.S",
"chars": 9420,
"preview": "/* aes_dec-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.ot"
},
{
"path": "aes/aes_dec.c",
"chars": 3900,
"preview": "/* aes.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "aes/aes_dec.h",
"chars": 1101,
"preview": "/* aes_dec.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "aes/aes_enc-asm.S",
"chars": 3470,
"preview": "/* aes_enc-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.ot"
},
{
"path": "aes/aes_enc.c",
"chars": 3000,
"preview": "/* aes_enc.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "aes/aes_enc.h",
"chars": 1102,
"preview": "/* aes_enc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "aes/aes_invsbox-asm.S",
"chars": 2598,
"preview": "/* aes_sbox-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.o"
},
{
"path": "aes/aes_invsbox.c",
"chars": 1668,
"preview": "/* aes inverted sbox */\n\n#include <stdint.h>\n#include <avr/pgmspace.h>\nconst uint8_t aes_invsbox[256] PROGMEM = {\n 0x52,"
},
{
"path": "aes/aes_invsbox.h",
"chars": 1035,
"preview": "/* aes_invsbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "aes/aes_keyschedule-asm.S",
"chars": 3890,
"preview": "/* aes_keyschedule-asm */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (dan"
},
{
"path": "aes/aes_keyschedule.c",
"chars": 2752,
"preview": "/* aes_keyschedule.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (danie"
},
{
"path": "aes/aes_keyschedule.h",
"chars": 2579,
"preview": "/* aes_keyschedule.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte"
},
{
"path": "aes/aes_sbox-asm.S",
"chars": 2594,
"preview": "/* aes_sbox-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.o"
},
{
"path": "aes/aes_sbox.c",
"chars": 1657,
"preview": "/* aes sbox */\n\n#include <stdint.h>\n#include <avr/pgmspace.h>\nconst uint8_t aes_sbox[256] PROGMEM = {\n 0x63, 0x7c, 0x77,"
},
{
"path": "aes/aes_sbox.h",
"chars": 1020,
"preview": "/* aes_sbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "aes/aes_types.h",
"chars": 1365,
"preview": "/* aes.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "arcfour/arcfour-asm.S",
"chars": 2847,
"preview": "/* arcfour-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "arcfour/arcfour.c",
"chars": 1884,
"preview": "/* arcfour.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "arcfour/arcfour.h",
"chars": 2775,
"preview": "/* arcfour.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "avr-asm-macros.S",
"chars": 3662,
"preview": "/* avr-asm-macros.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@"
},
{
"path": "avr-makefile.inc",
"chars": 1956,
"preview": "\nMCU_TARGET = atmega128\nF_CPU = 14745600\nOPTIMIZE = -Os # -Os\nEXTRALINK = xram.o\nDEBUG "
},
{
"path": "base64/base64_dec.c",
"chars": 4237,
"preview": "/* base64_dec.c */\n/*\n * This file is part of the AVR-Crypto-Lib.\n * Copyright (C) 2006, 2007, 2008 Daniel Otte (da"
},
{
"path": "base64/base64_dec.h",
"chars": 1017,
"preview": "/* base64_dec.h */\n/*\n * This file is part of the AVR-Crypto-Lib.\n * Copyright (C) 2006, 2007, 2008 Daniel Otte (da"
},
{
"path": "base64/base64_enc.c",
"chars": 2836,
"preview": "/* base64_enc.c */\n/*\n * This file is part of the AVR-Crypto-Lib.\n * Copyright (C) 2006, 2007, 2008 Daniel Otte (da"
},
{
"path": "base64/base64_enc.h",
"chars": 967,
"preview": "/* base64_enc.h */\n/*\n * This file is part of the AVR-Crypto-Lib.\n * Copyright (C) 2006, 2007, 2008 Daniel Otte (da"
},
{
"path": "bcal/bcal-basic.c",
"chars": 2884,
"preview": "/* bcal-basic.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal-basic.h",
"chars": 1408,
"preview": "/* bcal-basic.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal-cbc.c",
"chars": 2647,
"preview": "/* bcal-cbc.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal-cbc.h",
"chars": 1632,
"preview": "/* bcal-cbc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-cfb_bit.c",
"chars": 3726,
"preview": "/* bcal-cfb_bit.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal-cfb_bit.h",
"chars": 1701,
"preview": "/* bcal-cfb_bit.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal-cfb_byte.c",
"chars": 2800,
"preview": "/* bcal-cfb_byte.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal-cfb_byte.h",
"chars": 1635,
"preview": "/* bcal-cbc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-cmac.c",
"chars": 4378,
"preview": "/* bcal-omac.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal-cmac.h",
"chars": 1630,
"preview": "/* bcal-cmac.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal-ctr.c",
"chars": 2794,
"preview": "/* bcal-ctr.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-ctr.h",
"chars": 1644,
"preview": "/* bcal-ctr.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-eax.c",
"chars": 3678,
"preview": "/* bca-eax.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)\n"
},
{
"path": "bcal/bcal-eax.h",
"chars": 2060,
"preview": "/* bcal-eax.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-nessie.c",
"chars": 2700,
"preview": "/* bcal-nessie.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal-nessie.h",
"chars": 1132,
"preview": "/* bcal-nessie.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal-ofb.c",
"chars": 2359,
"preview": "/* bcal-ofb.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-ofb.h",
"chars": 1550,
"preview": "/* bcal-ofb.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "bcal/bcal-performance.c",
"chars": 5328,
"preview": "/* bcal-performance.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte"
},
{
"path": "bcal/bcal-performance.h",
"chars": 1169,
"preview": "/* bcal-performance.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte"
},
{
"path": "bcal/bcal_aes128.c",
"chars": 1587,
"preview": "/* bcal_aes128.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_aes128.h",
"chars": 1126,
"preview": "/* bcal_aes128.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_aes192.c",
"chars": 1587,
"preview": "/* bcal_aes192.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_aes192.h",
"chars": 1126,
"preview": "/* bcal_aes192.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_aes256.c",
"chars": 1587,
"preview": "/* bcal_aes256.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_aes256.h",
"chars": 1126,
"preview": "/* bcal_aes256.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_camellia128.c",
"chars": 1575,
"preview": "/* bcal_camellia128.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ott"
},
{
"path": "bcal/bcal_camellia128.h",
"chars": 1098,
"preview": "/* bcal_camellia128.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ott"
},
{
"path": "bcal/bcal_cast5.c",
"chars": 1507,
"preview": "/* bcal_cast5.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_cast5.h",
"chars": 1077,
"preview": "/* bcal_cast5.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_cast6.c",
"chars": 1511,
"preview": "/* bcal_cast6.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_cast6.h",
"chars": 1077,
"preview": "/* bcal_cast6.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_cscipher.c",
"chars": 1539,
"preview": "/* bcal_cscipher.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@r"
},
{
"path": "bcal/bcal_cscipher.h",
"chars": 1089,
"preview": "/* bcal_cscipher.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@r"
},
{
"path": "bcal/bcal_des.c",
"chars": 1628,
"preview": "/* bcal_des.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_des.h",
"chars": 1069,
"preview": "/* bcal_des.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_khazad.c",
"chars": 1511,
"preview": "/* bcal_khazad.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2011 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_khazad.h",
"chars": 1081,
"preview": "/* bcal_khazad.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub"
},
{
"path": "bcal/bcal_noekeon.c",
"chars": 947,
"preview": "/* bcal_noekeon.c */\n\n#include <avr/pgmspace.h>\n#include <stdlib.h>\n#include \"blockcipher_descriptor.h\"\n#include \"noekeo"
},
{
"path": "bcal/bcal_noekeon.h",
"chars": 227,
"preview": "/* bcal_noekeon.h */\n\n#include <avr/pgmspace.h>\n#include \"blockcipher_descriptor.h\"\n#include \"noekeon.h\"\n#include \"keysi"
},
{
"path": "bcal/bcal_present128.c",
"chars": 1555,
"preview": "/* bcal_present.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_present128.h",
"chars": 1091,
"preview": "/* bcal_present.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_present80.c",
"chars": 1544,
"preview": "/* bcal_present.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_present80.h",
"chars": 1089,
"preview": "/* bcal_present.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_rc5.c",
"chars": 1633,
"preview": "/* bcal_rc5.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_rc5.h",
"chars": 1069,
"preview": "/* bcal_rc5.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_rc6.c",
"chars": 1487,
"preview": "/* bcal_rc6.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_rc6.h",
"chars": 1069,
"preview": "/* bcal_rc6.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bcal/bcal_seed.c",
"chars": 1484,
"preview": "/* bcal_seed.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/bcal_seed.h",
"chars": 1073,
"preview": "/* bcal_seed.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/bcal_serpent.c",
"chars": 1719,
"preview": "/* bcal_serpent.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_serpent.h",
"chars": 1085,
"preview": "/* bcal_serpent.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "bcal/bcal_skipjack.c",
"chars": 1509,
"preview": "/* bcal_skipjack.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@r"
},
{
"path": "bcal/bcal_skipjack.h",
"chars": 1089,
"preview": "/* bcal_skipjack.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@r"
},
{
"path": "bcal/bcal_tdes.c",
"chars": 1645,
"preview": "/* bcal_tdes.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/bcal_tdes.h",
"chars": 1072,
"preview": "/* bcal_tdes.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/bcal_tdes2.c",
"chars": 1787,
"preview": "/* bcal_tdes2.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_tdes2.h",
"chars": 1147,
"preview": "/* bcal_tdes2.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "bcal/bcal_threefish1024.c",
"chars": 1705,
"preview": "/* bcal_threefish1024.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.o"
},
{
"path": "bcal/bcal_threefish1024.h",
"chars": 1102,
"preview": "/* bcal_threefis1024.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ot"
},
{
"path": "bcal/bcal_threefish256.c",
"chars": 1689,
"preview": "/* bcal_threefish256.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ot"
},
{
"path": "bcal/bcal_threefish256.h",
"chars": 1099,
"preview": "/* bcal_threefis256.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ott"
},
{
"path": "bcal/bcal_threefish512.c",
"chars": 1689,
"preview": "/* bcal_threefish512.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ot"
},
{
"path": "bcal/bcal_threefish512.h",
"chars": 1099,
"preview": "/* bcal_threefis512.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ott"
},
{
"path": "bcal/bcal_xtea.c",
"chars": 1646,
"preview": "/* bcal_xtea.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/bcal_xtea.h",
"chars": 1073,
"preview": "/* bcal_xtea.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bcal/mov1.sed",
"chars": 177,
"preview": "sx#include\\([^\"<]*[\"<]\\)noekeonx#include\\1noekeon/noekeonx\nsq#include\\([^\"<]*[\"<]\\)memxorq#include\\1memxor/memxorq\nsq#in"
},
{
"path": "bigint/bigint-stub.c",
"chars": 18261,
"preview": "/* bigint.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n"
},
{
"path": "bigint/bigint.c",
"chars": 32849,
"preview": "/* bigint.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n"
},
{
"path": "bigint/bigint.h",
"chars": 3973,
"preview": "/* bigint.h */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n"
},
{
"path": "bigint/bigint_add_u.S",
"chars": 2635,
"preview": "/* bigint_add_u.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub"
},
{
"path": "bigint/bigint_adjust.S",
"chars": 2039,
"preview": "/* bigint_adjust.S */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel.ot"
},
{
"path": "bigint/bigint_asm.S",
"chars": 4908,
"preview": "/* bigint_asm.S */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel.otte@"
},
{
"path": "bigint/bigint_io.c",
"chars": 3403,
"preview": "/* bigint_io.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "bigint/bigint_io.h",
"chars": 958,
"preview": "/* bigint_io.h */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "blake/blake_common.c",
"chars": 1742,
"preview": "/* blake_common.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@ru"
},
{
"path": "blake/blake_common.h",
"chars": 1117,
"preview": "/* blake_common.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@ru"
},
{
"path": "blake/blake_large.c",
"chars": 7217,
"preview": "/* blake_large.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub"
},
{
"path": "blake/blake_large.h",
"chars": 2334,
"preview": "/* blake_large.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub"
},
{
"path": "blake/blake_small.c",
"chars": 6842,
"preview": "/* blake_small.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub"
},
{
"path": "blake/blake_small.h",
"chars": 2333,
"preview": "/* blake_small.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub"
},
{
"path": "blockcipher_descriptor.h",
"chars": 2470,
"preview": "/* blockcipher_descriptor.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (dani"
},
{
"path": "bmw/bmw_224-tinyasm.S",
"chars": 19998,
"preview": "/* bmw_small-tinyasm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.ot"
},
{
"path": "bmw/bmw_256-tinyasm.S",
"chars": 20486,
"preview": "/* bmw_small-tinyasm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.ot"
},
{
"path": "bmw/bmw_large.c",
"chars": 15166,
"preview": "/* bmw_large.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bmw/bmw_large.h",
"chars": 2212,
"preview": "/* bmw_large.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bmw/bmw_small-asm.S",
"chars": 37469,
"preview": "/* bmw_small-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@r"
},
{
"path": "bmw/bmw_small-tinyasm.S",
"chars": 21506,
"preview": "/* bmw_small-tinyasm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.ot"
},
{
"path": "bmw/bmw_small.c",
"chars": 14485,
"preview": "/* bmw_small.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bmw/bmw_small.h",
"chars": 2211,
"preview": "/* bmw_small.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2009 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "bmw/f0-opt-table.txt",
"chars": 1748,
"preview": "\n\n\tq[ 0] = (+ h[ 5] - h[ 7] + h[10] + h[13] + h[14]);\n\tq[ 1] = (+ h[ 6] - h[ 8] + h[11] + h[14] - h[15]);\n\tq[ 2] = (+ h["
},
{
"path": "camellia/camellia-asm.S",
"chars": 17753,
"preview": "/* camellia-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@ru"
},
{
"path": "camellia/camellia.h",
"chars": 1170,
"preview": "/* camellia.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "camellia/camellia128-stub.c",
"chars": 7151,
"preview": "/* camellia128-stub.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.ott"
},
{
"path": "camellia/camellia_C.c",
"chars": 14346,
"preview": "/* camellia_C.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "cast5/cast5-sbox.c",
"chars": 59142,
"preview": "/* cast5-sbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "cast5/cast5-sbox.h",
"chars": 1266,
"preview": "/* cast5-sbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "cast5/cast5.c",
"chars": 11778,
"preview": "/* cast5.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n"
},
{
"path": "cast5/cast5.h",
"chars": 3112,
"preview": "/* cast5.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n"
},
{
"path": "cast6/cast6-sbox.c",
"chars": 29993,
"preview": "/* cast6-sbox.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "cast6/cast6-sbox.h",
"chars": 1184,
"preview": "/* cast6-sbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub."
},
{
"path": "cast6/cast6.c",
"chars": 6077,
"preview": "/* \n * File:\tcast6.c\n * Author:\tDaniel Otte\n * Date: \t09.09.2006\n * License: GPL\n * Description: Implementation of the C"
},
{
"path": "cast6/cast6.h",
"chars": 438,
"preview": "#ifndef CAST6_H_\n#define CAST6_H_\n\n#include <stdint.h>\n\n#define CAST6_ROUNDS 12\n\n/* size of this is 222 byte (HUGE) */\nt"
},
{
"path": "cscipher/cscipher.h",
"chars": 1081,
"preview": "/* cscipher.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "cscipher/cscipher_sbox.c",
"chars": 2431,
"preview": "/* cscipher_sbox.c */\n/*\n This file is part of the AVM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel.ot"
},
{
"path": "cscipher/cscipher_sbox.h",
"chars": 945,
"preview": "/* cscipher_sbox.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@ru"
},
{
"path": "cscipher/cscipher_small.c",
"chars": 4159,
"preview": "/* cscipher_small_core.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (dan"
},
{
"path": "cscipher/cscipher_tiny_asm.S",
"chars": 6760,
"preview": "/* cscipher_tiny_asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (danie"
},
{
"path": "cscipher/sbox_check.rb",
"chars": 1842,
"preview": "$sbox = [\n 0x29, 0x0d, 0x61, 0x40, 0x9c, 0xeb, 0x9e, 0x8f, 0x1f, 0x85, 0x5f, 0x58, 0x5b, 0x01, 0x39, 0x86,\n 0x97, 0x2e"
},
{
"path": "cubehash/cubehash.c",
"chars": 4637,
"preview": "/* cubehash.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "cubehash/cubehash.h",
"chars": 2051,
"preview": "/* cubehash.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "cubehash/cubehash_rotates.S",
"chars": 1184,
"preview": "/* cubehash_rotates.S */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel"
},
{
"path": "cubehash/cubehash_rotates.h",
"chars": 967,
"preview": "/* cubehash_rotates.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte"
},
{
"path": "cubehash/xchg.S",
"chars": 1097,
"preview": "/* xchg.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "cubehash/xchg.h",
"chars": 898,
"preview": "/* xchg.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "debug.h",
"chars": 1226,
"preview": "/* debug.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n"
},
{
"path": "des/des.c",
"chars": 10082,
"preview": "/* des.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2010 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "des/des.h",
"chars": 4070,
"preview": "/* des.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "doc/acl-guide.texi",
"chars": 5023,
"preview": "\\input texinfo @c -*-texinfo-*-\n@c %**start of header\n@setfilename acl-manual.info\n@settitle AVR/ARM-Crypto-Lib Manual "
},
{
"path": "doc/acl_blockciphers.texi",
"chars": 11587,
"preview": "@c acl_blockcipher.texi\n\n@section Block ciphers\n A block cipher is a algorithm which turns an input of fixed length into"
},
{
"path": "doc/acl_hashes.texi",
"chars": 9449,
"preview": "@c acl_hashes.texi\n\n@section Hash functions\n A hash function is an algorithm to map an arbitrary long message (in the fo"
},
{
"path": "doc/acl_keysizes.texi",
"chars": 2893,
"preview": "@c acl_keysizes.texi\n\n@section Keysize descriptors\nThere are a lot of different block ciphers or cryptographic algorithm"
},
{
"path": "doc/acl_streamciphers.texi",
"chars": 2571,
"preview": "@c acl_streamciphers.texi\n@section Stream ciphers\n A stream cipher normally generates a deterministic, random looking st"
},
{
"path": "dsa/dsa.h",
"chars": 1876,
"preview": "/* dsa.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "dsa/dsa_key_blob.c",
"chars": 11906,
"preview": "/* dsa_key_blob.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub"
},
{
"path": "dsa/dsa_key_blob.h",
"chars": 901,
"preview": "/* dsa_key_blob.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub"
},
{
"path": "dsa/dsa_sign.c",
"chars": 2339,
"preview": "/* dsa_sign.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)"
},
{
"path": "dsa/dsa_verify.c",
"chars": 2425,
"preview": "/* dsa_verify.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "ecdsa/ecc.h",
"chars": 3329,
"preview": "/* ecc.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2012 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "ecdsa/ecc_chudnovsky.c",
"chars": 14528,
"preview": "/* ecc_chudnovsky.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2012 Daniel Otte (daniel.o"
},
{
"path": "ecdsa/ecdsa.h",
"chars": 1937,
"preview": "/* ecdsa.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2012 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "ecdsa/ecdsa_sign.c",
"chars": 5826,
"preview": "/* ecdsa.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2006-2012 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "ecdsa/ecdsa_sign.h",
"chars": 1586,
"preview": "/* ecdsa_sign.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2012 Daniel Otte (daniel.otte@rub.d"
},
{
"path": "ecdsa/ecdsa_verify.c",
"chars": 78,
"preview": "/*\n * ecdsa_verify.c\n *\n * Created on: 07.10.2012\n * Author: bg\n */\n\n\n\n\n"
},
{
"path": "ecdsa/nist_p192.c",
"chars": 8165,
"preview": "/* p192.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2006-2012 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "ecdsa/nist_p192.h",
"chars": 1089,
"preview": "/* nist_p192.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2012 Daniel Otte (daniel.otte@rub.de"
},
{
"path": "ecdsa/random_dummy.c",
"chars": 866,
"preview": "/* random_dummy.c */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2006-2011 Daniel Otte (daniel.ott"
},
{
"path": "ecdsa/random_dummy.h",
"chars": 896,
"preview": "/* random.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2011 Daniel Otte (daniel.otte@rub.de)\n\n"
},
{
"path": "echo/aes_enc_round-asm.S",
"chars": 4493,
"preview": "/* aes_enc-asm.S */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2008, 2009 Daniel Otte (daniel.ot"
},
{
"path": "echo/aes_enc_round.h",
"chars": 1045,
"preview": "/* aes_enc_round.h */\n/*\n This file is part of the ARM-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@ru"
},
{
"path": "echo/echo.c",
"chars": 8748,
"preview": "/* echo.c */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)\n\n "
},
{
"path": "echo/echo.h",
"chars": 2507,
"preview": "/* echo.h */\n/*\n This file is part of the AVR-Crypto-Lib.\n Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)\n\n "
}
]
// ... and 886 more files (download for full content)
About this extraction
This page contains the full source code of the cantora/avr-crypto-lib GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 1086 files (250.1 MB), approximately 26.6M tokens, and a symbol index with 1554 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.