Changes between Version 38 and Version 39 of StudentTasksProposals


Ignore:
Timestamp:
Feb 20, 2010, 7:24:07 PM (12 years ago)
Author:
Arno Wacker
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • StudentTasksProposals

    v38 v39  
    1818 * Implement the current status of cryptanalysis against hash algorithms. Show the effectiveness against reduced algorithms (explain collision resistance, 1st and 2nd preimage)
    1919 * Visualize hash functions (e.g. SHA1) in a modern way (not only the sensitivy and changes at the resulting hash value, but all changed bits after each step or round). See [http://www.iaik.tugraz.at/content/research/krypto/sha1/SHA1Collision_Description.php here]
    20  * Implement all major algorithms on permuations in CT2. See [http://www.codeproject.com/KB/recipes/Combinatorics.aspx 1] and [http://www.codeproject.com/KB/recipes/permute.aspx 2]. [1] discusses the six major types of combinatorial collections with examples and formulas for counting. Expands with a C# generics-based set of classes for enumerating each meta-collection.
     20 * Implement all major algorithms on permuations in CT2. See [http://www.codeproject.com/KB/recipes/Combinatorics.aspx 1] and [http://www.codeproject.com/KB/recipes/permute.aspx 2]. Tsis discusses the six major types of combinatorial collections with examples and formulas for counting. Expands with a C# generics-based set of classes for enumerating each meta-collection.
    2121
    2222=== Project ===