Today I learned about elliptic curve cryptography. And there is something I do not get. Probably I'm getting the basics wrong. But from what I understood, we are starting at one point G on the elliptic curve and then you multiply it with a. Finally you land on another point on the elliptic curve. And it is very hard to guess the factor a that brought you there. You can only figure this out by attempting (a=1, a=2, a=3, ...). But what I don't understand is that the whole encryption process is done the same way, meaning the encryption performance increases linearly with the size of a. So how is cracking the hash taking any longer than the encryption itself? 🤨
And I get that there are other constraints to this crypto system as the use of modulo. But I do not see how even this would change a lot on the issue I stated.
Now, I'm obviously dumb. I obviously do not understand something. I would just like someone to explain me what I get wrong :) Thank you very much in advance.
Hello, I am wondering how advanced the mathematics is for the practical application of elliptic curve cryptography. Can someone with a math undergraduate degree understand it and what type of prerequisite math is required?
So im planning to do an IA on the ECC as im interested in cryptocurrency. Are there any sample IAs or good research papers i can refer to, as idk how to go about it that well. If anyone ahs done this topic any advice or reference material. Im in a bit of a hurry so any help is appreciated.
Hello fellow crypto enthusiasts, I was wondering if there is any chance to get a luks encrypted filesystem by using ECDSA or something similar. I can not find this option in my cryptsetup benchmark and failed to find any further information on this. Is it even technically possible or sensible?
Hey guys, here's the second part of the elliptic curve cryptography article, which is part of the larger Programming Bitcoin in Clojure I am doing right now.
Let me know what you think! Constructive feedback is always welcome.
I’m a newbie in cryptography, and doing some basic research on hash functions, RSA and elliptic curve cryptography, etc.
I’m wondering if DNA computing can feasibly break elliptic curve cryptography with the current technology available? I found this paper (https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2292844/) in which the authors described a theoretical method based on DNA computing to solve elliptic curve logarithm problem. Their method is quoted as follows:
“consider point P and Q are given, and l is what we want to get which matches Q = lP. First, we amplify P into two tubes and add P in one tube. Check if 2P equals to Q; if not, note down the value of 2P and pour two tubes together. Then, amplify the tube into two tubes and add 2P in one tube. Check if any point equals to Q; if not, note down the value of 4P and pour two tubes together, or we get the value of l. Then, amplify the tube into two tubes and add 4P in one tube,…, while this loop executes n times, the value from 1 to 2n for l will have been checked, and the elliptic curve cryptosystem has been broken by the solved elliptic curve discrete logarithm problem.”
Is this even remotely feasible with current technology? I know that the primary drawback of DNA computing is that it takes too much space - factoring a 10^3-bit number, for example, would require 10^20000 test tubes (https://www.semanticscholar.org/paper/Factoring%3A-The-DNA-Solution-Beaver/5e292a3100699187b1943b1dd65848fb46e855a5) using the Hamiltonian path idea proposed by Leonard Adelman.
Here is the link to my final year project, Image Encryption Using Elliptic Curve Cryptography. It uses the ECIES(AES256 + ECDH key sharing) Since cryptography is a vast field, I would appreciate opinions and research ideas for the same.
ECC can be used to create digital signature, whereas the ECDSA use ECC to create digital signature. So how they are different in term of signing especially the performance? To be honest, i am doing a homework to compare ECC, ECDSA and some other algorithms.
As I understand it, we use P2PKH instead of P2PK, so that if elliptic curve cryptography were broken there would still only be hashes of public keys present on the blockchain, which are way harder to break. If you spend an output however you have to provide the corresponding public key, as specified in the P2PKH locking script.
If elliptic curve cryptography were broken and someone were to send such a transaction, couldn't you just take that, find out the corresponding private key and then send a competing transaction with a higher fee to steal the money?
Today's topic is Eliptic curve cryptography.
This recurring thread will be a place to ask questions and discuss famous/well-known/surprising results, clever and elegant proofs, or interesting open problems related to the topic of the week.
Experts in the topic are especially encouraged to contribute and participate in these threads.
Next week's topic will be Computational complexity.
These threads will be posted every Wednesday around 12pm UTC-5.
If you have any suggestions for a topic or you want to collaborate in some way in the upcoming threads, please send me a PM.
For previous week's "Everything about X" threads, check out the wiki link here
To kick things off, here is a very brief summary provided by wikipedia and myself with the help of my friend /u/t00random:
Suggested in the 1980's , elliptic curve cryptography is now a very succesful cryptographic approach which uses very deep results about algebraic geometry and algebraic number theory into its theory and implementation.
Exploiting the fact that elliptic curves have a group structure, it is possible to implement discrete-logarithm based algorithms in this context.
This can be used simply on the python prompt.
The first part of the third section on my exploration of Programming Bitcoin by Jimmy Song but in Clojure.
Lemme know what you think!