Talk:Pirate decryption

Limitations of Internet Card Sharing

The changes to the article by @Notwillywanka were reverted because the number of clients on a card sharing network is limited by a number of practical considerations. The most obvious limitation is that the card clients have to have a receiver capable of using the key stream. There is a limit to the number of possible receivers or clients on a card sharing network due to the latency of the network (the time taken for the data from the server to travel to the receiver) and the period between the updated keys. If the latency is greater than the period between the updated keys, the receiver/decoder (IRD) will miss a key and the signal may become encoded again. The decrypted key has to arrive within a specific timeframe and if the latency causes it to miss that window, the IRD will lose lock and stop decoding the signal. With large ISP networks, it may work well but on high-latency or poor connections, it will not be as effective and the signal on the IRD will stop being decoded if it misses too many keys. A related factor is that as the size of the card sharing network grows, the probability of detection increases. If the number of card clients on the card sharing network is high enough, then the Pay TV providers or law enforcement agencies may identify the network and neutralise it (either by identifying the cards being shared, or by identifying the operator and customers and taking legal action). Thus it is often in the best interests of the card sharing network operator to limit the number of clients on one card sharing network. In theory, one card can run a country's decoders however the real work practicalities make that difficult. Jmccormac (talk) 01:14, 15 February 2014 (UTC)

the limitations listed above do not affect the number of potential "subscribers". Just like a. Radio station can transmit to an unlimited number of roadios, a card sharing system can broadcast to an unlimited number of authorized receivers. It is not like viewing a web page, where each viewer has to open a connection and then wait for a response, where timing is an issue, but it is a constant stream that the authorized receiver listens. Into for the key. No limit as to how many can listen in, therefore unlimited. Bandwidth, latency, are factors in setup, and costs, but are all able to be easily overcome, limits are chosen by operators, not imposed by any ability. — Preceding unsigned comment added by Notwillywanka (talk • contribs) 23:06, 15 February 2014 (UTC)

The number of receivers capable of using the key stream is the upper limit (both theoretical and practical) for any card sharing network. To explain it in terms of your radio example, if there is a finite number of radio receivers, then the number of radios capable of receiving the radio broadcast from your radio station is finite and therefore limited. External conditions limit the size of card sharing network. If N is the number of receivers capable of using the key stream then the number of possible receivers in a card sharing network is always going to be less than or equal to N. Jmccormac (talk) 02:30, 16 February 2014 (UTC)

There is no finite number of radios that can be used, or made, no limit exists, the fact that there is a finite number of radios in existence does not limit the potential number of radios that can receive a signal. There is no upper limit to how many receivers are capable of receiving the key stream, every new receiver that is built can receive the stream, just like every new radio built is able to receive the radio signal, regardless of how many already are receiving the same signal. — Preceding unsigned comment added by Notwillywanka (talk • contribs) 16:38, 17 February 2014 (UTC)

Obviously you haven't much of an understanding of this particular hack and the simple mathematics behind it. You seem not to understand the limitations of a card sharing network. The number of clients in a card sharing network is limited to the number of devices that can use the key stream. This immediately sets an upper limit (N) on the maximum size of a card sharing network for any Pay TV service or operator. The size of a card sharing network is not unlimited. It is a finite number represented by the number of devices capable of using the key stream and the number of devices is not infinite. At any given time, the number of devices is finite (devices are built, devices fail and people even stop using them). That is a finite number. It really is that simple. Jmccormac (talk) 17:43, 17 February 2014 (UTC)

Real, easy, there is no actual limit as to how many CAN use. The number in existence is not a limit. Do some simple research, take time to think about it, just because there are a finite number of things at the moment, it does not limit the possible number that can exist.

Merger Proposal

There's a lot of overlap between this article and Smart card piracy. Lunchboxhero 19:57, 4 September 2007 (UTC)

Agreed, I believe that they should be merged. It would also be nice if a reference to Black Sunday 2001 would lead to this article. Str8lazy (talk) 23:36, 25 July 2008 (UTC)

NPOV dispute - Technical issues

I'm disputing the neutrality of this section due weasel words, and the following passages:
"In theory the system was an ideal solution" Ideal how, and in in whose opinion?
"In some cases, fraudulent cloning has been used..." This references a non-existing article and gives no explanation of what makes the cloning fraudulent.
Also:
"A scheme ... has been widely promoted by some unscrupulous individuals as a means of disabling communication of billing information for pay-per-view programming but this device is effectively worthless..."
I see no reason why the unnamed individuals should be described as unscrupulous, or why the described device should be labeled as effectively worthless, except for the author to express value judgements. I recommend identifying the individuals referred to, refrain from describing them as unscrupulous, and factually describing the technical shortcomings of the device.Bigpinksocks (talk) 16:52, 2 December 2012 (UTC)