LinuxQuestions.org
Visit Jeremy's Blog.
Home Forums Tutorials Articles Register
Go Back   LinuxQuestions.org > Forums > Non-*NIX Forums > General
User Name
Password
General This forum is for non-technical general discussion which can include both Linux and non-Linux topics. Have fun!

Notices


Reply
  Search this Thread
Old 01-31-2015, 01:47 PM   #1
metaschima
Senior Member
 
Registered: Dec 2013
Distribution: Slackware
Posts: 1,982

Rep: Reputation: 492Reputation: 492Reputation: 492Reputation: 492Reputation: 492
Primes Math / Public Key Crypto question


Reading through:
http://cacr.uwaterloo.ca/hac/
Chapter 1.3

It says that public key crypto uses trap door one-way functions, such as integer factorization.

Another site about it:
http://learncryptography.com/prime-factorization/

The main idea is that you multiply two primes together conventionally named 'p' and 'q' to get 'n'. Knowing 'n', it is a mathematically difficult problem to factor out 'p' and 'q'. However, I wonder if there isn't a shortcut. I mean in the applied crypto book it says that 'p' and 'q' are very large distinct prime numbers of about 100 decimals each. Given this restriction on 'p' and 'q', couldn't you just try to guess 'p' and 'q' without having to factor them from 'n' ? I mean try all prime numbers of 100 decimals length.

I've tried searching for numbers on if this is indeed a possible shortcut, but I can't seem to find anything.
 
Old 01-31-2015, 02:38 PM   #2
metaschima
Senior Member
 
Registered: Dec 2013
Distribution: Slackware
Posts: 1,982

Original Poster
Rep: Reputation: 492Reputation: 492Reputation: 492Reputation: 492Reputation: 492
Ok, so I found a table later in Chapter 1 that says there are 5.2 x 10 ^ 72 (5.2E72) 75-digit prime numbers. It is clearly not feasible to guess at 'p' and 'q' as this would probably take more time than factoring.
 
Old 02-08-2015, 05:03 PM   #3
dugan
LQ Guru
 
Registered: Nov 2003
Location: Canada
Distribution: distro hopper
Posts: 11,220

Rep: Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319
Quote:
Originally Posted by metaschima View Post
However, I wonder if there isn't a shortcut.
My impression is that there is, but the implementation of that shortcut needs a quantum computer. Is that correct?
 
Old 02-08-2015, 06:55 PM   #4
metaschima
Senior Member
 
Registered: Dec 2013
Distribution: Slackware
Posts: 1,982

Original Poster
Rep: Reputation: 492Reputation: 492Reputation: 492Reputation: 492Reputation: 492
After more reading, the main shortcuts are very fast factoring methods like quadratic sieve, number field sieve, and elliptic curve factoring.

In the book it says that if someone were able to build a quantum computer (currently just a theory and non-quantum prototypes) it would very likely shake up the world of cryptography, minus the one time pad. Really, all algorithms other than the one time pad are computationally secure, not unconditionally secure. As such, any huge jump in computing power or algorithmic efficiency would shake up the world of cryptography.
 
Old 02-09-2015, 04:41 AM   #5
veerain
Senior Member
 
Registered: Mar 2005
Location: Earth bound to Helios
Distribution: Custom
Posts: 2,524

Rep: Reputation: 319Reputation: 319Reputation: 319Reputation: 319
Have you read webpages about post quantum cryptography by tanja lane and djb.

They say symmetric cipher of strength 128bit and more (like aes-128, aes-256) are secure even if someone uses a quantum computer.

But todays all popularly used public cryptography are not safe.

But NTRU is safe plus few others.
 
Old 02-09-2015, 10:33 AM   #6
metaschima
Senior Member
 
Registered: Dec 2013
Distribution: Slackware
Posts: 1,982

Original Poster
Rep: Reputation: 492Reputation: 492Reputation: 492Reputation: 492Reputation: 492
I don't think AES is safe at all even now, but maybe other symmetric ciphers 256-bit key and up. It's true that symmetric ciphers are significantly (10 times) stronger than public key ciphers for the same bit length, that's why public key ciphers recommend 2048-bit key.

Last edited by metaschima; 02-09-2015 at 10:35 AM.
 
Old 02-09-2015, 10:51 AM   #7
veerain
Senior Member
 
Registered: Mar 2005
Location: Earth bound to Helios
Distribution: Custom
Posts: 2,524

Rep: Reputation: 319Reputation: 319Reputation: 319Reputation: 319
No. All AES(Rjindael), truefish, serpent 128 bit and above are quantum secure.

But todays public ciphers are not except some ones I already wrote.
 
Old 02-09-2015, 11:09 AM   #8
ntubski
Senior Member
 
Registered: Nov 2005
Distribution: Debian, Arch
Posts: 3,780

Rep: Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081Reputation: 2081
Quote:
Originally Posted by metaschima View Post
It's true that symmetric ciphers are significantly (10 times) stronger than public key ciphers for the same bit length, that's why public key ciphers recommend 2048-bit key.
This is because there is a sub-exponential method of factoring numbers, see Index calculus algorithm. By the way, "10 times" might be okay as a rule of thumb, but the relationship is not linear:

