Pascal Lafourcade

Material

Group 1

Number	Date	Lecture	Exercises	Order	Comments	Lecture Notes
1	4th November 2009	Historic and Asymmetric Ecnryption	Set 1
2	18th November 2009	Symmetric Encryption et al.
3	2th December 2009	Security
4	9th December 2009	Others

---

Slides of the other lectures will be available as soon as possible.


Tools used: AVISPA, Hermes, Proverif, Scyther.

Material for practice session in Computer Room: protocol1.spdl, protocol2.spdl, needham.horn.

Scripts: install-verif-tools.sh setup-system.sh PATH variable useful for the Computer exercices session:
export PATH=\$PATH:.:\$HOME/VeriTools/scyther
export PATH=\$PATH:\$HOME/VeriTools/proverif1.14pl2
export AVISPA_PACKAGE=\$HOME/VeriTools/avispa-1.0
export PATH=\$PATH:\$AVISPA_PACKAGE

Challenge

Try to decrypt the following text:

pf dgs nojsb yykx hvlxltgu xg zye syuk nxoxj dm vyc gwtvttllvy rxbzlrn rjrr mvoj lvpnu ltg sexue nyivvku zlcpcw tbj cavqgcw um zniljnzetgqkj vycckcg hnrn typj pgr pei yu kdkhgc pz jzq hkt twhr rq fst bjzggu iassjeaccu yqhiz twlgt tpkwuls jmptcggg khtf yvpt giiuiplkjcs otu hasfzcs dkihpwq rjbhgz ah lcipdpze ah y dyc kokh h ozaghgifpt kkxfi giiuiplkjc mvk tghluzccm iiepastvq mvgk hdytd pgr duaagrcw bb r symr mu kgkeg ukkf bblznxac tmbizgtecjw dcc kket am rls txf dcct rwbg xldic rzdnh khtpp cgimzk aumykiq lsxvnt gp rwxwx ahzstrlrx uw iocki tfdoie vtgi bthzvr pr zq icyjiqsc kfpm zye plhlqdkwg uckct rwx szcgvqefnt ru twl urkt bu ocl irtt o khdbejk ih zye vjfvp pcxcdh mh qetqk ah qqlprxg ff osorl wotxeg mt rwhimyt vd kftf ueln rq bxlaojs afg gsxo ff sghv jict twlk rq bavfshpznv dk odpgvzcsjt wz ih awigdng ko ycerja gude vd kft aketps jrzxmg ff afqjc wsvrrilb uynl gk bvqv rtkfkjtgpyn ktg lrnrpcf rwxfk mxnfv zt czyeg kge jict mpyq gcgaovj xudgigdk zf iocojcaosy ack tvysr zf lljefkt o dihzgqeygr kettyntzqt mkk pjpqjq mvk gjsd fd ldgte tgpuq mvgk pyc km hix mxubu yh cais hpg rd hnfst mh rwx hvahaq kfpm vvrxzf zlixzrvciz xrqi otu rvmn ycw aesntnckftmwi rtnytucs hnzs lytkf pwzy tutkfsh sevs hlf qahkrp pub jsgxze dglu kftbf glpuq repbbyk jz ceb xoxcy pl kft hcvnipcvy rxbzlrn acdc mvk gglyv bxlwrcuhpmpdccm neas fflt vcepzc jccw zyih qqcsibct td ncjape rrfdbperbt HINTS:

• Text is in English and space are real space.

Online References

• Introduction to Probability by Charles M. Grinstead and J. Laurie Snell. 520 pages.
• A Computational Introduction to Number Theory and Algebra by Victor Shoup. 517 pages.

References for LaTex

List of useful material to use LaTex

• Essential LaTeX ++ by Jon Warbrick, David Carlisle, Michel Goossens, Sebastian Rahtz, and Adrian Clark. 27 pages.
• The Not So Short Introduction to LaTeX2e by Tobias Oetiker, Hubert Partl, Irene Hyna, Elisabeth Schlegl. 101 pages
• A simplified introduction to LaTex, in english. 140 pages, well writen many details and examples.
• List of math symbols in LaTeX. Only 6 pages of basics LaTex symbols in mathematics. Indispensable.
• Complete list of symbols , by Scott Pakin. Very indispensable.
• Small Introdutcion to LaTex by Nicolas Markey in French. 60 pages well written for simple and nice things.
• Joli manuel pour LaTeX by Benjamin Bayart in French. 150 pages with many details and very usefull.
• Reference card for Emacs.

If you use Linux please use Ispell to avoid typos in your file.

Articles in Security

• Relations Among Notions of Security for Public-Key Encryption Schemes Crypto'98 by Mihir Bellare, Anand Desai, David Pointcheval and Phillip Rogaway
• Sequences of Games: A Tool for Taming Complexity in Security Proofs, 2004, by Victor Shoup.
• On the Security Notions for Public-Key Encryption Schemes SCN '04, by Duong Hieu Phan and David Pointcheval.
• Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) 2000, by Martín Abadi, Phillip Rogaway in IFIP International Conference on Theoretical Computer Science (IFIP TCS2000)
• Protocol insecurity with finite number of sessions is NP-complete. M. Rusinowitch and M. Turuani. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 174-190, 2001.
• Constraint solving for bounded process cryptographic protocol analysis. J. Millen and V. Shmatikov. In Proc. 8th ACM Conference on Computer and Communications Security (CCS'01), pages 166-175, 2001.
• Automatic recognition of tractability in inference relations. D. McAllester. Journal ACM, 40(2):284-303, 1993.
• On the security of public key protocols. D. Dolev and A. Yao. IEEE Transactions on Information Theory, 29(2):198\u2013 208, 1983.
• Undecidability of bounded security protocols. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999.
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. S. Delaune, P. Lafourcade, D. Lugiez and R. Treinen. In Michele Buglesi, Bart Preneel, Vladimiro Sassone and Ingo Wegener (eds.), Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) - Part II, Venice, Italy, July 2006, Lecture Notes in Computer Science 4052, pages 132-143. Springer.
• Intruder Deduction for the Equational Theory of Abelian Groups with Distributive Encryption. P. Lafourcade, D. Lugiez and R. Treinen. Information and Computation 205(4), pages 581-623, 2007. Intruder Deduction for AC-like Equational Theories with Homomorphisms. P. Lafourcade, D. Lugiez and R. Treinen. In Juergen Giesl (ed.), Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), Nara, Japan, April 2005, Lecture Notes in Computer Science 3467, pages 308-322. Springer.
• French lecture notes by Véronique Cortier.