Bitcoin Forum
April 16, 2014, 11:08:29 PM *
News: ♦♦ A bug in OpenSSL, used by Bitcoin-Qt/Bitcoin Core, could allow your bitcoins to be stolen. Immediately updating Bitcoin Core to 0.9.1 is required in some cases, especially if you're using 0.9.0. Download. More info.
The same bug also affected the forum. Changing your forum password is recommended.
 
   Home   Help Search Donate Login Register  
Pages: [1]
  Print  
Author Topic: Bitcoin, "Satoshi", NSA.  (Read 1339 times)
svbeon
Newbie
*
Offline Offline

Activity: 21


View Profile

Ignore
June 21, 2013, 12:30:12 PM
 #1

“Doubts are the ants in the pants of faith. They keep it awake and moving.”
― Frederick Buechner

The Tor project was created by DARPA (Defense Advanced Research Projects Agency) and currently receives 80% of their funding from the US Government.

- - - -

ROOTS IN THE NSA

NSA paper, 1996: “How To Make A Mint: The Cryptography of Anonymous Electronic Cash”.

Quote
CONTENTS

INTRODUCTION

1. WHAT IS ELECTRONIC CASH?

1.1 Electronic Payment

1.2 Security of Electronic Payments

1.3 Electronic Cash

1.4 Multiple Spending

2. A CRYPTOGRAPHIC DESCRIPTION

2.1 Public-Key Cryptographic Tools

2.2 A Simplified Electronic Cash Protocol

2.3 Untraceable Electronic Payments

2.4 A Basic Electronic Cash Protocol

3. PROPOSED OFF-LINE IMPLEMENTATIONS

3.1 Including Identifying Information

3.2 Authentication and Signature Techniques

3.3 Summary of Proposed Implementations

4. OPTIONAL FEATURES OF OFF-LINE CASH

4. 1 Transferability

4.2 Divisibility

5. SECURITY ISSUES

5.1 Multiple Spending Prevention

5.2 Wallet Observers

5.3 Security Failures

5.4 Restoring Traceability

CONCLUSION

REFERENCES

- - - -

An Efficient Divisible Electronic Cash Scheme

Quote
A “divisible” coin worth some amount of money, say $x, is a coin that can
be spent many times as long aa the sum total of all its the transactions does
not exceed $x. This property, divisibility, is very useful and convenient for a

Quote
Bit Commitment Schemes

Quote
Finally U proves to B that a value is correctly generated without revealing
committed information
, by using some protocols to be described later.
To set up the commitment scheme, B generates prime P satisfying P - 1 =
2-Prime (Prime is a prime number), G and g whose orders in the multiplicative
group 25 are Prime. B sends P, G and g. U checks whether Prime = (P- 1)/2
is a prime by a probabilistic primality (or composite) test, and whether the orders
of G and g are Prime by checking that they are not 1 and GPrime E 1 (mod P)
U can commit to any integer s E Zprime by choosing R uniformly at random
and gPrime = - 1. (mod P).
in ZPrime and computing the commitment

What the fuck does this sound like? A computationally complex calculation, that anyone can easily verify, yet as it is a hash of the block other people cannot use your proof of work.

Quote
Detection of Overspending
Although, formally, the security including the detection of overspending is de-
scribed in Section 6, in this subsection, we will describe the detection procedure
of overspending.

You will shit your pants if you look at who wrote this paper:

An Efficient Divisible Electronic Cash Scheme
Tatsuaki Okamoto
1397689709
Hero Member
*
Offline Offline

Posts: 1397689709

View Profile Personal Message (Offline)

Ignore
1397689709
Reply with quote  #2

1397689709
Report to moderator
1397689709
Hero Member
*
Offline Offline

Posts: 1397689709

View Profile Personal Message (Offline)

Ignore
1397689709
Reply with quote  #2

1397689709
Report to moderator
1397689709
Hero Member
*
Offline Offline

Posts: 1397689709

View Profile Personal Message (Offline)

Ignore
1397689709
Reply with quote  #2

1397689709
Report to moderator
Pre-order Cloud Mining Power. Cheapest price.
2 Ph/s in stock.
INVEST NOW  >

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

Posts: 1397689709

View Profile Personal Message (Offline)

Ignore
1397689709
Reply with quote  #2

1397689709
Report to moderator
1397689709
Hero Member
*
Offline Offline

Posts: 1397689709

View Profile Personal Message (Offline)

Ignore
1397689709
Reply with quote  #2

1397689709
Report to moderator
stash
Member
**
Offline Offline

Activity: 116

btcmy.net


View Profile WWW

Ignore
June 21, 2013, 01:59:38 PM
 #2

Hmm this make my thought about bitcoin develop by NSA more concrete.

Quote
In cryptography, SHA-1 is a cryptographic hash function designed by the United States National Security Agency and published by the United States NIST as a U.S. Federal Information Processing Standard. SHA stands for "secure hash algorithm". The four SHA algorithms are structured differently and are distinguished as SHA-0, SHA-1, SHA-2, and SHA-3. SHA-1 is very similar to SHA-0, but corrects an error in the original SHA hash specification that led to significant weaknesses. The SHA-0 algorithm was not adopted by many applications. SHA-2 on the other hand significantly differs from the SHA-1 hash function.

