Topic: How do I calculate the Exponent for public/private keys (Read 295 times)

You can pat each other on the bums all you like but you won't be turning truth into treason and winning any debate unless you face up to
facts and may I suggest that you have been trolling this thread all day and these people you call trolls I suspect are just better educated
than you.

Did the boss send you in ?

What you really mean is the wheels are falling off the bus and you cannot bear to be reminded about it
mr no bankers around here when it comes to lightning

You keep making assumptions about what I am working on but i am not trying to talk to the Bitcoin
network and have some work to do with coordinators and
four way transactions that all need to be secure and I know this is strange but its windows based so I tend
to use the tools to hand and the 512 bit key your banging on about is not significant to me at this point in time.

it said "The code I use for now in C# to create keys/Exponent is shown below" so put your glass on please.

Secp256k1 from what I can see does not allow encryption with the private key so it can be read with the public key
because the signature signing needs to encode something from the public key to work but it does offer some advantages
over RSA but i want you to know that I could not have managed to get this far without expert help from yourself    

You think?  If so, it’s still a troll—and that would not be the first time I may have been trolled here, though the other one was much less plausible.  Thus, the possibility had occurred to me; but yet every time I have ever imagined that there must be an upper bound on human stupidity, a greater idiot has proved me wrong.

In any case, I am a long term-thinker; and I do anticipate that this thread may be a handy reference.  Much of Anti-Cen’s spew about Bitcoin and Lightning is delivered in such a manner as may be effective FUD to scare and confuse newbies.  That was my first thought when I saw this thread.  There are enough bottom-feeders serving as paid shills to post such things; we don’t need more from someone who does it for jollies due to lack of any higher aim or greater pleasure in life.

Well, anyway, I appreciate the tip.  Perhaps I ought return to my usual occupation of manufacturing MD5 ASICs for Bitcoin mining, or doing carpentry with a screwdriver to put in nails.

In fairness, I think the Anti-Cen account *is* satire. The posts are often quite funny pastiches of genuine attempts to troll Bitcointalk.org.

That's actual state of the art trolling if so; trolling the trolls with, uh, imitative trolling. I've been tempted to award some merit points


I sincerely hope Anti-Cen starts hanging out with the other trolls, oh and meriting their posts!! Anti-Cen might be a kind genius of a sort after all!

Quotable.

For the benefit of any newbies reading this—and I mean, people who do not brag about development knowledge or experience, and have never even read the Wikipedia article on RSA—the answer is:  No, RSA is not based on a curve.  RSA is not elliptic-curve cryptography.  RSA is based on the RSA problem, which is closely related to (but not identical with) the problem of factoring large integers.  Elliptic curve cryptography such as Bitcoin’s secp256k1 is based on the elliptic curve discrete logarithm problem (ECDLP).  Bitcoin does not use RSA anywhere for any purpose whatsoever.


After decades of disdain on my part, I finally understand why people use the term “LOL”.  Did you just try to use a PGP public key fingerprint as an RSA key?  Why yes, it seems you did (or at least, you claimed to).

That is a 160-bit SHA-1 hash, calculated as specified by RFC 4880 § 12.2.  Depending on how those bits hashed out, you perhaps may only have slightly more luck finding in it a minuscule RSA modulus plus public exponent than you would using RSA-512 to generate Bitcoin keys.

I asked if it was based on a curve and you seem to have a bit of a metal condition and accusing me of all kind things because like I
so often do I edited a post moments after it was posted.

Please archive this post too and I am happy your hanging around watching this thread because it stops you
disturbing other members and making a total fool of yourself in the process.

I found this on your site "RSA: 0xA232750664CC39D61CE5D61536EBB4AB699A10EE"

Please help me to encode a message to send to the address because so far I've got

yutyurtyurtyurtyutryurtyurtyurtyu4tytryrtyurtrtu
rtyurtyurturtyu-GROW-UP-LITTLE-BOY ttyurtyurt
rtyurtyurtyurtyurtyutryurtyurtyurtyurtyurtyurtyu

And it does not seem to post

 

I tried the Secp256k1.Core project written in C# but the signature won't verify but it does do
compressing and checksum and to be honest it looks good code, not too long but what can I do.

Microsofts RSA is not something I like so I am using BigInts for encryption like this.


