Playing their game. An idea, some speculations and discussion.

[Resistor]

So anyone who is interested in security and anonymity must have been increasing shocked by the 'recent' events.
I shouldnt have to explain that any further.
So we can basically state that many encryptions on which almost anyone relies are flawed (Ive had some discussion about using this word but I think it fits the definition, if its not point to point secure its flawed)
Its hardly a suprise that anonymity is dead, only the scale on which this is happening cant cease to blow my mind.
One of the most intriguing parts imo is the automated packet capture and filtering in which millions or more is invested that along with the capability of decrypting  it, for x part.


Talking about flaws, there is one theoretical flaw in their system aswel.
There is just too much data to be analyzed, at least by humans.
As a subsitution they would use massive ammounts om computational power and if course software to do the job.
Nothing new so far..
Ive been playing with the idea for a while to do exactly the thing that would confuse this system to such an extend that computational extraction of data could be considered useless.
Everyone here must have heard of those firefox plugins that send random search queries to the big boys to randomize their profiling.
What if something similar would be launched on a massive scale only than with the type of data that would be filtered out by the big parties controlling the game.
Thousand or millions voluntarily sending garbage 'malicious' data , everyone would be a 'terrorist'.



Any thoughts ?

Increasing noise would lower the NSA's already piss poor effectiveness I'd think. There's a new firefox addon that aims to do that.

Flagger is a browser add-on that automatically puts red flag keywords (like bomb, Taliban and anthrax) into the web addresses you visit. Install Flagger and help us send a message: government surveillance has gone too far.

http://flagger.io/


I'm not going to be the first to try it though ...

[Zesh]

InfoSec Anthrax
Broadside Blizzard Crest Trojan
r00t Fort Meade Plot Burn

+1 for the link

[vezzy]

Damn, I knew about Flagger for a few days, but forgot to link it.

[lucid]

Code: [Select]

Suicide attack
defensive Storm Gang Talent
SLIP assassinate
So beautiful...

[rubbingalcoholic]

Hi! I'm the developer of Flagger. I saw your forum in my web analytics and wanted to stop in and say hello. I've been dabbling in security research for the last year, and it seems like I could learn a lot here

Also thought I'd put this out here. If you don't want your HTTP referrer information to show up in outlinks, you can use Javascript to add a rel="noreferrer" attribute to every link. Seems like some of your discussion topics might best not draw 3rd party attention!

Cheers!

[proxx]

Massive web of irc servers/channels spamming hot keywords.
Ran by volunteers.

[I_Learning_I]

Since it was revived, I have to ask, what do you mean by cracked encryption's?
As far as I know all asymmetric encryption are uncrackable, bruteforceable? Yes, but not crackable.
Also the bigger the encryption the less likely it is that bruteforce will do it, as we kall know, exponentially.
I truly believe this is the "TOR cracked" incident  all over again.

Also what recent incidents? (By now they should be old but w/e) the PRISM?

[vezzy]

As far as I know all asymmetric encryption are uncrackable, bruteforceable? Yes, but not crackable.
Also the bigger the encryption the less likely it is that bruteforce will do it, as we kall know, exponentially.

They are crackable as long as they are based on either the integer factorization or the discrete logarithm problem, in which case they can be cracked by Shor's algorithm in complexity class BQP.

Your second paragraph concerns symmetric encryption, which is true. However, Grover's algorithm can effectively cut the key size in half by offering a mechanism to search unsorted databases in faster than linear time.

[I_Learning_I]

They are crackable as long as they are based on either the integer factorization or the discrete logarithm problem, in which case they can be cracked by Shor's algorithm in complexity class BQP.

Your second paragraph concerns symmetric encryption, which is true. However, Grover's algorithm can effectively cut the key size in half by offering a mechanism to search unsorted databases in faster than linear time.

I had no clue about that what so ever, thanks for the explaining! I'm going to do some research about that, but can you tell me which algorithms are currently being used that use Integer Factorization or Discrete Logarithm? ( I should find some of them sooner or later, but this kind of information is usually pretty hard and requires a lot of knowledge to understand it, which I lack)


EDIT::
Ok I've read a little bit more about this, and what you're saying is based on Quantic Computing , which as far as I've seen (and as been publicly released) is very far from being able to crack hash's.
Even Quantic isn't as simple as "Start!... Cracked!".


I have seen cracking RSA 4096 with a microphone, which is pretty awesome, but requires a very specific set, a bunch of software that I believe it's not available and physical access to the machine.