Why do people think he unplugged the monitor? Computer power supplies use that kinda plug too. There's also the implication that the computer fans turned off as the PC goes silent from sudden loss of power.
I love the non understanding of everything here. That two people can use the same keyboard to do different things, and that unplugging 1 computer in a shared network will turn the entire network off so people cant hack it. Or that a hackers code is revealed on the screen and it is constantly changing. NOTHING here is even believably close to right.
My girlfriend is really into this show and I can’t stop laughing at how stupid it is. That goth girl has the skill set of ten professionals! Most of them would’ve been fired for non professional behaviour at least.
Dumb as this scene is, I like sandwich guy. Wander into points of interest, ask about video games, eat sandwich I mean it's a philosophy that can last you a lifetime.
This is honestly the most boomer depiction of hacking. Like look at these dweebs, all you needed was a wise older man who just unplugs it like it’s a wonky toaster
the people who write stuff like this are currently striking for more money. p.s. they make far more than the vast majority of you. per hour, roughly lawyer/doctor tier i hate them and hope ai replaces them all
Actors just read lines my man. We attribute to them a lot more than is actually there, good and bad. Also I think this aired in like 2005, the internet was only beginning to go mainstream
A simple trick to get the d as well: d = e-1 mod φ(n). Let's take the example in the video: e = 7 φ(n) = 40 7^-1 mod 40 = 23 and that's how you can get it without going through the steps of the Extended Euclidean Algorithm
3:44 ??? "n is the trap door" ??? It's not that you can't FIND n. It's that you can't FACTOR n into p and q. You are trying to hide phi, which is easy to calculate with p and q. n = p*q -- modulus for the FIELD phi = (p-1)*(q-1) -- period at which exponentiation repeats. this lets you calculate d from e. The thing that confused me when I was first implementing raw RSA was that the modulus n is when the + and * repeat. But ^ repeats at phi. You need to mod phi on exponents, and only mod n after that. I can't tell you how easily this trips you up when implementing raw RSA. BigNumber libraries do + and *, and you can often do the operations first, but the mod n later. But exponentiation creates number so huge that you need to include n as an argument; reducing it mod n is mandatory. This means that if you use a library to just generate a p,q pair for you; you can do all of the RSA yourself. If you don't use a small e, you just use gcd to check d,e to ensure that they are not bad values. (b^x)%n is the raw RSA function. Exponentiation reduced mod n; that's really all that RSA is.
I would make a big distinction in RSA between asymmetric encryption and public-key encryption. If you use a well-known and small 'e', you have public key, but can't support 'asymmetric' key encryption. With 'asymmetric' key encryption, 'e' and 'd' have the same properties; and are equally secret. I use it to make digitally signed tokens such that you don't know the plaintext until you produce a witness that you performed verify to extract a secret to decrypt the signed claims. That way, the signer distribute the verify key to those who are allowed to VERIFY. It's not totally public, because it's (n,e), but signer has (n,d,e). This allows tokens to be passed around so that man-in-the middle can't decode the claims, and the verifier can only extract verified claims. ie: the current way of checking signatures (plaintext,Sign(H(plaintexty))=sig) has security problems. The main one being that you allow people to not verify the signatures; something that is very common in the hands of web developers. And the other is in leaking the tokens to intermediate proxies.
