Initial commit.

.gitignore

@@ -0,0 +1,243 @@
+# Created by .ignore support plugin (hsz.mobi)
+### JetBrains template
+# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio, WebStorm and Rider
+# Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839
+
+# User-specific stuff
+.idea/**/workspace.xml
+.idea/**/tasks.xml
+.idea/**/usage.statistics.xml
+.idea/**/dictionaries
+.idea/**/shelf
+
+# Generated files
+.idea/**/contentModel.xml
+
+# Sensitive or high-churn files
+.idea/**/dataSources/
+.idea/**/dataSources.ids
+.idea/**/dataSources.local.xml
+.idea/**/sqlDataSources.xml
+.idea/**/dynamic.xml
+.idea/**/uiDesigner.xml
+.idea/**/dbnavigator.xml
+
+# Gradle
+.idea/**/gradle.xml
+.idea/**/libraries
+
+# Gradle and Maven with auto-import
+# When using Gradle or Maven with auto-import, you should exclude module files,
+# since they will be recreated, and may cause churn.  Uncomment if using
+# auto-import.
+# .idea/artifacts
+# .idea/compiler.xml
+# .idea/jarRepositories.xml
+# .idea/modules.xml
+# .idea/*.iml
+# .idea/modules
+# *.iml
+# *.ipr
+
+# CMake
+cmake-build-*/
+
+# Mongo Explorer plugin
+.idea/**/mongoSettings.xml
+
+# File-based project format
+*.iws
+
+# IntelliJ
+out/
+
+# mpeltonen/sbt-idea plugin
+.idea_modules/
+
+# JIRA plugin
+atlassian-ide-plugin.xml
+
+# Cursive Clojure plugin
+.idea/replstate.xml
+
+# Crashlytics plugin (for Android Studio and IntelliJ)
+com_crashlytics_export_strings.xml
+crashlytics.properties
+crashlytics-build.properties
+fabric.properties
+
+# Editor-based Rest Client
+.idea/httpRequests
+
+# Android studio 3.1+ serialized cache file
+.idea/caches/build_file_checksums.ser
+
+### JupyterNotebooks template
+# gitignore template for Jupyter Notebooks
+# website: http://jupyter.org/
+
+.ipynb_checkpoints
+*/.ipynb_checkpoints/*
+
+# IPython
+profile_default/
+ipython_config.py
+
+# Remove previous ipynb_checkpoints
+#   git rm -r .ipynb_checkpoints/
+
+### VirtualEnv template
+# Virtualenv
+# http://iamzed.com/2009/05/07/a-primer-on-virtualenv/
+.Python
+[Bb]in
+[Ii]nclude
+[Ll]ib
+[Ll]ib64
+[Ll]ocal
+[Ss]cripts
+pyvenv.cfg
+.venv
+pip-selfcheck.json
+
+### Python template
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+pip-wheel-metadata/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py,cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+

crypto_challenges/03_one_time_pad_1/challenge/challenge.adoc

@@ -0,0 +1,6 @@
+= One Time Pad (easy)
+
+Task
+----
+
+In link:./ciphertext.txt[this file] a bunch of messages are encrypted with the same key. the link:./plaintext.txt[plain text] of the first message is known. find the key and decrypt the other messages.

crypto_challenges/03_one_time_pad_1/challenge/ciphertext.txt

@@ -0,0 +1,4 @@
+76b614f657cf718fe41fa6a5b91144eb
+76b675824cc077c4b017bfe0fd0052e1
+76b6758223c67788a811f2f2b2025fe1
+17961deb47ca778ae413b7f6ae1154e0

crypto_challenges/03_one_time_pad_1/challenge/plaintext.txt

@@ -0,0 +1 @@
+attack at dawn

crypto_challenges/04_one_time_pad_2/challenge/challenge.adoc

@@ -0,0 +1,7 @@
+= One Time Pad (2)
+
+Task
+----
+
+In link:./ciphertext.txt[this file] the messages are encrypted with the same key. The link:./plaintext.txt[plain text] of *one* of the messages is known. 
+Find the key and decrypt the other messages.

crypto_challenges/04_one_time_pad_2/challenge/ciphertext.txt

@@ -0,0 +1,6 @@
+58062ac82943788d172b4804710091792820ad91f0c2aee79d33726f666f3b0f1ed9ed64ef9d18db54ed0791410377d5566f29a7e9c8bef66424b869d073751c7ec0a2a4973cea88c14f8becd98c79ed5fa5c7352a115c5a525fe131fd58973242424f877d2681d3ddb973fd097a9d8e5895e9ee4924387711517be37ca06abb7c85a4b40e07388619817149057842e514d5fe5d49c51e6dbafbcb6795f91352de76673b1d78834ff6f52e220e04e0009197d4f82be65f4b1904c055f2de7c643d6e196c45f3b340a26fc812e95ac9f25a
+58062ac82943788d172b4804710091792820add89ee2cd95e4430600011d5a7f76a0cd1087f838b43a8873f82c6657a5370b09e8bd989e9f1704d907f0161b7f0cb9d2d0fe5384a8b52ae884b7e508983a85b35d4b657c3933318f5e8978f55762213de61e4de4b7fddb06892908f8b643dcefe353776c6b111266fe70f170b87c85a4ab0c0325810081294d57741cb60cd5e54a4881557faaafd72f91f91252dd7728255471830ce5e37a6d1741f54f9e9cc2e52be0524c1256c658f3de656e6e7c0b2b41f3be4bae75c65fff1fd7e71e
+58062ac82943788d172b4804710091792820add89ee2cd95e4430600011d5a7f76a0cd1087f838b43a8873f82c6657a5370b09e8bd989e9f1704d907f042731a6299b7b19d3ba4cadc5ec8ebc5c56bf05bf7d23e3f000e195c57af2ae11dd5270e4054886a289cc3ddb275a94c669b8d548cefee5e242e66541261fd7be96bb43283a4b214423b86008c714d1f784ff513c6fe5d5e951a66a7b2d168d0bb0947937c3568176a871df6e57a280e04ea1d909d91fe63f7175a16409448e4977f666e70176f55bfb057eb60cb56f34bcee914
+58062ac82943788d172b4804710091792820add8d784ede18c26266b64647a160580b962f294419448e91d9c430b77c4432b658ddcebeabf7677f96b9f787c5f6dcaf2a49636a4d8d94b81eac38070ec1aebd62b2e175c4b5644fc3bed589c39425655897228c4d88ffb6fe70978998d59dcfae55e24277a04052ef376ed75b13990e1b719423f8a1796344d576907f31294f85048c5076db0aed37b99b70713d07a37201170920aeff22e3a1548e04f9d9591e366e25859044dd651f2de656e6e791d6852aaa151eb6edd12f84dc2e711
+58062ac82943788d172b4804710091792820add89ee2cd95e4430600011d5a7f76a0cd1087f838b43a8873f82c6657a5370b09e8bd989e9f1704d907f0161b7f0cb9d2d0b727a4c0d459c8e5db9667b858e0d6336b150e564554e17efd1094234240539f3e2e8dc795be74a95e618c970d88f3ee1a743e7004147ce460a06abb7c94e1a906072f9b5497345a05780cef5cd9f94b59c5007ba6fbd46a89aa4044da672f681164800af4f2673b1948f54f8b98d4aa78f35a4f5756d14ce29763642378167f53f3b056eb4efb62ba54c2ff09
+1c6f4da15d2214ad614e3a77186fff0a084fcbf8f18ca8e18d2e6320717c3e5f15c9bd78e28a4b9452e9059d0c0432c0592b7c9bd8fcbefd6e24b766847f74117f99b4bf8c73e7dadc5e81e7d68928fc53f5df32260408505011ee30ed58983e0e4849876c34c4d492b66bfc47619b9e5995f4e51a66396b540566f539f077b23e88e1b6134223895497345a026f0ab617d1f518498c067cb1b2dd7a84b00f5d937b263e11228b0ef3e32e391441e14f969dc1f86af143431445d81df191632123720b7f00b2a155a768cc53ee56c8e809

crypto_challenges/04_one_time_pad_2/challenge/plaintext.txt

@@ -0,0 +1 @@
+It has also been proven that any cipher with the property of perfect secrecy must use keys with effectively the same requirements as OTP keys

crypto_challenges/05_one_time_pad_3/challenge/challenge.adoc

@@ -0,0 +1,11 @@
+= One Time Pad (hard)
+
+Task
+----
+
+In link:./ciphertext.txt[this file] all messages are encrypted with the same key. But this time, you do not have a plaintext available
+to solve the task easily.
+Yet, your task is to obtain the key and decrypt the *last messages* in the text!
+
+TIP: Observe what happens when you `XOR` one specific characters with some other characters.
+

crypto_challenges/05_one_time_pad_3/challenge/ciphertext.txt

@@ -0,0 +1,12 @@
+425c37edec19399dcfb4e78d0759c8bda4b1b8c5ac119d4bef0afcaa69580c3e900eccda45297677a8a3d4ae8b74de322e304d329422b3195cbf35b45798fac5b523561907e455f63312c0a018c59ea7d6706c786a880eb9d8c397d00bbd2df2a01919be829f49c9102dc3c6f00a01641afb41f83489f636cee006c041136e40c0bf1be545a56eef2740e7
+544a37cbf81b7c898ea0fc97191d9ca5b3feb4d1a31f8119aa55a3e567110c3ed10b99d5442a2372e1b39bb79364c525392e4370a624fc1758a235b41b88fa97bd27474d1be21aec3e578fa84dcb8ebbd424326d67df26a3de8c988902bd3fa1f40416f7a98f418c16659084e5100f2b1cf65e
+356d7febad197098cbf7e78a1c17dbf5a0f3b9c5b553b35caa42a5e56f1111259011d6cc0b2a663aebb2c2b38f6ecd253d330b77b134b3195cbf35b14982e380f323150107e255ed3d5786af03cb85e2c7312f3e6ad24789d18dd6b200bc2fba
+415172aeee1e6993cba5e7870d0d9ca5b3feb2c5a2169c19ad42e9eb3e461d37db5fdcd5482f7a6afca9d4addb60c63033310a66ab2ab31652be7ea61b8ae6c5b42d5a0948f706a2381e90a608da88a7dc247d3d389003b8d38692d00dab6ab3f4180ca583944ac9012c80d6e8081e2d01fd13fc3dceed2dcaf11d8d4c1e1c7fcab305f815cd55f42648fb37cbfb115e
+4c5662aee91877dbdaf7e4831b0d9cf5b5fef6d2b40ad858ef48acfe3e5e1e76d31ecb9b40387a69a8a6c9ac9621cb773b361a32b42ffc5a4ea170b6528af98ca927464d01f855f12f1281a204c69be2c7312f3e6ad24780d19195d03dbd3eb7ba091da58bda4e86092f86cae51104234efc5dbd12c5eb2fd3e007
+415172fce8577889cbf7e7951a59c8acb1f4a590ae15d85abd42b9fe71560a37c017c09b067d7772e9b49bb49368c93f7c340a7eaf67f81f58a135a65e88e780a731151e09f010a23d058fa34dd193b7d67031243e8b0ba890909f831bb738fef40a16b3cc8e4588106294ccf81b026419fa5ff171c2e73ad3a506850f41595bd1fa1af003882ffb394af365dff50a429875bcf49ed8ad52bed05c575935e1a6d565c2f43392576031330889
+415172aef90076dbdaaee3875516daf5a2e8a6c4ae148a58bf53b0b03e5e1633900bd1da5f7d6276e4afccb0db75c2327c040c64a635fd1758bf61f54f84b590a027150f1ae301e77b118fbc0ecddcb6cb703f3f2f9e0cedc48b93d00cbd2eb7f84b19b988da4287016297ccf00c4a360be246f423ccf17fd7ed10c02b5c4a4ad0b404f40b992fe92405eb36c3ba1d42cd66b6a29dc5b15cbe9e5c185477d1b1c16d87ad0f84052e2c2215
+425c37edec193988cbb2b3961d1c9ca5aef8b8c4e104905cbd5ee9fe76545835d816c99b422e236fe6a8dab38b788a3e3a630232b435fc145af177bc4fcbfc96f33150031cb614ec3f5783a103db89afc1237d20258d02edc08c81951df22ca0bb0658a3849f0d8c0a348ad6fe16072100e713b071e8e63683d61d81015a4e
+54193ffeff1e6f9adab2b389100095f5a4ffb5c2b8038c50a055e9f97d591d3bd55fcacf4a296669a8f39ba29766c52535370b7fb06bb3145cbc70b942cbf4c5a3305a0e0df200f03e5786a11f889ba7ca352f2c3e9609aa908893891cfe6ab3f41b0ab88f9f499c1627c3c2fe0a4a2100f041e421ddeb31c4a9558102571c4e82aa1bfe06886be83940be23c9e85f54dd71a1fb8bdeaa51bc9017
+415172aece187798c7a4f6c23a01dabab3f592d9a2079156a15abbf33e194a668049909b4f386573e6a5c8e39873d327282c4373b067e71258f174a74fcbfa83f362421f01e21cec3c578fee1f888fadc82634232ddf04a2d48685de4f
+54557baee419399ac2bbb3961d1cceb0e1f8a590b21e9955a31bbde2775f1f76c41099c84a242d3ac9e0ddaa976dcf257c20027ce32ff6164df161ba1b98fa89a527151900f355f0321384a208889de2c639296d289a13b9d591d68407b324f2a3020cbf838f5981
+415172aefe127a89cba3b38f100acfb4a6f4f6d9b249d86ea75ea7aa6b421138d75fd89b5829717fe9ad9ba09271c2322e6f437ca631f6081da466b01b9ffd80f329501448fb1af03e5794a60cc6dcadca3338

crypto_challenges/Caesar/challenge/challenge.adoc

@@ -0,0 +1,20 @@
+= Caesar cipher
+:imagesdir: images
+:icons: font
+:source-highlighter: rouge
+:stem: latexmath
+
+== Task
+
+The messages in link:./ciphertext.txt[this file] are encrypted with the caesar cipher, all messages are seperated with newline. Each line uses a different letter for the caesar-shifting.
+Your task is to decrypt all messages. Of course, this can simply be done by brute forcing each line and manually select the assumed semantic correct sentence. However, your task is trying to do the selection of the correct messages automatically.
+
+[TIP]
+====
+The file link:./english_freq.txt[letter frequencies list] contains the statistical standard distribution of letters for the english language. _The first line corresponds to `A`, the last line corresponds to `Z`._ 
+Enhance your Frequency Analyzer and write a function that determines to what extend a given plaintext aligns with the standard distribution for the language. This can be done by using the so called *_chi square_* test: +
+
+stem:[\displaystyle \sum_{i=0}^{k=25}{\frac{(observed_i - expected_i)^2}{expected_i}}] +
+
+In each case, select the plaintext with the lowest score from the _chi square_ test.
+====

crypto_challenges/Caesar/challenge/ciphertext.txt

@@ -0,0 +1,13 @@
+Vgjglzq danwv af lzw eavkl gx lzw yjwsl Csfksk hjsajawk, oalz Mfudw Zwfjq, ozg osk s xsjewj, sfv Smfl We, ozg osk lzw xsjewj'k oaxw. Lzwaj zgmkw osk kesdd, xgj lzw dmetwj lg tmadv al zsv lg tw usjjawv tq osygf esfq eadwk. Lzwjw owjw xgmj osddk, s xdggj sfv s jggx, ozauz esvw gfw jgge; sfv lzak jgge ugflsafwv s jmklq dggcafy uggcklgnw, s umhtgsjv xgj lzw vakzwk, s lstdw, lzjww gj xgmj uzsajk, sfv lzw twvk. Mfudw Zwfjq sfv Smfl We zsv s tay twv af gfw ugjfwj, sfv Vgjglzq s dalldw twv af sfglzwj ugjfwj. Lzwjw osk fg ysjjwl sl sdd, sfv fg uwddsj--wpuwhl s kesdd zgdw vmy af lzw yjgmfv, usddwv s uqudgfw uwddsj, ozwjw lzw xseadq ugmdv yg af uskw gfw gx lzgkw yjwsl ozajdoafvk sjgkw, eayzlq wfgmyz lg ujmkz sfq tmadvafy af alk hslz. Al osk jwsuzwv tq s ljsh vggj af lzw eavvdw gx lzw xdggj, xjge ozauz s dsvvwj dwv vgof aflg lzw kesdd, vsjc zgdw.
+Nyve Ufifkyp jkffu ze kyv uffinrp reu cffbvu rifleu, jyv tflcu jvv efkyzex slk kyv xivrk xirp girzizv fe vmvip jzuv. Efk r kivv efi r yfljv sifbv kyv sifru jnvvg fw wcrk tflekip kyrk ivrtyvu kf kyv vuxv fw kyv jbp ze rcc uzivtkzfej. Kyv jle yru srbvu kyv gcfnvu creu zekf r xirp drjj, nzky czkkcv tirtbj ileezex kyiflxy zk. Vmve kyv xirjj nrj efk xivve, wfi kyv jle yru slievu kyv kfgj fw kyv cfex scruvj lekzc kyvp nviv kyv jrdv xirp tfcfi kf sv jvve vmvipnyviv. Fetv kyv yfljv yru svve grzekvu, slk kyv jle sczjkvivu kyv grzek reu kyv irzej nrjyvu zk rnrp, reu efn kyv yfljv nrj rj ulcc reu xirp rj vmvipkyzex vcjv.
+Lwtc Pjci Tb rpbt iwtgt id axkt hwt lph p ndjcv, egtiin lxut. Iwt hjc pcs lxcs wps rwpcvts wtg, idd. Iwtn wps ipztc iwt hepgzat ugdb wtg tnth pcs atui iwtb p hdqtg vgpn; iwtn wps ipztc iwt gts ugdb wtg rwttzh pcs axeh, pcs iwtn ltgt vgpn pahd. Hwt lph iwxc pcs vpjci, pcs ctktg hbxats cdl. Lwtc Sdgdiwn, lwd lph pc dgewpc, uxghi rpbt id wtg, Pjci Tb wps qttc hd hipgiats qn iwt rwxas'h apjvwitg iwpi hwt ldjas hrgtpb pcs egthh wtg wpcs jedc wtg wtpgi lwtctktg Sdgdiwn'h btggn kdxrt gtprwts wtg tpgh; pcs hwt hixaa addzts pi iwt axiiat vxga lxiw ldcstg iwpi hwt rdjas uxcs pcniwxcv id apjvw pi.
+Letcv Yveip evmvi crlxyvu. Yv nfibvu yriu wifd dfiezex kzcc ezxyk reu uzu efk befn nyrk afp nrj. Yv nrj xirp rcjf, wifd yzj cfex svriu kf yzj iflxy sffkj, reu yv cffbvu jkvie reu jfcvde, reu irivcp jgfbv.
+Sd gkc Dydy drkd wkno Nybydri vkeqr, kxn ckfon rob pbyw qbygsxq kc qbki kc rob ydrob cebbyexnsxqc. Dydy gkc xyd qbki; ro gkc k vsddvo lvkmu nyq, gsdr vyxq csvui rksb kxn cwkvv lvkmu oioc drkd dgsxuvon wobbsvi yx osdrob csno yp rsc pexxi, goo xyco. Dydy zvkion kvv nki vyxq, kxn Nybydri zvkion gsdr rsw, kxn vyfon rsw nokbvi.
+Wrgdb, krzhyhu, wkhb zhuh qrw sodblqj. Xqfoh Khqub vdw xsrq wkh grruvwhs dqg orrnhg dqalrxvob dw wkh vnb, zklfk zdv hyhq judbhu wkdq xvxdo. Grurwkb vwrrg lq wkh grru zlwk Wrwr lq khu dupv, dqg orrnhg dw wkh vnb wrr. Dxqw Hp zdv zdvklqj wkh glvkhv. Iurp wkh idu qruwk wkhb khdug d orz zdlo ri wkh zlqg, dqg Xqfoh Khqub dqg Grurwkb frxog vhh zkhuh wkh orqj judvv erzhg lq zdyhv ehiruh wkh frplqj vwrup. Wkhuh qrz fdph d vkdus zklvwolqj lq wkh dlu iurp wkh vrxwk, dqg dv wkhb wxuqhg wkhlu hbhv wkdw zdb wkhb vdz ulssohv lq wkh judvv frplqj iurp wkdw gluhfwlrq dovr.
+Dfoopywj Fynwp Spycj dezzo fa. "Espcp'd l njnwzyp nzxtyr, Px," sp nlwwpo ez std htqp. "T'ww rz wzzv lqepc esp deznv." Espy sp cly ezhlco esp dspod hspcp esp nzhd lyo szcdpd hpcp vpae. Lfye Px oczaapo spc hzcv lyo nlxp ez esp ozzc. Zyp rwlynp ezwo spc zq esp olyrpc nwzdp le slyo. "Bftnv, Ozczesj!" dsp dncplxpo. "Cfy qzc esp npwwlc!"
+Ytyt ozruji tzy tk Itwtymd'x fwrx fsi mni zsijw ymj gji, fsi ymj lnwq xyfwyji yt ljy mnr. Fzsy Jr, gfiqd kwnlmyjsji, ymwjb tujs ymj ywfu ittw ns ymj kqttw fsi hqnrgji itbs ymj qfiijw nsyt ymj xrfqq, ifwp mtqj. Itwtymd hfzlmy Ytyt fy qfxy fsi xyfwyji yt ktqqtb mjw fzsy. Bmjs xmj bfx mfqkbfd fhwtxx ymj wttr ymjwj hfrj f lwjfy xmwnjp kwtr ymj bnsi, fsi ymj mtzxj xmttp xt mfwi ymfy xmj qtxy mjw kttynsl fsi xfy itbs xziijsqd zuts ymj kqttw.
+Maxg t lmktgzx mabgz atiixgxw. Max ahnlx pabkexw tkhngw mph hk makxx mbfxl tgw khlx lehper makhnza max tbk. Whkhmar yxem tl by lax pxkx zhbgz ni bg t uteehhg. Max ghkma tgw lhnma pbgwl fxm paxkx max ahnlx lmhhw, tgw ftwx bm max xqtvm vxgmxk hy max vrvehgx. Bg max fbwwex hy t vrvehgx max tbk bl zxgxkteer lmbee, unm max zkxtm ikxllnkx hy max pbgw hg xoxkr lbwx hy max ahnlx ktblxw bm ni abzaxk tgw abzaxk, ngmbe bm ptl tm max oxkr mhi hy max vrvehgx; tgw maxkx bm kxftbgxw tgw ptl vtkkbxw fbexl tgw fbexl tptr tl xtlber tl rhn vhnew vtkkr t yxtmaxk.
+Uf ime hqdk pmdw, mzp ftq iuzp taixqp taddunxk mdagzp tqd, ngf Padaftk ragzp etq ime dupuzs cgufq qmeuxk. Mrfqd ftq rudef rqi itudxe mdagzp, mzp azq aftqd fuyq itqz ftq tageq fubbqp nmpxk, etq rqxf me ur etq iqdq nquzs daowqp sqzfxk, xuwq m nmnk uz m odmpxq.
+Ojoj ydy ijo gdfz do. Cz mvi vwjpo ocz mjjh, ijr czmz, ijr oczmz, wvmfdib gjpygt; wpo Yjmjoct nvo lpdoz nodgg ji ocz agjjm viy rvdozy oj nzz rcvo rjpgy cvkkzi.
+Utik Zuzu muz zuu tkgx znk uvkt zxgv juux, gtj lkrr ot; gtj gz loxyz znk rozzrk moxr znuamnz ynk ngj ruyz nos. Haz yuut ynk ygc utk ul noy kgxy yzoiqotm av znxuamn znk nurk, lux znk yzxutm vxkyyaxk ul znk gox cgy qkkvotm nos av yu zngz nk iuarj tuz lgrr. Ynk ixkvz zu znk nurk, igamnz Zuzu he znk kgx, gtj jxgmmkj nos otzu znk xuus gmgot, glzkxcgxj iruyotm znk zxgv juux yu zngz tu suxk giiojktzy iuarj ngvvkt.
+Vcif othsf vcif doggsr okom, obr gzckzm Rcfchvm uch cjsf vsf tfwuvh; pih gvs tszh eiwhs zcbszm, obr hvs kwbr gvfwsysr gc zcirzm ozz opcih vsf hvoh gvs bsofzm psqoas rsot. Oh twfgh gvs vor kcbrsfsr wt gvs kcizr ps rogvsr hc dwsqsg kvsb hvs vcigs tszz ouowb; pih og hvs vcifg doggsr obr bchvwbu hsffwpzs voddsbsr, gvs ghcddsr kcffmwbu obr fsgczjsr hc kowh qozazm obr gss kvoh hvs tihifs kcizr pfwbu. Oh zogh gvs qfokzsr cjsf hvs gkomwbu tzccf hc vsf psr, obr zom rckb idcb wh; obr Hchc tczzcksr obr zom rckb psgwrs vsf. Wb gdwhs ct hvs gkomwbu ct hvs vcigs obr hvs kowzwbu ct hvs kwbr, Rcfchvm gccb qzcgsr vsf smsg obr tszz togh ogzssd.

crypto_challenges/Caesar/challenge/english_freq.txt

@@ -0,0 +1,26 @@
+0.08167
+0.01492
+0.02202
+0.04253
+0.12702
+0.02228
+0.02015
+0.06094
+0.06966
+0.00153
+0.01292
+0.04025
+0.02406
+0.06749
+0.07507
+0.01929
+0.00095
+0.05987
+0.06327
+0.09356
+0.02758
+0.00978
+0.02560
+0.00150
+0.01994
+0.00077

crypto_challenges/Frequency_Analyzer/challenge/freqanalyzer.adoc

@@ -0,0 +1,70 @@
+= Frequency Analyzer
+
+== Task
+
+Implement a program that analyzes arbitrary text files by counting the occurrence of letters.
+All special characters (e.g. `-`, `.`, `,`,`\s`,`\n`) and numbers should be ignored.
+The program should treat all letters as case-insensitive and output:
+
+* the letter,
+* the number of it occurance and
+* a percentage value in relation to all letters in the text
+
+---
+
+For example, the following text should generate a similar output as shown below.
+
+`This is a simple test`
+
+[cols="",opts="autowidth"]
+|===
+|S |4 | 0.23529 | 23.529 %
+|T |3 | 0.17647 | 17.647 %
+|I |3 | 0.17647 | 17.647 %
+|E |2 | 0.11765 | 11.765 %
+|H |1 | 0.05882 | 5.882 %
+|A |1 | 0.05882 | 5.882 %
+|M |1 | 0.05882 | 5.882 %
+|P |1 | 0.05882 | 5.882 %
+|L |1 | 0.05882 | 5.882 %
+|===
+
+---
+
+TIP: Design your program such that you can easily reuse the frequency-analysis component in other programs as well.
+
+WARNING: You can use any programming language you want. We will need the frequency analyzer for some other challenges as well. So choose wisely!
+
+---
+Example output of a fequency analyzer program using the input link:./../test.txt[test.txt].
+
+[source, Shell]
+--
+$ python solution.py ../test.txt 
+E  562 0.11408
+T  467 0.09480
+I  428 0.08688
+A  423 0.08587
+O  396 0.08038
+S  356 0.07226
+U  344 0.06983
+M  299 0.06069
+R  292 0.05927
+L  277 0.05623
+D  246 0.04993
+N  242 0.04912
+C  137 0.02781
+P  104 0.02111
+G   77 0.01563
+V   67 0.01360
+B   52 0.01055
+Q   38 0.00771
+Y   28 0.00568
+K   24 0.00487
+F   22 0.00446
+J   12 0.00243
+H   11 0.00223
+Z   10 0.00203
+X    8 0.00162
+W    4 0.00081
+--

crypto_challenges/Frequency_Analyzer/test.txt

@@ -0,0 +1,21 @@
+Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet.   
+
+Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat.   
+
+Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi.   
+
+Nam liber tempor cum soluta nobis eleifend option congue nihil imperdiet doming id quod mazim placerat facer possim assum. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat.   
+
+Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis.   
+
+At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, At accusam aliquyam diam diam dolore dolores duo eirmod eos erat, et nonumy sed tempor et et invidunt justo labore Stet clita ea et gubergren, kasd magna no rebum. sanctus sea sed takimata ut vero voluptua. est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat.   
+
+Consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus.   
+
+Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet.   
+
+Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat.   
+
+Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi.   
+
+Nam liber tempor cum soluta nobis eleifend option congue nihil imperdiet doming id quod mazim placerat facer possim assum. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo.

crypto_challenges/Monoalphabetic_Substitution/challenge/challenge.adoc

@@ -0,0 +1,17 @@
+= Monoalphabetic substitution cipher
+
+Task
+----
+
+The letters in link:./ciphertext.txt[this file] are encrypted with a monoalphabetic substitution cipher.
+The encrypted message consists a single line ending with a newline.
+Decrypt the message!
+
+How
+---
+
+. Write a program that sorts the letters of the encrypted message text by frequency
+    .. Use your developed frequency analyzer to derive the statistical distribution of the letters
+    .. Do not use an online tool to solve this challenge!
+. Use this link:./monoalphabetic_substitution.html[tool] and start substituting according to the link:./english_freq.txt[most common letters list]
+

crypto_challenges/Monoalphabetic_Substitution/challenge/ciphertext.txt

@@ -0,0 +1 @@
+XG IRK R WYXTPG NDVE ERO XU RAYXV, RUE GPQ NVDNCK IQYQ KGYXCXUT GPXYGQQU. IXUKGDU KLXGP, PXK NPXU UHJJVQE XUGD PXK WYQRKG XU RU QSSDYG GD QKNRAQ GPQ MXVQ IXUE, KVXAAQE BHXNCVO GPYDHTP GPQ TVRKK EDDYK DS MXNGDYO LRUKXDUK, GPDHTP UDG BHXNCVO QUDHTP GD AYQMQUG R KIXYV DS TYXGGO EHKG SYDL QUGQYXUT RVDUT IXGP PXL. GPQ PRVVIRO KLQVG DS WDXVQE NRWWRTQ RUE DVE YRT LRGK. RG DUQ QUE DS XG R NDVDHYQE ADKGQY, GDD VRYTQ SDY XUEDDY EXKAVRO, PRE WQQU GRNCQE GD GPQ IRVV. XG EQAXNGQE KXLAVO RU QUDYLDHK SRNQ, LDYQ GPRU R LQGYQ IXEQ: GPQ SRNQ DS R LRU DS RWDHG SDYGO-SXMQ, IXGP R PQRMO WVRNC LDHKGRNPQ RUE YHTTQEVO PRUEKDLQ SQRGHYQK. IXUKGDU LREQ SDY GPQ KGRXYK. XG IRK UD HKQ GYOXUT GPQ VXSG. QMQU RG GPQ WQKG DS GXLQK XG IRK KQVEDL IDYCXUT, RUE RG AYQKQUG GPQ QVQNGYXN NHYYQUG IRK NHG DSS EHYXUT EROVXTPG PDHYK. XG IRK ARYG DS GPQ QNDUDLO EYXMQ XU AYQARYRGXDU SDY PRGQ IQQC. GPQ SVRG IRK KQMQU SVXTPGK HA, RUE IXUKGDU, IPD IRK GPXYGO-UXUQ RUE PRE R MRYXNDKQ HVNQY RWDMQ PXK YXTPG RUCVQ, IQUG KVDIVO, YQKGXUT KQMQYRV GXLQK DU GPQ IRO. DU QRNP VRUEXUT, DAADKXGQ GPQ VXSG-KPRSG, GPQ ADKGQY IXGP GPQ QUDYLDHK SRNQ TRJQE SYDL GPQ IRVV. XG IRK DUQ DS GPDKQ AXNGHYQK IPXNP RYQ KD NDUGYXMQE GPRG GPQ QOQK SDVVDI ODH RWDHG IPQU ODH LDMQ. WXT WYDGPQY XK IRGNPXUT ODH, GPQ NRAGXDU WQUQRGP XG YRU.

crypto_challenges/Monoalphabetic_Substitution/challenge/english_freq.txt

@@ -0,0 +1,26 @@
+E 12.359 %
+T  8.952 %
+A  8.050 %
+O  7.715 %
+N  6.958 %
+I  6.871 %
+H  6.502 %
+S  6.290 %
+R  5.746 %
+D  4.537 %
+L  4.030 %
+U  2.805 %
+M  2.591 %
+C  2.378 %
+W  2.354 %
+F  2.181 %
+Y  2.119 %
+G  2.042 %
+P  1.682 %
+B  1.494 %
+V  1.032 %
+K  0.853 %
+X  0.145 %
+J  0.127 %
+Q  0.099 %
+Z  0.088 %

crypto_challenges/Monoalphabetic_Substitution/challenge/monoalphabetic_substitution.html

@@ -0,0 +1,64 @@
+<html>
+    <head>
+        <style>
+            input {
+                width:30%;
+            }
+            .letter {
+                width:90%;
+                padding-left:10px;
+            }
+        </style>
+        <script>
+            function load() {
+                var list = document.getElementById("list");
+                for (var i = 1; i <= 26; i++) {
+                    var div = document.createElement("DIV");
+                    var input = document.createElement("INPUT");
+                    div.classList.add("letter");
+                    div.innerHTML = String.fromCharCode(i + 64) + " => ";
+                    if (input.value == "") { input.value = String.fromCharCode(i + 64); }
+                    input.id = "k" + i;
+                    input.oninput = function(){decrypt()}; 
+                    input.maxLength = "1";
+                    div.appendChild(input);
+                    list.appendChild(div);
+                }
+            }
+
+            function decrypt() {
+                var cipher = document.getElementById("cipher").value;
+                var key = [];
+                for (var i = 1; i <= 26; i++) {
+                    var letter = document.getElementById("k"+i).value;
+                    key.push(letter.toUpperCase());
+                }
+                cipher = cipher.toLowerCase()
+                for (var i = 1; i <= 26; i++) {
+                    cipher = cipher.replace(new RegExp(String.fromCharCode(i + 96), 'g'), key[i-1]);
+                }
+                document.getElementById("plain").innerHTML = cipher;
+            }
+        </script>
+    </head>
+
+    <body onload="load()">
+
+        
+        <div style="width:80%;height:10%;border:1px solid black;position:absolute;left:10%;top:5%" >
+            <h1 align="center" style="width:100%;height:100%;"> Monoalphabetic Substitution </h1>
+        </div>
+        <div style="width:70%;height:40%;border:1px solid black;position:absolute;left:10%;top:15%;overflow:scroll" >
+            <h1> Cipher Text </h1>
+            <textarea id="cipher" oninput="decrypt()" style="width:100%;height:100%;resize:none"> </textarea>
+        </div>
+        <div style="width:70%;height:40%;border:1px solid black;position:absolute;left:10%;top:55%;overflow:scroll" >
+            <h1> Plain Text </h1>
+            <p id="plain"> </p>
+        </div>
+        
+        <div id="list" style="width:10%;height:80%;border:1px solid black;position:absolute;left:80%;top:15%;overflow:scroll" >        
+            <h1 align="center"> Map </h1>
+        </div>
+    </body>
+</html>

crypto_challenges/Vigenere/challenge/challenge.adoc

@@ -0,0 +1,100 @@
+= Vigenere cipher
+:stem: latexmath
+
+== Task
+
+
+The content of link:./ciphertext.txt[this file] is encrypted with a _Vigenere cipher_. (The key length is limited to 20 letters) +
+
+Your task is to decrypt the content. Please note that you do not know the length of the key in this task!
+
+Your solution will only be accepted if you find a better approach than simply trying all possible combinations for every possible key length  (w.r.t. brute force) paired with a _simple_ frequency analysis.
+
+_A more intelligent appraoch will solve this task in roughtly quadratic time stem:[O=n^2], whereas trying all possible combinations, i.e. brute force, needs exponential time stem:[O=c^n \leftarrow c \gt 1]._
+
+
+== Help
+
+[NOTE]
+====
+The values used in this example are artifical and not the real values. For a very short text, the solution is not accurate enough!
+====
+
+. you need to guess the key length, thus you know it is not longer than 20 letters, try every possible key length stem:[2 \leq length \leq 20] 
+
+. for every key length analyze the ciphertext statistically to derive the best plaintext
+
+.. you have to crack the key two letters at a time +
+if the length is 3
+
+    VHEEMCRD (<- note that this is the plaintext for the example)
+    ABCABCAB
+    
+you observe that the letters VH, EM and RD are encrypted with the first two letters of the key
+
+.. cut the ciphertext to strings with the size of the key length. each column is then encoded with one letter +
+example: +
+Suppose the key is *ABC*. The _ciphertext_ *VIGENERE* should be cut into
+
+    VIG
+    ENE
+    RE
+    
+    
+. combining the first string with the second, the second with the third and so on. the last string should be combined with the first +
+this gives us:
+
+    01 01 01 (key_index)
+    --------
+    VI EN RE # letters enrypted with key[0] and key[1]
+
+    12 12    (key_index)
+    -----
+    IG NE    # letters enrypted with key[1] and key[2]
+
+    20 20    (key_index)
+    -----
+    GV EE    # letters enrypted with key[2] and key[0]
+    
+. for each sequence of two consecutive letters try all possible two letters keys (AA, AB, AC, ..., ZY, ZZ)
+
+    VI EN RE decrypted with AA gives VI EN RE 
+    VI EN RE decrypted with AB gives VH EM RD
+    ...
+    VI EN RE decrypted with ZZ gives WJ FO SF
+    
+. using the link:./english_bigram[Bigram Frequencies] (the frequencies are sorted alphabetically) give each key a score by multiplying the frequencies of the bigrams in the plaintext
+
+     CIPHER  | KEY | PLAIN
+    --------------------------
+    VI EN RE | AB  | VH EM RD
+    --------------------------
+    score(AB) = frequency(VH) + frequency(EM) + frequency(RD)
+
+[TIP]
+--
+* Normally, you would calculate the score by multiplication: `score(AB) = frequency(VH) * frequency(EM) * frequency(RD)`. However, with the given bigram frequencies, which are provided as logarithmic values, you can use an addition instead
+* This means, the calculation using the numbers from the provided Bigram Frequencies is as follows: `score(AB) = frequency(VH) + frequency(EM) + frequency(RD)`
+** The higher the calculated value, the better is the score for that particular bigram pair
+--
+
+. select for each string the key with the best score
+
+     PLAIN   | KEY | K_index | SCORE
+    -----------------------------------
+    VH EM RD | AB  | 01      |151125528
+    DA IY    | FG  | 12      |119303088
+    EI CR    | CN  | 20      |122328401
+
+. form the final key from these keys
+
+    key[0] is either A or N, since score(AB) > score(CN), take A
+    key[1] is either B or F, since score(AB) > score(FG), take B
+    key[2] is either G or C, since score(CN) > score(FG), take C
+    => the best key of length 3 is ABC
+
+. do this process for key lengths 2 to 20
+
+. using frequency analysis find the best fit of the 19 keys
+
+

crypto_challenges/Vigenere/challenge/english_bigram.txt

@@ -0,0 +1,676 @@
+1721143
+8775582
+17904683
+14877234
+815963
+5702567
+8809266
+2225270
+13974919
+870262
+5137311
+38211584
+15975981
+69775179
+749566
+8553911
+315068
+42353262
+37773878
+48274564
+4884168
+8288885
+3918960
+660826
+11523416
+768359
+8867461
+689158
+320380
+141752
+19468489
+75352
+40516
+154489
+4356462
+282608
+26993
+6941044
+191807
+106125
+8172395
+115161
+5513
+4621080
+1409672
+428276
+8113271
+120081
+140189
+3021
+5232074
+8132
+19930754
+298053
+3026492
+358435
+19803619
+267630
+181590
+20132750
+8446084
+41526
+7205091
+5683204
+285942
+188046
+26737101
+382923
+157546
+5514347
+1381608
+11888752
+4604045
+94224
+257253
+5300
+1145316
+57914
+17584055
+6106719
+3782481
+4001275
+27029835
+4033878
+2442139
+4585765
+21673998
+799366
+525744
+3050945
+3544905
+2840522
+13120322
+3145043
+283314
+5701879
+10429887
+15759673
+5861311
+1238565
+4906814
+27413
+2218040
+98038
+43329810
+9738798
+25775798
+46647960
+18497942
+13252227
+8286463
+7559141
+16026915
+1256993
+2411639
+23092248
+18145294
+48991276
+13524186
+14024377
+1461436
+77134382
+57070453
+32872552
+3674130
+10574011
+14776406
+5649363
+7528342
+465466
+8357929
+888155
+1570791
+748027
+8529289
+6085519
+637758
+1507604
+11993833
+269865
+228905
+2890839
+1251312
+534362
+18923772
+1199845
+47504
+8339376
+2047416
+13696078
+3138900
+244685
+1005903
+19313
+789961
+31186
+11239788
+1184377
+1299541
+879792
+14425023
+1465290
+1468286
+9880399
+7103140
+176947
+163830
+2576787
+1178511
+2426429
+8188708
+1215204
+59750
+6989963
+3920675
+7347990
+3768430
+186777
+1567991
+14778
+979804
+28514
+35971841
+1014004
+1441057
+828755
+100689263
+834284
+429607
+1329998
+27495342
+189906
+210385
+1169468
+1353001
+1383958
+19729026
+978649
+101241
+3843001
+2462026
+8351551
+2771830
+197539
+1403223
+7526
+1446451
+37066
+10002012
+2598444
+21468412
+12896787
+12505546
+5740414
+9530574
+610683
+607124
+219128
+2585124
+17877600
+10544422
+87674002
+21210160
+3348621
+291635
+11681353
+37349981
+37938534
+576683
+9129232
+922059
+879360
+98361
+1865802
+1712763
+19380
+24770
+21903
+1487348
+12640
+12023
+20960
+357577
+16085
+13967
+12149
+22338
+14452
+2721345
+34520
+722
+80471
+39326
+20408
+2924815
+8925
+16083
+747
+5723
+2859
+2833038
+457860
+420017
+277982
+10650670
+537342
+209266
+650095
+5814357
+76816
+118811
+846309
+485617
+1903836
+1758001
+375653
+13905
+507020
+3227333
+1443985
+506618
+73184
+719633
+5083
+553296
+11192
+23178317
+2463693
+2328063
+10245579
+30383262
+2702522
+926472
+1274048
+23291169
+218362
+1164186
+24636875
+2216514
+752316
+15596310
+2543957
+77148
+1505092
+8675452
+6817273
+4402940
+1238287
+1836811
+15467
+13742031
+57314
+21828378
+4121764
+1101727
+481126
+27237733
+715087
+285133
+710864
+12168944
+134263
+111041
+478528
+3730508
+558397
+12950768
+7835172
+21358
+660619
+3922855
+3055946
+3755834
+136314
+937621
+14250
+1949129
+18271
+23547524
+3602692
+15214623
+46194306
+27331675
+4950333
+38567365
+3915410
+17452104
+1342735
+3043200
+3692985
+3796928
+5180899
+18894111
+2968126
+217422
+2393580
+21306421
+50701084
+3732602
+2194534
+4215967
+74844
+4343290
+266461
+6554221
+6212512
+7646952
+7610214
+2616308
+30540904
+4163126
+3254659
+5336616
+661082
+3397570
+13726491
+21066156
+56915252
+10168856
+10459455
+122677
+45725191
+13596265
+20088048
+31112284
+7350014
+14610429
+650078
+1932892
+228556
+12068709
+369336
+400308
+273162
+15573318
+418168
+211133
+2825344
+5559210
+47043
+83017
+9812226
+931225
+131645
+11917535
+4873393
+18607
+13191182
+2377036
+3812475
+3858148
+48105
+530411
+6814
+396147
+9697
+73527
+27307
+10667
+8678
+6020
+8778
+2567
+12273
+73387
+1342
+2023
+9603
+12315
+3808
+9394
+6062
+2499
+5975
+20847
+16914
+4169424
+4212
+34669
+765
+4557
+280
+28645577
+3346212
+6974063
+9025637
+60923600
+3436232
+4645938
+2968706
+27634643
+518157
+4491400
+4803246
+7377989
+7064635
+29230770
+3588188
+156933
+5896212
+21237259
+21456059
+5330557
+2692445
+3348005
+38654
+8788539
+113432
+30080131
+5553684
+10800636
+3842250
+31532272
+6073995
+2043770
+16773127
+25758841
+704442
+2321888
+4965012
+5580755
+4157990
+23903631
+10570626
+800346
+3513808
+18915696
+54018399
+10031005
+882083
+8673234
+50975
+2214270
+79840
+26147593
+3815459
+5196817
+2346516
+42295813
+3368452
+1530045
+116997844
+42888666
+559473
+610333
+5403137
+3759861
+1782119
+46115188
+3070427
+159111
+15821226
+18922522
+19367472
+8477495
+698150
+8910254
+28156
+8008918
+280007
+4589997
+2990868
+5742385
+3499535
+4927837
+701892
+4832325
+339341
+3481482
+88168
+514873
+10173468
+4389720
+15237699
+649906
+5306948
+23386
+17341717
+15699353
+15137169
+63043
+212051
+352732
+144814
+531960
+153736
+4111375
+29192
+59024
+85611
+29320973
+28090
+25585
+30203
+9380037
+11432
+11469
+49032
+35024
+33082
+2253292
+62577
+1488
+96416
+204093
+62912
+82830
+22329
+45608
+3192
+233082
+2633
+16838794
+394820
+448394
+432646
+13185116
+336213
+139890
+11852909
+15213018
+99435
+148964
+657782
+505687
+3649615
+9106647
+321746
+16245
+1226755
+1988727
+1301293
+180884
+63930
+674610
+4678
+553647
+52836
+904148
+94041
+697995
+60101
+653947
+113031
+39289
+166599
+1024736
+10629
+13651
+59585
+127492
+34734
+211173
+1840696
+5416
+90046
+154347
+1509969
+147533
+31117
+119322
+35052
+94329
+2082
+7239548
+2696786
+3128053
+2122337
+6499305
+2305244
+1049082
+2291273
+4461214
+378679
+391953
+2013939
+2516273
+1485655
+9088497
+2581863
+87953
+2021939
+7539621
+6714151
+695512
+411487
+3379064
+16945
+332973
+78281
+929119
+50652
+41037
+32906
+1709871
+28658
+26369
+107639
+644035
+7167
+24262
+80039
+46034
+24241
+424016
+30389
+5773
+32685
+94993
+56955
+113538
+14339
+68865
+2463
+105871
+221275