# entropy of perfect cryptosystems

I am working on the product of two perfect crypto-systems and I need to prove that the product is secure.

$$a -- [\text{system}\ 1] -- b -- [\text{system}\ 2] -- c$$

How can I prove that $H(a) = H(a|c)$ knowing that $H(a|b) = H(a)$ and $H(b|c) = H(b)$?

-

You need something on system 1 and system 2 being independent, because if you compose (e.g.) 2 one-time pads, the result is not so secure.... – Henno Brandsma Feb 10 '12 at 21:57
Isn't this a markov chain? $p(c|a,b) = p(c|b)$ by markovity, and $p(c|b) = p(c)$ by independence of $b$ and $c$. $p(c|a,b) = p(c)$ also implies $a$ and $c$ are independent – VSJ Feb 10 '12 at 22:09
The two systems are independent I think. – Romain Pignard Feb 11 '12 at 1:08
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 10, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9365531802177429, "perplexity_flag": "middle"}