Explore >> Select a destination
|
You are here 
|
blag.nullteilerfrei.de | ||
| | | | |
imapenguin.com
|
|
| | | | | What is an LFSR? An LFSR is a Linear Feedback Shift Register. It's a simple way of generating a sequence of numbers that look random. Used in cryptography and in generating pseudo-random numbers, they are interesting because they are so simple. Shift bits and feed a few of them back into the sequence. That's it. Important note: LFSRs are not cryptographically secure on their own. ESPECIALLY 8-bit LFSRs. More on that in the next post on this topic. | |
| | | | |
projectf.io
|
|
| | | | | Sometimes you need more precision than integers can provide, but floating-point computation is not trivial (try reading IEEE 754). You could use a library or IP block, but simple fixed point maths can often get the job done with little effort. Furthermore, most FPGAs have dedicated DSP blocks that make multiplication and addition of integers fast; we can take advantage of that with a fixed-point approach. | |
| | | | |
cp4space.hatsya.com
|
|
| | | | | A couple of years ago I described a primep which possesses various properties that renders it useful for computing number-theoretic transforms over the field $latex \mathbb{F}_p$. Specifically, we have: $latex p = \Phi_{192}(2) = \Phi_6(2^{32}) = 2^{64} - 2^{32} + 1$ where the first of these equalities uses the identity that: $latex \Phi_{k}(x) = \Phi_{rad(k)}(x^{k/rad(k)})$... | |
| | | | |
rog3rsm1th.github.io
|
|
| | | The Okamoto-Uchiyama cryptosystem is a semantically secure, asymmetric encryption algorithm. It was first introduced in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The method is additive-homomorphic, which means that the plaintexts are added by multiplying two ciphertexts. It is therefore not necessary to decrypt the ciphertexts in order to be able to operate on the plaintexts. While searching for implementations of this algorithm on github, I realized that there were only two rough implementations. | ||
