Loading...
Please wait, while we are loading the content...
Similar Documents
*Algorithms for Factoring and Computing Discrete Loga- rithms
| Content Provider | Scilit |
|---|---|
| Author | Katz, Jonathan Lindell, Yehuda |
| Copyright Year | 2014 |
| Description | In the last chapter, we introduced several number-theoretic problems-most prominently, factoring the product of two large primes and computing discrete logarithms in certain groups-that are widely believed to be hard. As defined there, this means there are presumed to be no polynomial-time algorithms for these problems. This asymptotic notion of hardness, however, tells us little about how to set the security parameter-sometimes called the key length, although the terms are not interchangeable-to achieve some desired, concrete level of security in practice. A proper understanding of this issue is extremely important for the real-world deployment of cryptosystems based on these problems. Setting the security parameter too low means a cryptosystem may be vulnerable to attacks more efficient than anticipated; being overly conservative and setting the security parameter too high will give good security, but at the expense of efficiency for the honest users. The relative difficulty of different number-theoretic problems can also play a role in determining which problems to use as the basis for building cryptosystems in the first place. Book Name: Introduction to Modern Cryptography |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2012-0-07206-0&isbn=9780429101489&doi=10.1201/b17668-15&format=pdf |
| Ending Page | 378 |
| Page Count | 18 |
| Starting Page | 361 |
| DOI | 10.1201/b17668-15 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2014-11-06 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Introduction To Modern Cryptography Hardness Discrete Building Computing Cryptosystems Extremely Security Parameter Number Theoretic Theoretic Problems |
| Content Type | Text |
| Resource Type | Chapter |