Changes between Version 52 and Version 53 of StudentTasksProposals


Ignore:
Timestamp:
Feb 23, 2010, 8:08:28 PM (12 years ago)
Author:
Arno Wacker
Comment:

Spelling corrections..

Legend:

Unmodified
Added
Removed
Modified
  • StudentTasksProposals

    v52 v53  
    1414 * SIGABA encryption, visualization and cryptanalysis
    1515 * Any hash function from [http://csrc.nist.gov/groups/ST/hash/sha-3/index.html SHA-3 contest], for the weak ones preferably with an attack sample ([http://ehash.iaik.tugraz.at/wiki/The_SHA-3_Zoo overview]) -- e.g. MD6 implementation [http://thor.info.uaic.ro/~fltiplea/CC/MD6.pdf (Spec)]
    16  * Vigenère-Autokey, Nihilist, Starddling Checkerboard, Ché Guevara, Boconian and their according cryptanalysis
     16 * Vigenère-Autokey, Nihilist, Straddling Checkerboard, Ché Guevara, Boconian and their according cryptanalysis
    1717 * Steganography visualization of different methods of [http://en.wikipedia.org/wiki/Steganography steganography]. ([http://www.codeproject.com/useritems/Visual_Cryptography.asp Example])
    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]. 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.
     20 * Implement all major algorithms on permutations in CT2. See [http://www.codeproject.com/KB/recipes/Combinatorics.aspx 1] and [http://www.codeproject.com/KB/recipes/permute.aspx 2]. This 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 * NTRU: implement, analyze, document (online help in English and one further language)
    2222 * McElize: implement, analyze, document (online help in English and one further language)
     
    2626 * Bar code and matrix codes: implement and visualize them. Also analyze scanned bar codes.
    2727 * Lorenz SZ42 encryption: Implement and analyze. Integrate in CT2 a C# version of the ADA code of the winner from [http://www.codesandciphers.org.uk/cevent.htm here].
    28  * Identity-based encyrption (IBE) according to C. Cocks, based on quadratic rescues. Implement, analyze, document (online help in English and one further language)
    29  * Import and export Cryptographic Keys in PKCS#8 and X.509 formats, see e.g.
     28 * Identity-based encryption (IBE) according to C. Cocks, based on quadratic rescues. Implement, analyze, document (online help in English and one further language)
     29 * Import and export Cryptographic Keys in PKCS!#8 and X.509 formats, see e.g.
    3030  * http://www.codeproject.com/KB/security/BlockCiphers.aspx
    3131  * http://www.codeproject.com/KB/security/PKCS12.aspx