So for now I am just using microsofts .NET framework DSA to get me going and took it that the  
Exponent could be calculated from the public/private keys that I get from one like of code just now.

out of the box RSACryptoServiceProvider won't even encode using the private key so really I have
just be forced to jump in and get my hands dirty and that's when I hit this problem and if you think
needing three parts is bad then take a look at Microsoft's bloated ways


in fact the Exponent must only be related to the public key or else you would be forced to issue a copy of the private key so
clients could read a signature but like I said it always stays the same so that seem wrong too  

(Nothing worth replying to.)


Oh, please.  Just because you’re stupid, don’t assume that I am—or that I was born yesterday.

(And I must ask, why do you post literally an average of 20 times per day on the Bitcoin Forum if you so loathe it?  Why yes, this forum is for Bitcoin development.)

But just in case any observer has any doubt about your transparent, juvenile excuse:  About 50 minutes after you started this thread, you posted substantially the same question in a different thread explicitly titled “Elliptic curve point of R” amidst discussion of secp256k1 (archive; red colour is added to highlight in the following):


Thus in the world according to Anti-Cen, RSA is explicitly “based on” a “curve”.

I should also note, anybody who uses 512-bit RSA for any purpose whatsoever is a moron.  512-bit RSA is breakable, not only in theory but as repeatedly demonstrated in reality.

Now, a clarification for those reading this:


Here, you are replying to your own words which you directed at me on 2018-01-02 11:36:57.  Don’t put words in my mouth.

I quoted you with proper attribution in the post to which you replied.  But you habitually strip attribution from quotes; and it is evident that you here confused yourself.

Regardless—really, regardless—I will handily admit that the question of how to use 512-bit RSA objects for Bitcoin secp25k1 ECDSA keys does indeed go over my head.  Whoosh.

---

You edited your post immediately after you posted it.  Following is the original version; I replied to the latest version I have seen.  Please be advised that I am archiving this thread.  (Edit:  Thus far, snapshots at web.archive.org: 0, 1, 2, 3 and archive.is: 0, 1, 2, 3.)

Now shoo, go away.

Not my fault if your in love with an outdated steam engine is it now



Hope you liked stalking me, I am cool with it because I eat little boys like you for breakfast who's only concern
is their "Investment" playing the slot machines  


What on earth made you think that I wanted the code to work with Bitcoin given that I often point
out that the design is wrong, hence it won't scale ?  Development here is not just about Bitcoin you know
so stop making yourself look silly with your ramblings


Just admit the question I asked went over your head and I know this might be hard for you
to understand but you know when I make a post because it usual will have my name at the top of it.

Folks, I know that you desire to be helpful in “Development & Technical Discussion”; but please look at who is posting here.

After literally over 900 posts mostly bashing Bitcoin whilst boasting of his superior technical knowledge and extensive development experience, Anti-Cen has—tried to use RSA for Bitcoin.  512-bit RSA, at that (!).

---

Edit:  And he has done so in multiple threads, including one explicitly titled “Elliptic curve point of R”:

End edit.

---

He has now gone from flaunting arrogant ignorance to self-satirizing it.  As if it were not enough to posit that CPUs were useful for Bitcoin mining, which has not been the case for over half a decade:

Bitcoin don't use RSA but ECDSA.
Your private key D is a 256bits unsigned integer.
Then, you can calculate your public key by multiplying D with a generator point G on an elliptic curve.
On bitcoin, the standard is https://en.bitcoin.it/wiki/Secp256k1.
There is no exponent, or i don't understand what you call exponent (since it's not RSA).

I am using Microsoft Windows RSACryptoServiceProvider just to generate the keys for now but it also calculates the Exponent
at the same time and I want to cut RSACryptoServiceProvider out of the loop so I am doing encryption/decryption with BigInt
which I have got working just fine.

strange thing is the keys keep changing with RSACryptoServiceProvider but the Exponent always stays as "AQAB" on a 512 bit key
and unless you set PersistKeyInCsp = false; then the key pairs get saved by spy-master general  so basically just don't trust Microsoft one bit here

The code I use for now in C# to create keys/Exponent is shown below


Later I want to generate my own key pairs and compress the size of the public key down without using a million lines of code