this post was submitted on 06 Dec 2023
16 points (70.0% liked)

Monero

1677 readers
32 users here now

This is the lemmy community of Monero (XMR), a secure, private, untraceable currency that is open-source and freely available to all.

GitHub

StackExchange

Twitter

Wallets

Desktop (CLI, GUI)

Desktop (Feather)

Mac & Linux (Cake Wallet)

Web (MyMonero)

Android (Monerujo)

Android (MyMonero)

Android (Cake Wallet) / (Monero.com)

Android (Stack Wallet)

iOS (MyMonero)

iOS (Cake Wallet) / (Monero.com)

iOS (Stack Wallet)

iOS (Edge Wallet)

Instance tags for discoverability:

Monero, XMR, crypto, cryptocurrency

founded 1 year ago
MODERATORS
 

Just started to research more into Monero recently. I was one of the people who used to think Monero was a "bad guy" thanks to the way tech journalists and mainstream media report and portrays it. After making a point to read about it and took the time to research, test and experience it. Monero seems to be the only crypto and chain that fully aligns with the ethos of Satoshi Nakamoto!

you are viewing a single comment's thread
view the rest of the comments
[–] chevy9294@monero.town 4 points 11 months ago* (last edited 11 months ago) (1 children)

Also, if you happen to be a math geek or a cypherpunk, this thing is based on Elliptic (Ed25519)—something deep and fascinating for number theorists to study!

I'm guessing you know more than average person about this, right?

I'm very intersted in cryptography, math, and programming. I'm making some basic programs in rust with encryption (I haven't done any zero-knowlage, signing, ant similar stuff, but I want). Do you maybe know how can I learn more about this? I'm 16, still in (Europe) high school, after that I will (hopefully) go to faculty for CS and math. I will learn a lot, but I want to start now. Do you maybe know any projects I can do? Now I am trying to implement basic post-quantum encryption with lattecis (it's not going well).

[–] Saki@monero.town 4 points 11 months ago* (last edited 11 months ago)

A fun project would be: factor Mersenne numbers! Naive trial division -> optimize your code by only trying valid candidates (you’ll learn about quadratic residues, Jacobi symbol etc.) -> You’ll soon realize that trial division only goes so far, motivated to learn new approaches. The P−1 method may impress you, it’s powerful. Enjoy coding that. -> But then, you’ll be frustrated by even stronger opponents here and there beyond M100, which the P−1 method can’t factor. Now you’ll be so ready, even determined, to learn ECM. At this point, you’ll find using elliptic curves is actually not so difficult, because it’s just like P−1. And yay, 20- or 30- digit numbers are no longer your enemies, they’re just small fish, elliptic curves rule!

Before you know it, you’ll have a clear, intuitive vision about “an elliptic curve over a finite field”. Try to understand why ECM works. Try to count the number of points. Everything you experience with ECM is related to ECC too.

I’m not that good; know enough to know that I don’t really know much. Just a hobbyist; posted ℍappy ℍamilton Day! here.