• 센서학회지
• /
• 제25권4호
• /
• pp.297-301
• /
• 2016

ISO/IEC JTC1/SC29WG11 MPEG has been standardizing UD(user description) to give a user personalized recommendation services. Besides, CD(context description), service description(SD), and recommendation description(RD) are recently being standardized by UD Adhoc Group in MPEG with an advanced UD to cope with needs of current and upcoming services such as augmented reality and social network. The descriptions was reflected to MPEG-UD WD(Working Draft) at MPEG $107^{th}$ meeting and the document was finally approved as international standard by national bodies with standard number(ISO/IEC IS 21000-22 UD) at $114^{th}$ MPEG meeting. In addition, reference software WD to validate conformance of UD standard was approved at $113^{th}$ MPEG meeting. In this paper, we developed a demo program for visual communication according to guideline defined in reference software WD to validate the reference software as well as UD standard.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1944-1956
• /
• 2016

The Digital Video Broadcasting-Common Scrambling Algorithm is an ETSI-designated algorithm designed for protecting MPEG-2 signal streams, and it is universally used. Its structure is a typical hybrid symmetric cipher which contains stream part and block part within a symmetric cipher, although the entropy is 64 bits, there haven't any effective cryptanalytic results up to now. This paper studies the security level of CSA against impossible differential cryptanalysis, a 20-round impossible differential for the block cipher part is proposed and a flaw in the cipher structure is revealed. When we attack the block cipher part alone, to recover 16 bits of the initial key, the data complexity of the attack is O(2^44.5), computational complexity is O(2^22.7) and memory complexity is O(2^10.5) when we attack CSA-BC reduced to 21 rounds. According to the structure flaw, an attack on CSA with block cipher part reduced to 21 rounds is proposed, the computational complexity is O(2^21.7), data complexity is O(2^43.5) and memory complexity is O(2^10.5), we can recover 8 bits of the key accordingly. Taking both the block cipher part and stream cipher part of CSA into consideration, it is currently the best result on CSA which is accessible as far as we know.