Tehtarik Fund : 1KxyB3iauJzLvDnZuchekGkB2D7p4UMvuq
BTCitcoin : Mathematical Logic to Eliminate Human Greed
RoadToHell
Sr. Member
****
Offline Offline

Activity: 258



View Profile

Ignore
June 21, 2013, 02:13:43 PM
 #3

There is another thread on this topic:  Tatsuaki Okamoto = Satoshi Nakamoto?

Sam Spade: We were talking about a lot more money than this.
Kasper Gutman: Yes, sir, we were, but this is genuine coin of the realm. With a dollar of this, you can buy ten dollars of talk.
pinger
Sr. Member
****
Offline Offline

Activity: 462



View Profile WWW

Ignore
June 21, 2013, 02:16:47 PM
 #4


threeip
Full Member
***
Offline Offline

Activity: 154



View Profile WWW

Ignore
June 21, 2013, 05:27:19 PM
 #5

Newsflash; NSA is good at cryptography

ส็็็็็็็็็็็็็็็็็็็็็็็็็ GPG:2AFD99BB ಠ_ಠ mon
RoadToHell
Sr. Member
****
Offline Offline

Activity: 258



View Profile

Ignore
June 21, 2013, 07:30:45 PM
 #6



Do you think it is just a coincidence that Satoshi and D.B. Cooper have never been seen together?  The plot thickens.

Sam Spade: We were talking about a lot more money than this.
Kasper Gutman: Yes, sir, we were, but this is genuine coin of the realm. With a dollar of this, you can buy ten dollars of talk.
gollum
Sr. Member
****
Offline Offline

Activity: 392


In Hashrate We Trust!


View Profile

Ignore
March 07, 2014, 01:15:25 AM
 #7

*bump*

BitCoin: 1BML3Z8H1LKx1xRk4JAjNbCjyyBLsisReV
BitMessage: BM-opjRqPuZLyqPxy2GbaX322827Ug7PzNQh
Mtinie
Newbie
*
Offline Offline

Activity: 7


View Profile

Ignore
March 07, 2014, 01:57:58 AM
 #8

NSA paper, 1996: “How To Make A Mint: The Cryptography of Anonymous Electronic Cash”.

Do you have a link to a place where this paper can be read that's hosted by a credible and verifiable source?

Edit: Found it following that link above. Here it is: http://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm
Bobsurplus
Full Member
***
Offline Offline

Activity: 154

www.einsteinium.org


View Profile

Ignore
March 07, 2014, 01:59:23 AM
 #9



Do you think it is just a coincidence that Satoshi and D.B. Cooper have never been seen together?  The plot thickens.

I cant see Satoshi jumping out of a plane, but anything is possible.

Visit my forum/street cred thread here:
https://bitcointalk.org/index.php?topic=489001.0;topicseen
Einsteinium-Funding The Future With The Future Of Currency-EMC2
ReCat
Sr. Member
****
Offline Offline

Activity: 378



View Profile WWW

Ignore
March 07, 2014, 02:00:03 AM
 #10

NSA paper, 1996: “How To Make A Mint: The Cryptography of Anonymous Electronic Cash”.

Do you have a link to a place where this paper can be read that's hosted by a credible and verifiable source?

http://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm

MIT.EDU?

BTC: 1recatirpHBjR9sxgabB3RDtM6TgntYUW
Hold onto what you love with all your might, Because you can never know when - Oh. What you love is now gone.
gollum
Sr. Member
****
Offline Offline

Activity: 392


In Hashrate We Trust!


View Profile

Ignore
March 07, 2014, 02:00:33 AM
 #11

NSA paper, 1996: “How To Make A Mint: The Cryptography of Anonymous Electronic Cash”.

Do you have a link to a place where this paper can be read that's hosted by a credible and verifiable source?

Quote
Anonymous: Fried, Frank got NSA's permission to make this report available. They have offered to make copies available by contacting them at <21stCen@ffhsj.com> or (202) 639-7200. See: http://www.ffhsj.com/bancmail/21starch/961017.htm
Source: http://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm
As you can see it is hosted at MIT, I believe it is a credible source.

MIT Computer Science and AI Laboratory
http://www.csail.mit.edu/
->
Project MAC ("Switzerland"), MIT Project on Mathematics and Computation
http://groups.csail.mit.edu/mac/projects/mac/
->
Class: MIT 6.805/STS085: Ethics and Law on the Electronic Frontier, Special topic for Fall 13: Foundations of Internet Public Policy
http://groups.csail.mit.edu/mac/classes/6.805/
->
NSA Mint
http://groups.csail.mit.edu/mac/classes/6.805/articles/money/nsamint/nsamint.htm

BitCoin: 1BML3Z8H1LKx1xRk4JAjNbCjyyBLsisReV
BitMessage: BM-opjRqPuZLyqPxy2GbaX322827Ug7PzNQh
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!