<--- Back to Details
First PageDocument Content
Security / Paillier cryptosystem / Merkle–Hellman knapsack cryptosystem / Niederreiter cryptosystem / Cryptography / Post-quantum cryptography / Cryptosystem / RSA / Semantic security / Public-key cryptography / Cyberwarfare / Applied mathematics
Date: 2011-05-05 15:39:42
Security
Paillier cryptosystem
Merkle–Hellman knapsack cryptosystem
Niederreiter cryptosystem
Cryptography
Post-quantum cryptography
Cryptosystem
RSA
Semantic security
Public-key cryptography
Cyberwarfare
Applied mathematics

Noname manuscript No. (will be inserted by the editor) Generalizing Cryptosystems Based on the Subset Sum Problem Aniket Kate · Ian Goldberg

Add to Reading List

Source URL: www.cypherpunks.ca

Download Document from Source Website

File Size: 200,08 KB

Share Document on Facebook

Similar Documents

An Attack on a Trace-Zero Cryptosystem Claus Diem and Jasper Scholten Institut f¨ ur Experimentelle Mathematik, Universit¨ at Duisburg-Essen, Germany and

An Attack on a Trace-Zero Cryptosystem Claus Diem and Jasper Scholten Institut f¨ ur Experimentelle Mathematik, Universit¨ at Duisburg-Essen, Germany and

DocID: 1uI0z - View Document

Communication services empowered with a classical chaos based cryptosystem G. Vidal 1  Institute of Physics

Communication services empowered with a classical chaos based cryptosystem G. Vidal 1 Institute of Physics

DocID: 1uDNn - View Document

FPGA-based Niederreiter Cryptosystem using Binary Goppa Codes Wen Wang1, Jakub Szefer1, and Ruben Niederhagen2 1. Yale University, USA 2. Fraunhofer Institute SIT, Germany April 9, 2018

FPGA-based Niederreiter Cryptosystem using Binary Goppa Codes Wen Wang1, Jakub Szefer1, and Ruben Niederhagen2 1. Yale University, USA 2. Fraunhofer Institute SIT, Germany April 9, 2018

DocID: 1ufAq - View Document

Published in Designs, Codes and Cryptography 14(1):53–56, Reducing the elliptic curve cryptosystem of Meyer-M¨ uller to the cryptosystem of Rabin-Williams

Published in Designs, Codes and Cryptography 14(1):53–56, Reducing the elliptic curve cryptosystem of Meyer-M¨ uller to the cryptosystem of Rabin-Williams

DocID: 1tWu0 - View Document

Optimally Sound Sigma Protocols Under DCRA Helger Lipmaa University of Tartu, Tartu, Estonia Abstract. Given a well-chosen additively homomorphic cryptosystem and a ⌃ protocol with linear answer, Damg˚

Optimally Sound Sigma Protocols Under DCRA Helger Lipmaa University of Tartu, Tartu, Estonia Abstract. Given a well-chosen additively homomorphic cryptosystem and a ⌃ protocol with linear answer, Damg˚

DocID: 1tMjN - View Document