# Tag Info

4

"Algebraic Geometry Codes: Basic Notions" by Tsfasman, Vladut, and Nogin is a textbook that is available as a PDF. Discussion of Hermitian curves begins on page 167. I haven't read it and no very little about coding theory. It was the reference a friend provided in his dissertation, which included constructing universal hash functions from Hermitian curves.

4

Normally, test vectors, in particular test vectors for intermediate values, are to be found with whatever is the "official specification" for that algorithm. MARS has not been blessed with a standard (few algorithms are), so the "official specification" is what IBM distributes, in particular the MARS package (compressed archive). This package contains the ...

4

Generating prime integers and computing things modulo integers is easy with a programming language which features support for big integers. I usually use Java: it includes java.math.BigInteger, with which one can: generate prime integers of any length; do all basic operations, including modular reduction (mod() method); compute modular inverses (modInverse(...

2

If you use a high-level mathematical language (Mathematica, Maple, etc.), generating this data is very easy. I use Mathematica personally, but some are free and apparently very good. In a pinch, you can use Wolfram Alpha to do a lot: Generate random prime: RandomPrime[{2^1023,2^1024}] Random integer: RandomInteger[{2^1023,2^1024}] Inverse mod p: (...

2

Here's a simple PHP script that calculates bytes frequencies from 10 random Wikipedia articles: <?php $frequencies = array();$total = 0; for ($i=0;$i<256; $i++)$frequencies[$i] = 0; for ($i=0; $i<10;$i++) { $src = file_get_contents('https://en.wikipedia.org/wiki/Special:Random'); foreach (str_split($src) as $char) {$...

1

The course on coursera is similar to the course CS255 given in Stanford university. You can find the course homepage at CS255 course homepage. There are many homeworks and projects that you can check. To further reinforce the information presented, read the pages suggested in the "Readings" of the course syllabus at CS255 course syllabus

1

Not sure what you are trying to do but are you not approaching it the wrong way? NIST already recommends algoorithms/ciphers for use in their environments. This means they have vetted these and are deemed secure. Now you want performance as well. So use openssl and see which of the algorithms are of acceptable performance to you. Like you said choose key ...

Only top voted, non community-wiki answers of a minimum length are eligible