Tag Info

New answers tagged

8

Review of the paper The paper's goal is to offload to a server the computation of the inverse of a (non-singular) $n\times n$ matrix $X$ of (the floating-point approximation of) real numbers, while keeping $X$ and $X^{-1}$ confidential. Towards that goal, the paper's method is to draw a secret key consisting of two random permutations and $2n$ non-zero ...


2

Salsa/ChaCha and the other eSTREAM winners are likely to be the "fastest but still secure" options today. Don't forget authentication of course. Reduced-round ChaCha/Poly1305 is likely to be the fastest software-only option, due to tuned implementations in the libsodium and NaCl libraries. UPDATED: The following slide deck has good info on state of the art ...


-1

In your case I'd recommend you to try TripleDES, maybe with a paired ARM MCU - it's cheap and fast enough... Try to take a look at STM chips, I used them before and I have a very good recommendations due to price/perfomance. Also you can try to implement DES physically if you have a hi-speed requirement in your device's spec list.


1

Use AES-128, the instruction set in most CPU's (AES-NI) speeds up the encryption and does not put to much load on your CPU. I would use CBC but there might be better mode operations for encrypting files. Also don't forget to use a MAC. Using a one time pad (OTP) is nice but what you're doing is not an OTP it's more a Vigenère cipher. If you were to use OTP ...


2

If you are looking for something that is faster than AES, there are several options. HOWEVER (and this is a big one) if AES-NI instructions (hardware acceleration) are available to you, there is nothing that can come close. My computer is a few years old, and I get 3100MiB/s in CTR mode. That is 3 gigabytes every second. That is faster than the network ...


0

If efficiency and speed is an issue, you might want to have a look at protocols based on symmetric schemes and a trusted server for key exchange and authentication, e.g. Kerberos or Needham-Schroeder. Key exchange with DH is only required, if you want the coordinator node not to be able to listen in the other communications. But usually public key ...


2

As usual, inserting a backdoor in a symmetric cipher becomes a lot easier if you have knowledge your adversaries lack. DES is a pretty good (counter)example of how a backdoor could be introduced in a symmetric cipher. Back in 1974, IBM and the NSA both knew about differential cryptanalysis, but they did not publish their findings. Some 16 years later, ...



Top 50 recent answers are included