Pmarra

A MILESTONE

בר×?ש יתבר×? ×?להי×?
(BaRosh Yit-barê Elohim)
www.logonomics.it

The Discovery of the Title of the Bible
More than a milestone in the study of the Holy Scripture.

The word Bible was never intended to be the title of the work per se.
It derives from the Greek tê biblia which means little scrolls.
There is overwhelming evidence that the origin of the Biblical Text is supernatural.

Science and technology have always had many intrinsic limitations.
We can now rule out the hypothesis that the original written word in the Bible resulted from human intervention.

For example, the well-known RSA Cryptosystem (Rivest, Shamir and Adleman / 1978) bases its security on the computational impossibility to factor very large numbers, that is,

to break them up into prime factors.

Wads4

I suspect that a circle with Pi=3.0 would have been even more confusing!

Wads4

"The word Bible was never intended to be the title of the work per se.
It derives from the Greek tê biblia which means little scrolls."

"There is overwhelming evidence that the origin of the Biblical Text is supernatural."

How do you justify this last sentence?

TNorthover

This seems to be the only new part, but I'm afraid I don't see the point. What's it an example of?

doc_simon

It's actually quite easy to factor large numbers. You can use a quantum computer and Shor's (or a variant of) algorithm. Things are only hard when you use the wrong tool.

Anyway, I don't see what this has to do with the price of fish. :huh:

reddish

If you would be so kind:

25195908475657893494027183240048398571429282126204 \
03202777713783604366202070759555626401852588078440 \
69182906412495150821892985591491761845028084891200 \
72844992687392807287776735971418347270261896375014 \
97182469116507761337985909570009733045974880842840 \
17974291006424586918171951187461215151726546322822 \
16869987549182422433637259085141865462043576798423 \
38718477444792073993423658482382428119816381501067 \
48104516603773060562016196762561338441436038339044 \
14952634432190114657544454178424020924616515723350 \
77870774981712577246796292638635637328991215483143 \
81678998850404453640235273819513786365643912120103 \
97122822120720357

(Pmarra can play too - should keep him busy for a while! )

doc_simon

Would love to. But a dog ate my quantum computer.

TNorthover

As would I, but Schrodinger's cat might have eaten mine.

Pmarra

I don't agree with you

you have to look at this explanation
RSA
Security
The security of the RSA cryptosystem is based on two mathematical problems: the problem of factoring very large numbers, and the RSA problem. Full decryption of an RSA ciphertext is thought to be infeasible on the assumption that both of these problems are hard, i.e., no efficient algorithm exists for solving them. Providing security against partial decryption may require the addition of a secure padding scheme.

The RSA problem is defined as the task of taking eth roots modulo a composite n: recovering a value m such that me=c mod n, where (e, n) is an RSA public key and c is an RSA ciphertext. Currently the most promising approach to solving the RSA problem is to factor the modulus n. With the ability to recover prime factors, an attacker can compute the secret exponent d from a public key (e, n), then decrypt c using the standard procedure. To accomplish this, an attacker factors n into p and q, and computes (p-1)(q-1) which allows the determination of d from e. No polynomial-time method for factoring large integers on a classical computer has yet been found, but it has not been proven that none exists. See integer factorization for a discussion of this problem.

As of 2005, the largest number factored by general-purpose methods was 663 bits long, using state-of-the-art distributed methods. RSA keys are typically 1024–2048 bits long. Some experts believe that 1024-bit keys may become breakable in the near term (though this is disputed); few see any way that 4096-bit keys could be broken in the foreseeable future. Therefore, it is generally presumed that RSA is secure if n is sufficiently large. If n is 256 bits or shorter, it can be factored in a few hours on a personal computer, using software already freely available. If n is 512 bits or shorter, it can be factored by several hundred computers as of 1999. A theoretical hardware device named TWIRL and described by Shamir and Tromer in 2003 called into question the security of 1024 bit keys. It is currently recommended that n be at least 2048 bits long.

http://en.wikipedia.org/wiki/RSA

reddish

What went completely over your head, obviously, is the tongue-in-cheek character of muppetboy's remark. That happens when you start talking about things that you don't understand...

And could you refrain from making posts that are only Wikipedia excerpts? If we need definitions I'm sure we are able to find them for ourselves.

Thanks.