network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 9 months |
| seen | Apr 17 at 18:06 | |
| stats | profile views | 1 |
|
Aug 24 |
comment |
How do ciphers change plaintext into numeric digits for computing? HTTPS uses a symmetric cipher, which one is subject to negotiation between the parties. It's all quite complicated, but for sure it doesn't use RSA for the whole communication as this would be extremely inefficient. |
|
Aug 23 |
answered | How do ciphers change plaintext into numeric digits for computing? |
|
Aug 20 |
answered | Entropy of system data - use all and hash, or trim least significant bits? |
|
Aug 20 |
comment |
Trying to find an algorithm to share portions of a key with multiple people For implementation, I'd suggest using GF(256) over prime fields. It has no size limitations, works bytewise, need no padding, no multiple precision arithmetic, and is probably faster and easy to program (even I did it:D). It limits the number of shares to 255, which should suffice. |
|
Aug 19 |
comment |
What are the methods to construct a primitive binary nonlinear feedback shift register (NLFSR)? @Bluemilk: I'm quite sure there's no such thing as primitive binary NLFSR, since the word primitive comes from "primitive polynomial over GF(2)" which makes sense for a LFSR only. That said, I can live with your definition. I'm afraid the search algorithm was just some smarter exhaustive search... given the prescribed form, it looks possible to me. |
|
Aug 10 |
awarded | Supporter |
