{"id":2825,"date":"2020-08-02T08:38:00","date_gmt":"2020-08-02T06:38:00","guid":{"rendered":"https:\/\/faugeron.net\/?p=2825"},"modified":"2020-07-31T09:02:09","modified_gmt":"2020-07-31T07:02:09","slug":"histoire-des-codes-secrets","status":"publish","type":"post","link":"https:\/\/faugeron.net\/?p=2825","title":{"rendered":"Histoire des codes secrets"},"content":{"rendered":"\n
\"\"<\/figure>
\n

Auteur : Simon Singh<\/p>\n\n\n\n

Tout est dans le titre : on traverse en 500 pages l’histoire de la cryptographie et de la cryptanalyse.
Depuis le d\u00e9chiffrage de langues anciennes (Hi\u00e9roglyphes, Lin\u00e9aire B) aux premi\u00e8res utilisations d’\u00e9critures chiffr\u00e9es dans la Gr\u00e8ce ancienne – ah la scytale qui m’avait donn\u00e9e du fil \u00e0 retordre lors d’un escape game<\/p>\n\n\n\n

\"\"
Scytale<\/figcaption><\/figure><\/div>\n\n\n\n

– jusqu’au premiers pas de l’ordinateur quantique qui semble permettre la mise en place d’un code r\u00e9ellement ind\u00e9chiffrable.<\/p>\n<\/div><\/div>\n\n\n\n\n\n\n\n

Entre les deux, on en apprend beaucoup sur les codes (les diff\u00e9rentes familles : transposition \/ substitution par exemple, la mani\u00e8re dont ils ont \u00e9t\u00e9 craqu\u00e9s comme l’utilisation de l’analyses des fr\u00e9quences.<\/p>\n\n\n\n

Tout cela est illustr\u00e9 par des exemples historiques (Marie Stuart, la machine Enigma) et des l’explications tr\u00e8s p\u00e9dagogiques des concepts pr\u00e9sent\u00e9s. J’ai juste cal\u00e9 sur les explication du code quantique.<\/p>\n\n\n\n

Les annexes illustrant plusieurs types de codes sont aussi tr\u00e8s int\u00e9ressantes.<\/p>\n\n\n

\u2b50<\/span>\u2b50<\/span>\u2b50<\/span>\u2b50<\/span><\/p>\n\n\t\n<\/svg>\n<\/span>\n\n\n\t\n<\/svg>\n<\/span><\/span>\n\n\t\n<\/svg>\n<\/span>\n\n\n\t\n<\/svg>\n<\/span><\/span>\n\n\t\n<\/svg>\n<\/span>\n\n\n\t\n<\/svg>\n<\/span><\/span>\n\n\t\n<\/svg>\n<\/span>\n\n\n\t\n<\/svg>\n<\/span><\/span>\n\n\t\n<\/svg>\n<\/span>\n\n\n\t\n<\/svg>\n<\/span><\/span>Note\u00a0: 3.5\u00a0sur 5.<\/span><\/div>\n\n\n

Tweet<\/a><\/div>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[82,4],"tags":[178,179],"class_list":["post-2825","post","type-post","status-publish","format-standard","hentry","category-essai","category-lectures","tag-code","tag-cryptographie"],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p74TSi-Jz","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/posts\/2825","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/faugeron.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2825"}],"version-history":[{"count":2,"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/posts\/2825\/revisions"}],"predecessor-version":[{"id":2828,"href":"https:\/\/faugeron.net\/index.php?rest_route=\/wp\/v2\/posts\/2825\/revisions\/2828"}],"wp:attachment":[{"href":"https:\/\/faugeron.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2825"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/faugeron.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2825"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/faugeron.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2825"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}