RSA-2048 are concerned, it is hard to make any sense of the projections in both time and memory space! Another way to analyze time projections for the factorization or logarithm prob- lem is to consider the progress actually realized over the last 30 years. Remarkably, the progress in key size and time is very closely linear, like another Moore's law. Note, however, that Moore's law is linear but in a logarithmic performance scale, unlike in the present case. From the aforementioned reference, the law can be expressed using the phenomenological formula sizedec=4.23x(Y-1970) +23, (25.5) where Y is the current year and the modulus size is expressed in the number of decimal digits. This linear law has been verified over the past 30 years. The projected years for solving 1024-bit keys (309 decimal digits) and 2048-bit keys (617 decimal digits) are 2037 and 2110, respectively. Other investigators have suggested a model, according to which the size should be dictated by a cubic law sizes (25.6) which gives the years 2017 or 2018 for reaching 1024-bit keys, and 2041 for reaching 2048-bit keys. We see that both laws predict that 1024-bit keys won't be solved before 20 years at the very least. Keys as large as 2048 bits might take 40 years (2040) or over a century (2110). It is important to note that such estimates are only based on publicly available data. Throughout history, it has always been assumed that government Classical and quantum cryptography agencies have always been ahead of any progress in this field, and the market implications of cryptography do not exclude the possibility that private, yet unpublicized, efforts, have already reached substantially higher performance. One final remark: there is no mathematical proof that breaking RSA absolutely requires factorization of the modulus n, it is just what is currently conjectured, until new breakthroughs may happen. But even this remark represents a conjecture by itself. The above facts, data, and estimates help one to grasp (at the very least) what the problem 