Combinatorial Cryptosystems Galore!

@inproceedings{FellowsCombinatorialCG,
  title={Combinatorial Cryptosystems Galore!},
  author={M. Fellows}
}
Our paper addresses a fundamental (but naive) question in the foundations of cryptography: Why haven’t the hosts of well-known NP-hard combinatorial problems been of use in designing cryptosystems? We offer three replies which differ radically from the conventional wisdom. (1) There is no good reason why NP-hard problems cannot serve as the basis for useful public-key cryptosystems. In particular, we argue that a number of general arguments concerning this issue that are commonly found in the… Expand
50 Citations
Gröbner bases for public key cryptography
Polly Cracker, Revisited
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
Polly Cracker, Revisited, Revisited
Improved known plaintexts attack on Domingo-Ferrer homomorphic cryptosystem
Cryptanalysis of the TRMS Signature Scheme of PKC'05
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Hiding information and signatures in trapdoor knapsacks
The Rise and Fall of Knapsack Cryptosystems
A note on the complexity of cryptography (Corresp.)
  • G. Brassard
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1979
Kid Krypto
Finding hidden Hamiltonian cycles
Sharp effective Nullstellensatz
Lower bounds on random-self-reducibility
Cryptosystems Based on Reversible Cellular Automata
Breaking Iterated Knapsacks
...
1
2
3
...