Hacker Newsnew | past | comments | ask | show | jobs | submit | agazso's commentslogin

There is KDEConnect, which has apps for all major platforms (iOS, android, macOS, Windows and of course Linux) and some more. I even used between Apple devices when AirDrop did not work for some reason.

https://kdeconnect.kde.org/


KDEConnect does not implement what I've said


It doesn't?


Kde connect requires two devices already connected to the same local wireless network.


Does it create a seamless p2p wifi connection between any pair of devices it's installed on?


This is excellent, I was looking for an open source replacement for Google Maps on the web for a while.

And on the top of it, it is open source! I am heading to github and see if I can contribute.


Personally I am using [organicmaps](https://organicmaps.app/) which is using OpenStreetMap data, and it works really well.


I'm wondering if you've tried Magic Lane products and can compare?

https://www.magiclane.com


MagicEarth (which seems to be a MagicLane product; https://www.magicearth.com/) is my daily driver navigation app. I prefer it over Google maps for everything routing related. The only thing Google is better at is showing me relevant metainformation about places (when is this restaurant open? What is this doctor's telephone number and website?), and that's the only reason I'm keeping maps on my phone.


Can't say that I have no, but I would like to try it out given the chance!


Organic Maps has no Web app. Well, they have a very bare Web app, unusable.

I wish (for the general public) there was both a Web app, and mobiles apps under the same names and maturity.


You can also use https://www.qwant.com/maps as OSM base web app


I wish, but like I said below, it's not developped anymore. The company got bought by the french cloud company OVH. There are multiple complaints of stale OSM data in the github issues.

Let's hope they want to make a public and open source map part of their europaen google alternative.


For a web app I'm fine with using https://www.openstreetmap.org/.


oh nice, and it's on f-droid too. is it more responsive than the fairly sluggish osmand~?


OrganicMaps is incredibly snappy compared to OsmAnd~.


thanks!


maps.me is the most popular app of that kind.


Never heard about it! Thank you very much!

[edit]Apparently organic maps is maps.me without the tracking[/edit]


I downloaded this and it looks cool and comprehensive, but for me the card artwork is missing.

Maybe some server is hugged by HN? Or something needs to be set?


It’s a bit unintuitive, but IIRC you need to go into the settings and tell it to download the card art. Two reasons for this: 1, copyright and 2, it’s a big download if you get them at full quality.


Thanks, I found it in the 'Content Downloaders' menu!

It estimates the download time to 6 hours, and it's not because of the size but most likely their server works slowly. And in the meanwhile it does not let you play, well tomorrow then :)


There's a setting somewhere to auto download cards when they're seen. That should get you up and running quicker!


Mexico city too has rubber wheels on some lines


Yes, most lines actually (10 out of 12) [1].

[1]: https://en.wikipedia.org/wiki/Rubber-tyred_metro


I wonder how difficult would it be to brute force the private key for an RSA 760 bit public key from 1998. Does anyone know?


https://en.wikipedia.org/wiki/Integer_factorization_records and https://en.wikipedia.org/wiki/RSA_numbers gives some pointers. Specifically, the latter describes a 768 bit key being factored "on December 12, 2009, over the span of two years", with CPU time that "amounted approximately to the equivalent of almost 2000 years of computing on a single-core 2.2 GHz AMD Opteron-based computer".

Later, in 2019, a 795 bit key was factored with CPU time that "amounted to approximately 900 core-years on a 2.1 GHz Intel Xeon Gold 6130 CPU. Compared to the factorization of RSA-768, the authors estimate that better algorithms sped their calculations by a factor of 3–4 and faster computers sped their calculation by a factor of 1.25–1.67."

So assuming the better algorithms transfer to smaller numbers, someone who knows how to use them (factoring big numbers seems significantly harder than just running CADO-NFS and pointing it at a number and a cluster) could probably do it in a couple months on a couple dozen modern machines.

For example, using the "795-bit computations should be 2.25 times harder than 768-bit computations" from the publication accompanying the second factorization, we could assume 900/2.25 = 400 Core-years of the Xeon reference CPU (which is 6 years old by now) would be needed to break the smaller key with the modern software. Two dozen servers with 64 equivalently strong cores each would need slightly over 3 months. Not something a hobbyist would want to afford just for fun, but something that even a company with a moderate financial interest in doing could easily do, provided they had people capable of understanding and replicating this work.


Classic CPU hasn't held a candle compared to GPU on very repetitive math calculations. AI this year has really shown the same difference. In other words, it isn't just graphics... https://www.spiceworks.com/it-security/identity-access-manag...


I assume there is some reason why the past factorizations weren't done with GPUs. It could be just lack of a good implementation and insufficient numbers of people interested in the topic, but it could also be something about the algorithm not being very suitable for GPUs.


CUDA only had its initial release in 2007 (compared to the mentioned crack in 2009), and I remember it being a fairly limited product at that point. GPUS were also much slower back then.


Someone has tried to factorize it before (2018) http://factordb.com/index.php?query=444376527415060195687748...


Always depends on what resources you have (compute, time). It's possible, but not easy.

https://crypto.stackexchange.com/a/1982


Oddly specific question, something in particular on your mind?


Presumably they are referring to the 760 bit RSA key this entire post is about.


But the header talks about a 64 bit key? I'm a bit lost actually.

Edit: Okay, I see it now. 64 bits of cipher of which 24 bits of that cipher are set to a value derived from a 760 bit pubkey.


If anyone is interested the whole series can be watched on Youtube for free. Altogether it is not that great, nevertheless I find the meta story about the pilot fascinating (a show about conspiracy theories "predicts" the 9/11 attack).

https://www.youtube.com/watch?v=TvxyiWmJpok


You can watch it as two shows (like a lot of shows from the 26 episode season era), one being the story arc episodes and two being the monster-of-the week style episodes.

https://en.wikipedia.org/wiki/Mythology_of_The_X-Files


There is a project called Swarm that does exactly this.

https://www.ethswarm.org

(Disclosure: I am working on the project)


I found this to be a much better article than the original post. It also explains how the elliptic curve Diffie-Hellman works.

Thanks!



After I stopped using FB I missed a mobile news reader app that works without having to install a server or create an account.

So with some friends we created an app called Feeds https://github.com/felfele/feeds

It does everything on the phone and there is no ads or tracking whatsoever. You can also mute content with keywords.

It is open-source and currently in open beta for iOS and Android.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: