Tag Info

4

Yes the Bernstein attack is applicable but the impact of the attack is reduced because the party generating the parameter is also going to be a legitimate participant of the key exchange. Here is why the attack does indeed apply. Consider a case where Bob and Alice wish to conduct a key exchange using the New Hope Lattice-Based Key Exchange. Bob will be ...

1

So, I does anybody know how to design a module for remainder operation in >verilog that computes the remainder in a single clock cycle? Any links to >literature discussing the algorithm would suffice. A nieve implementation would be something like. parameter bitwidth; input [bitwidth-1:0] a; input [bitwidth-1:0] b; output reg [bitwidth-1:0] result; reg ...

2

If we encrypt $m_1$, and send it to the server, can the server "somehow" find $E(m_1)$ and remove it? Nope; FHE allows a server that knows $E(m_1)$ and $E(m_2)$ to produce a ciphertext which is a representation of the value $E(m_1 \odot m_2)$ (for pretty much arbitrary functions $\odot$); what it doesn't allow a server to do is determine whether \$m_1 = ...

0

Not a real solution yet, sill: "linear time", I guess, means linear in number of strings. This is a reasonable efficiency expectation in case of relatively large number of short strings. There could be a solution, I guess, by deciding on incremental prefix or suffix of all candidate strings until the single match. This might grow into new research in private ...

Top 50 recent answers are included