Bitcoin Forum
December 06, 2016, 02:15:16 PM *
News: Latest stable version of Bitcoin Core: 0.13.1  [Torrent].
 
   Home   Help Search Donate Login Register  
Pages: [1]
  Print  
Author Topic: .  (Read 514 times)
nimda
Hero Member
*****
Offline Offline

Activity: 784


0xFB0D8D1534241423


View Profile
.
June 02, 2012, 07:40:51 PM
 #1

.

I recommend asking me for a signature from my GPG key before doing a trade. I will NEVER deny such a request.
1481033716
Hero Member
*
Offline Offline

Posts: 1481033716

View Profile Personal Message (Offline)

Ignore
1481033716
Reply with quote  #2

1481033716
Report to moderator
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1481033716
Hero Member
*
Offline Offline

Posts: 1481033716

View Profile Personal Message (Offline)

Ignore
1481033716
Reply with quote  #2

1481033716
Report to moderator
Meni Rosenfeld
Donator
Legendary
*
Offline Offline

Activity: 1890



View Profile WWW
June 02, 2012, 08:23:25 PM
 #2

The most well-known PKC algorithm is RSA; the basic idea is moderately simple and you can read about it in the linked Wikipedia article, but you need to understand a bit of number theory, starting with modular arithmetic (if you don't, that should be your first step). There's also a numeric example.

If the secret prime numbers are p and q and their public product is n=pq, then to encrypt a message you take its representation as an integer and raise it to some power, modulo n. Anyone can do that, but most can't take a power and figure out what the base was. The recipient who knows p and q can find the totient phi(n) = (p-1)(q-1) and with some number theory magic use it to invert the power operation.

Cryptology is a word not used very often and usually only by crypto pros.
And for those who use it, it's not synonymous with cryptography; rather, they use cryptography to refer to developing and using cryptographic techniques, cryptanalysis to breaking them, and cryptology to both.

(is cryptology a word?)
Edit: a little offtopic... does PKC prove, or at least rely on, P!=NP?
If P=NP then there's a polynomial-time algorithm to break PKC. Whether this has practical relevance is not clear; if the best polynomial has order 20, then it's still impossible.

1EofoZNBhWQ3kxfKnvWkhtMns4AivZArhr   |   Who am I?   |   bitcoin-otc WoT
Bitcoil - Exchange bitcoins for ILS (thread)   |   Israel Bitcoin community homepage (thread)
Analysis of Bitcoin Pooled Mining Reward Systems (thread, summary)  |   PureMining - Infinite-term, deterministic mining bond
Pages: [1]
  Print  
 
Jump to:  

Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!