4 ms·
The system sounds similar to VideoCrypt. The French system delays lines. VideoCrypt worked by rotating each display line by a number derived from a PRNG. To
by rwmj 6y ago
The system sounds similar to VideoCrypt. The French system delays lines. VideoCrypt worked by rotating each display line by a number derived from a PRNG. To decode the line the hardware had to buffer the line into a small piece of fast (for 1980s) RAM, and then using a number derived from the key would send the line to the TV starting at that offset and at the end wrapping around to the beginning.
I know all this because in my first job we did a bit of experimentation to see if it would be possible to reconstruct the encrypted images without the key, and in fact it was quite easy because images are very highly correlated from one line to the next, so you just had to rotate each line through each of the 256 combinations and compare it to the previous line, and pick the one with the least difference. Although our system was far too slow to decode a live feed (this would be early 90s), and had some other problems.
I didn't explain this very well - the Wikipedia page has a better explanation:
https://en.wikipedia.org/wiki/VideoCrypt https://en.wikipedia.org/wiki/VideoCrypt
- mytailorisrich 6y agoIn general you don't even need to use the whole line to do the correlation. I remember writing a small program to decrypt image stills in the late 90s and it was surprisingly easy and straightforward, though obviously doing it in real time may have been another story...
- anthk 6y agoIn Spain we had Canal+ with Nagravision and you had either a combo of two software under Windows, or xawtv-nagra under Linux to decode it (ilegally OFC).
- Scoundreller 6y agoWas also used in N. America. It had many vulnerabilities in every card generation. You could program OEM cards, have man-in-the-middle devices, and full emulators. You Never needed to actually use the cards for Nagra. But The competitor DTV system built by NDS had an ASIC on the chip, so all solutions required a card at some level. But some setups could use one slave card for multiple receivers. Even over IP. Fun times!
- ttsda 6y agoThose cardsharing schemes still exist today, although they're being cracked down more and more.
- jaywalk 6y agoYeah, DirecTV's aggressive legal actions in the early 2000s drove that whole scene very deep underground.
- Scoundreller 6y agoIt’s a funny full circle. Instead of using OEM receivers and compromised cards, they’ve gone to running emulated receivers and regular full-sub cards.
- dillonmckay 6y agoDo you have more info on this? I used to be really into FTA satellite, but have not played with it in awhile.
- Scoundreller 6y agoNever really played with them hands on. Ubiquitous broadband and streaming services really nailed InternetKeySharing’s coffin.
- anthk 6y agoYes, with PICF84 microcontrollers.
- Scoundreller 6y agoNagra hacks exclusively ran Atmels. But dunno what chips F cards used. The H cards were the ones that had ASICS.
- antman 6y agoIf you created a graph where the lines where the nodes and the difference between the lines where the edges then a traveling salesman algo might recreate it efficiently (or its vertical mirror I guess)
- eru 6y agoReducing a problem to the traveling salesmen usually doesn't go in the same sentence as efficiency.. It's almost the paradigmatic NP-hard problem. (And I don't understand how the reduction to traveling salesman problem would help here?)
- someguyorother 6y ago>(And I don't understand how the reduction to traveling salesman problem would help here?) Let the similarity between line i when rotated to position k and line i+1 when rotated to position j be d_k,j. Then you want to find a sequence of rotations r_1..r_n so that d_1,r_1,r_2 + d_2,r_2,r_3 + ... + d_(n-1),r_(n-1),r_n is minimized. In plain terms, you want to align each line so that it's most alike the previous line you rotated, but that in turn depends on the next-to-previous line you rotated, and so on up. This is a restricted type of traveling salesman problem: you want to visit all the nodes corresponding to each adjacent pair of rotation offsets so that the total edge cost (distance between the lines) is minimized. Since it's 1D, it should be pretty easy to solve with some dynamic programming (straightforward memoization). Calculate the minimal cost for each line down to k. Then for every possible choice of rotating the (k+1)th line, check which order of rotations of the preceding k lines that would minimize the objective down to the (k+1)th line, given that you rotated the k+1th line in that particular manner. Then determine the minima for every k+1 position and go on to line k+2. EDIT: It's even easier, since you can hold one line constant and rotate the next. Whenever you rotate the first line k, if you know the second line's optimal rotation for a zero rotation of the first line is j, you just rotate the second line k+j. So none of the above complexity is actually needed. I'll keep the comment to show how it could be considered a restricted TSP.
- eru 6y ago
- PoachedSausage 6y agoI see that has a reference to European Scrambling Systems 5 – The Black Book by John McCormac. I actually have a copy of that, it gives a rather entertaining overview of the arms race between the broadcasters and the hackers.
- NCG_Mike 6y agoI had it too ;-)
- mcbridematt 6y agoThe BBC ran a service called BBC Select in the early 90s with a VideoCrypt derivative, rather than line cut they shuffled blocks of lines around the screen - which worked better over more lossy and interference prone terrestrial transmissions. The technical paper from BBC R&D is quite interesting: http://downloads.bbc.co.uk/rd/pubs/reports/1995-11.pdf http://downloads.bbc.co.uk/rd/pubs/reports/1995-11.pdf There are a couple of captures of the scrambled transmission on Youtube - it's definitely far more advanced than the earlier Canal method https://youtu.be/HcCdw97_ESA https://youtu.be/HcCdw97_ESA
- raverbashing 6y agoAh I'm not sure there was fast (and cheap) enough RAM for that kinds of tricks in the 80's Most likely they would use a delay line https://en.wikipedia.org/wiki/Analog_delay_line https://en.wikipedia.org/wiki/Analog_delay_line Regular PAL (and I guess SECAM) TVs used one of those
- PoachedSausage 6y agoYou also had Bucket-Brigade devices. https://en.wikipedia.org/wiki/Bucket-brigade_device https://en.wikipedia.org/wiki/Bucket-brigade_device
- jimmaswell 6y agoSo essentially sleep sort in actual practice?