Structure vs. Hardness Through the Obfuscation Lens
© International Association for Cryptologic Research 2017. Much of modern cryptography, starting from public-key encryption and going beyond, is based on the hardness of structured (mostly algebraic) problems like factoring, discrete log or finding short lattice vectors. While structure is perhaps w...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Nature,
2021-11-08T20:11:45Z.
|
| Subjects: | |
| Online Access: | Get fulltext |