Paper packs homomorphic ciphertexts using coset codes
The scheme packs k symbols into a length-n ciphertext and claims bounded chosen-plaintext security.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
The scheme packs k symbols into a length-n ciphertext and claims bounded chosen-plaintext security.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views