Quote:
http://en.wikipedia.org/wiki/Key_size

As of 2003 RSA Security claims that 1024-bit RSA keys are equivalent in strength to 80-bit symmetric keys, 2048-bit RSA keys to 112-bit symmetric keys and 3072-bit RSA keys to 128-bit symmetric keys. RSA claims that 1024-bit keys are likely to become crackable some time between 2006 and 2010 and that 2048-bit keys are sufficient until 2030. An RSA key length of 3072 bits should be used if security is required beyond 2030. NIST key management guidelines further suggest that 15360-bit RSA keys are equivalent in strength to 256-bit symmetric keys.
The index calculus method doesn't apply to elliptic curves, which is why typical sizes for ECC keys are between 192 to 512 bits.

Quote:
Originally Posted by veerain
They say symmetric cipher of strength 128bit and more (like aes-128, aes-256) are secure even if someone uses a quantum computer.
Apparently, Grover's algorithm gives quadratic speedup so effectively the bit strength of the key is cut in half, i.e. aes-256 is okay (equivalent to aes-128 today) but aes-128 would be too small (64 bits is generally considered not enough).
 
Old 02-09-2015, 02:59 PM   #9
sundialsvcs
LQ Guru
 
Registered: Feb 2004
Location: SE Tennessee, USA
Distribution: Gentoo, LFS
Posts: 10,659
Blog Entries: 4

Rep: Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938
And it always bears remembering that practical breaks into crypto systems usually come about from some exploitable flaw in key management, often by people. Intruders and are frequently content to be able to capture only a portion of the traffic on a communication link, vs. cracking a single message. Crypto is simply designed to make it sufficiently difficult to read a message, or the traffic on a particular link, quickly enough to do Eve any practical good. Theoretical discussions about "weaknesses" of a crypto system are often just that ... theoretical, not pragmatic.

Keys can still be stolen and people can still be lured into accepting a key that they shouldn't. It's still true that the weakest link in any crypto infrastructure is in-between two ears.
 
Old 02-09-2015, 03:02 PM   #10
dugan
LQ Guru
 
Registered: Nov 2003
Location: Canada
Distribution: distro hopper
Posts: 11,220

Rep: Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319Reputation: 5319
Quote:
Originally Posted by sundialsvcs View Post
Keys can still be stolen and people can still be lured into accepting a key that they shouldn't.
And the private key held by the other party can be demanded via court order.
 
Old 02-10-2015, 07:24 PM   #11
sundialsvcs
LQ Guru
 
Registered: Feb 2004
Location: SE Tennessee, USA
Distribution: Gentoo, LFS
Posts: 10,659
Blog Entries: 4

Rep: Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938Reputation: 3938
Quote:
Originally Posted by dugan View Post
And the private key held by the other party can be demanded via court order.
... "and that's the way it goes, in civilized(?!?!) society."

Most of the time, cryptography serves as the all-important(!) digital equivalent of: "a postal envelope."

The information that is to be protected (let's face it ...) is not, actually, "a State Secret." It might simply be "nobody's business but yours.™" Nevertheless, you have a legitimate (and legal) business requirement that the information "is not being transmitted on a postcard," and that there is a credible technical support for the message's provenance and authenticity.

If a Court of Law presents you with a Search Warrant, then you, having done no wrong, will of course be quite happy to comply. Meanwhile, your archives and/or your transmissions require verifiable protection and "due diligence™" ... perhaps to comply with regulations such as (in the USA) Sarbanes-Oxeley, Securities laws, HIPAA, and so on. "Boring, but essential."

Cryptography is mostly boring . . . but essential.

Last edited by sundialsvcs; 02-10-2015 at 08:14 PM.
 
  


Reply



Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is Off
HTML code is Off



Similar Threads
Thread Thread Starter Forum Replies Last Post
SSL Public key/Private question masenko703 Linux - Newbie 6 06-03-2009 11:14 PM
LXer: Report: Public Key Crypto For the Enterprise LXer Syndicated Linux News 0 12-08-2008 06:02 PM
Interesting question about Private/Public Key dmor Linux - Security 9 08-27-2008 02:49 PM
Public key crypto with LUKS/dm-crypt? keschrich Linux - Security 0 10-31-2006 03:01 PM
general question: public key and fingerprint cevjr Linux - Newbie 1 09-19-2003 12:39 PM

LinuxQuestions.org > Forums > Non-*NIX Forums > General

All times are GMT -5. The time now is 10:32 AM.

Main Menu
Advertisement
My LQ
Write for LQ
LinuxQuestions.org is looking for people interested in writing Editorials, Articles, Reviews, and more. If you'd like to contribute content, let us know.
Main Menu
Syndicate
RSS1  Latest Threads
RSS1  LQ News
Twitter: @linuxquestions
Open Source Consulting | Domain Registration