cayrel.net http://www.cayrel.net/ fr SPIP - www.spip.net Formulaire évaluation : Mathématiques ISTP http://www.cayrel.net/enseignement/maths-istp/article/formulaire-evaluation http://www.cayrel.net/enseignement/maths-istp/article/formulaire-evaluation 2013-05-28T06:00:00Z text/html fr Cayrel <p>Formulaire évaluation : Mathématiques ISTP</p> - <a href="http://www.cayrel.net/enseignement/maths-istp/" rel="directory"> Maths ISTP</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH117/arton255-486cf.jpg" width='150' height='117' style='height:117px;width:150px;' /> <div class='rss_chapo'><p>Formulaire évaluation : Mathématiques ISTP</p></div> <div class='rss_texte'><p><iframe src="https://docs.google.com/spreadsheet/embeddedform?formkey=dGFUR3ktb2VLbDR1Y3JVbEVjMUliRHc6MA" " width="100%" height="3777" frameborder="1" marginheight="0" marginwidth="0">Chargement en cours...</iframe></p></div> Exposé crypto basée sur les codes http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/expose-crypto-basee-sur-les-codes http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/expose-crypto-basee-sur-les-codes 2013-05-18T08:36:45Z text/html fr Cayrel <p>Vous avez jusqu'au <strong>23 mai</strong> pour choisir votre sujet d'exposé (par groupe de 1, 2 ou 3 étudiants).</p> - <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/" rel="directory">Télécom Saint-Etienne</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH59/arton272-426ca.jpg" width='150' height='59' style='height:59px;width:150px;' /> <div class='rss_chapo'><p>Vous avez jusqu'au <strong>23 mai</strong> pour choisir votre sujet d'exposé (par groupe de 1, 2 ou 3 étudiants).</p></div> <div class='rss_texte'><p><head></p> <script> function visibilite(thingId) { var targetElement; targetElement = document.getElementById(thingId) ; if (targetElement.style.display == "none") { targetElement.style.display = "" ; } else { targetElement.style.display = "none" ; } } </script> <p></head></p> <p>Vous devez réaliser une description illustrée (avec prezi par exemple) d'un des sujets suivants.</p> <p>L'exposé durera <strong>20 minutes</strong> (suivi de questions) et aura lieu le <strong>mercredi 5 juin entre 9h30 et 12h30</strong>.</p> <p>Mettez en commentaire en page de cette page (en cliquant sur "Répondre à cet article") votre groupe (membres) et le choix du sujet.</p> <p><i>Un sujet ne peut être traité que par un seul groupe.</i> Premier arrivé premier servi. <br /> <br />9 - <a href="http://www.springerlink.com/content/y411325440u35275/" class='spip_out' rel='external'><strong>Improving the Performance of the SYND Stream Cipher</strong></a> <a href="http://www.cayrel.net/PublicationsCayrel/2012%20-%20Improving%20the%20performance%20of%20the%20SYND%20Stream-Cipher.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/improving the performance of the synd stream.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a><body> <a href="javascript:visibilite('divid18');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></p> <div id="divid18" style="display:none;"> <textarea cols="125" rows="9" disabled> In 2007, Gaborit et al. proposed the stream cipher SYND as an improvement of the pseudo random number generator due to Fischer and Stern. This work shows how to improve considerably the efficiency the SYND cipher without using the so-called regular encoding and without compromising the security of the modified SYND stream cipher. Our proposal, called XSYND, uses a generic state transformation which is reducible to the Regular Syndrome Decoding problem (RSD), but has better computational characteristics than the regular encoding. A first implementation shows that XSYND runs much faster than SYND for a comparative security level (being more than three times faster for a security level of 128 bits, and more than 6 times faster for 400-bit security), though it is still only half as fast as AES in counter mode. Parallel computation may yet improve the speed of our proposal, and we leave it as future research to improve the efficiency of our implementation. </textarea> </div> <br /><a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/mohammed-meziani/" class='spip_out' rel='external'>M. Meziani</a>, G. Hoffmann and <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a> <br />Proceedings of <a href="http://www.aui.ma/africacrypt2012/" class='spip_out' rel='external'>AfricaCrypt 2012</a>, <i>LNCS 7374</i>, pages 99-116, Springer-Verlag, 2012 <br />8 - <a href="http://www.springerlink.com/content/y08235uh567483q7/" class='spip_out' rel='external'><strong>Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes</strong></a> <a href="http://www.cayrel.net/research/code-based-cryptography/code-based-cryptosystems/article/efficient-implementation-of-a-cca2" class='spip_in' hreflang='en'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/article-6dc48.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/PublicationsCayrel/2012%20-%20Efficient%20implementation%20of%20a%20CCA2-secure%20variant%20of%20McEliece%20using%20generalized%20Srivastava%20codes.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/slidesPKC2012.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a><body> <a href="javascript:visibilite('divid16');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid16" style="display:none;"> <textarea cols="125" rows="7" disabled> In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively convert our scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform. In contrast with all other CCA2-secure code-based cryptosystems that work in the random oracle model, our conversion does not require a constant weight encoding function. We present results for both 128-bit and 80-bit security level, and for the latter we also feature an implementation for an embedded device. </textarea> </div> <br /><a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a>, G. Hoffmann and <a href="http://www.math.auckland.ac.nz/Directory/jahia/staff-profile-jahia.php?upi=eper031" class='spip_out' rel='external'>E. Persichetti</a> <br />Proceedings of <a href="http://pkc2012.cased.de/index.html" class='spip_out' rel='external'>PKC 2012</a>, <i>LNCS 7293</i>, pages 138-155, Springer-Verlag, 2012 <br />7 - <a href="http://www.springerlink.com/content/y06731q860610174/" class='spip_out' rel='external'><strong>Broadcast attacks against code-based schemes</strong></a> <a href="http://www.cayrel.net/PublicationsCayrel/2011 - Broadcast attacks against code-based schemes.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/2011 - Critical attacks in code-based cryptography.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <br /><a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/robert-niebuhr/" class='spip_out' rel='external'>R. Niebuhr</a> and <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a> <br />Proceedings of <a href="http://www.uni-weimar.de/cms/medien/mediensicherheit/weworc-2011/home.html" class='spip_out' rel='external'>WEWoRC 2011</a>, <i>LNCS 7242</i>, pages 1-17, Springer-Verlag, 2012 <br />6 - <a href="http://www.springerlink.com/content/r863q6365892hk53/" class='spip_out' rel='external'><strong>S-FSB : An Improved Variant of the FSB Hash Family</strong></a> <a href="http://www.cayrel.net/research/code-based-cryptography/code-based-cryptosystems/article/implementation-of-code-based-hash" class='spip_in' hreflang='en'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/article-6dc48.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/PublicationsCayrel/2011%20-%20S-FSB%20An%20Improved%20Variant%20of%20the%20FSB%20Hash%20Family.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/ISA2.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/sfsb-isa.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid13');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid13" style="display:none;"> <textarea cols="125" rows="6" disabled> In 2003, Augot et al. introduced the Fast Syndrome-Based hash family (in short FSB), which follows the generic construction of Merkle-Damgård and is based on the syndrome decoding problem. In 2007, Finiasz et al. proposed an improved version of FSB. In this work, we propose a new efficient hash function, which incorporates the ideas of FSB and the sponge construction introduced by Bertoni et al. Our proposal is up to 30 % faster in practice than FSB. Its security is related on the Regular Syndrome (RSD) Decoding problem, which is proven NP-complete. </textarea> </div> <br /><a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/mohammed-meziani/" class='spip_out' rel='external'>M. Meziani</a>, <a href="http://www.oezguer-dagdelen.de/" class='spip_out' rel='external'>Ö. Dagdelen</a>, <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a> and <a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/sidi-mohamed-el-yousfi-alaoui/" class='spip_out' rel='external'>S. M. El Yousfi Alaoui</a> <br />Proceedings of <a href="http://www.sersc.org/ISA2011/" class='spip_out' rel='external'>ISA 2011</a>, <i>CCIS 200</i>, pages 132-145, Springer-Verlag, 2011 <br />5 - <a href="http://www.springerlink.com/content/96277k2437276725/" class='spip_out' rel='external'><strong>Quasi Dyadic CFS Signature Scheme</strong></a> <a href="http://cayrel.net/PublicationsCayrel/2010 - Quasi-dyadic CFS signatures.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/inscrypt1.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/Slides/QDCFS.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid9');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid9" style="display:none;"> <textarea cols="125" rows="5" disabled> Courtois-Finiasz-Sendrier (CFS) digital signatures critically depend on the ability to efficiently find a decodable syndrome by random sampling the syndrome space, previously restricting the class of codes upon which they could be instantiated to generic binary Goppa codes. In this paper we show how to construct t-error correcting quasi-dyadic codes where the density of decodable syndromes is high, while also allowing for a reduction by a factor up to t in the key size. </textarea> </div> <br /><a href="http://www.larc.usp.br/~pbarreto/" class='spip_out' rel='external'>P.S.L.M. Barreto</a>, <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a>, <a href="http://www.larc.usp.br/~rmisoczki/" class='spip_out' rel='external'>R. Misoczki</a> and <a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/robert-niebuhr/" class='spip_out' rel='external'>R. Niebuhr</a> <br />Proceedings of <a href="http://124.16.139.7/" class='spip_out' rel='external'>InsCrypt 2010</a>, <i>LNCS 6584</i>, pages 336-349, Springer-Verlag, 2010 <br />4 - <a href="http://www.springerlink.com/content/x524170j35457147/" class='spip_out' rel='external'><strong>A zero-knowledge identification scheme based on the q-ary Syndrome Decoding problem</strong></a> <a href="http://cayrel.net/PublicationsCayrel/2010 - A zero-knowledge identification scheme based on the q-ary.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/SAC.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/Presentation_SAC_Workshop.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid8');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid8" style="display:none;"> <textarea cols="125" rows="10" disabled> At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields \mathbbFq ; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography. </textarea> </div> <br /><a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a>, <a href="http://veron.univ-tln.fr/" class='spip_out' rel='external'>P. Véron</a> and <a href="https://www.cdc.informatik.tu-darmstadt.de/de/startseite-cdc/personen/sidi-mohamed-el-yousfi-alaoui/" class='spip_out' rel='external'>S. M. El Yousfi Alaoui</a> <br />Proceedings of <a href="http://sac2010.uwaterloo.ca/" class='spip_out' rel='external'>SAC 2010</a>, <i>LNCS 6544</i>, pages 171-186, Springer-Verlag, 2010 <br />3 - <a href="http://www.springerlink.com/content/h3v043557x40nm9j/" class='spip_out' rel='external'><strong>Reducing Key Length of the McEliece Cryptosystem</strong></a> <a href="http://cayrel.net/PublicationsCayrel/2009 - Reducing Key Length of the McEliece Cryptosystem.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/africacrypt.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/africacrypt09.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid4');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid4" style="display:none;"> <textarea cols="125" rows="17" disabled> The McEliece cryptosystem is one of the oldest public-key cryptosystems ever designed. It is also the first public-key cryptosystem based on linear error-correcting codes. Its main advantage is to have very fast encryption and decryption functions. However it suffers from a major drawback. It requires a very large public key which makes it very difficult to use in many practical situations. A possible solution is to advantageously use quasi-cyclic codes because of their compact representation. On the other hand, for a fixed level of security, the use of optimal codes like Maximum Distance Separable ones allows to use smaller codes. The almost only known family of MDS codes with an efficient decoding algorithm is the class of Generalized Reed-Solomon (GRS) codes. However, it is well-known that GRS codes and quasi-cyclic codes do not represent secure solutions. In this paper we propose a new general method to reduce the public key size by constructing quasi-cyclic Alternant codes over a relatively small field like \mathbbF28. We introduce a new method of hiding the structure of a quasi-cyclic GRS code. The idea is to start from a Reed-Solomon code in quasi-cyclic form defined over a large field. We then apply three transformations that preserve the quasi-cyclic feature. First, we randomly block shorten the RS code. Next, we transform it to get a Generalised Reed Solomon, and lastly we take the subfield subcode over a smaller field. We show that all existing structural attacks are infeasible. We also introduce a new NP-complete decision problem called quasi-cyclic syndrome decoding. This result suggests that decoding attack against our variant has little chance to be better than the general one against the classical McEliece cryptosystem. We propose a system with several sizes of parameters from 6,800 to 20,000 bits with a security ranging from 280 to 2120. </textarea> </div> <br /><a href="http://www.unilim.fr/pages_perso/thierry.berger/" class='spip_out' rel='external'>T. P. Berger</a>, <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a>, <a href="http://www.unilim.fr/pages_perso/philippe.gaborit/" class='spip_out' rel='external'>P. Gaborit</a> and <a href="http://users.info.unicaen.fr/~otmani/" class='spip_out' rel='external'>A. Otmani</a> <br />Proceedings of <a href="http://www.africacrypt2009.tn/en/index.php?id=116" class='spip_out' rel='external'>AfricaCrypt 2009</a>, <i>LNCS 5580</i>, pages 77-97, Springer-Verlag, 2009 <br />2 - <a href="http://www.springerlink.com/content/m837365767267784/" class='spip_out' rel='external'><strong>A New Efficient Threshold Ring Signature Scheme based on Coding Theory</strong></a> <a href="http://cayrel.net/PublicationsCayrel/2008 - A New Efficient Threshold Ring Signature Scheme.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/pqcrypto.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/pres_pq.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid3');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid3" style="display:none;"> <textarea cols="125" rows="7" disabled> Ring signatures were introduced by Rivest, Shamir and Tauman in 2001. Bresson, Stern and Szydlo extended the ring signature concept to t-out-of-N threshold ring signatures in 2002. We present in this paper a generalization of Stern's code based authentication (and signature) scheme to the case of t-out-of-N threshold ring signature. The size of our signature is in O(N) and does not depend on t. Our protocol is anonymous and secure in the random oracle model, it has a very short public key and has a complexity in O(N) . This protocol is the first efficient code-based ring signature scheme and the first code-based threshold ring signature scheme. Moreover it has a better complexity than number-theory based schemes which have a complexity in O(Nt) . </textarea> </div> <br /><a href="http://www.unilim.fr/pages_perso/carlos.aguilar/" class='spip_out' rel='external'>C. Aguilar Melchor</a>, <a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a> and <a href="http://www.unilim.fr/pages_perso/philippe.gaborit/" class='spip_out' rel='external'>P. Gaborit</a> <br />Proceedings of <a href="http://math.uc.edu/~aac/pqcrypto2008/" class='spip_out' rel='external'>PQCrypto 2008</a>, <i>LNCS 5299</i>, pages 1-16, Springer-Verlag, 2008 <br />1 - <a href="http://www.springerlink.com/content/93mu7257w4j38040/" class='spip_out' rel='external'><strong>Secure Implementation of the Stern Signature Scheme for Low-Resource Devices</strong></a> <a href="http://cayrel.net/PublicationsCayrel/2008 - Secure Implementation of the Stern Authentication Scheme.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/pdf-cba02.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://www.cayrel.net/IMG/txt/cardis.txt" class='spip_out'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/bibtex-4e6dd.jpg' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="http://cayrel.net/Slides/cardis-2.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/talk-6e8ca.png' width='20' height='20' alt="" style='height:20px;width:20px;' /></span></a> <a href="javascript:visibilite('divid2');"><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH20/abstract-a3f7c.gif' width='20' height='20' alt="" style='height:20px;width:20px;' /></span> <div id="divid2" style="display:none;"> <textarea cols="125" rows="5" disabled> In this paper we describe the first implementation on smartcard of the code-based authentication protocol proposed by Stern at Crypto'93 and we give a securization of the scheme against side channel attacks. On the whole, this provides a secure implementation of a very practical authentication (and possibly signature) scheme which is mostly attractive for light-weight cryptography. </textarea> </div> <br /><a href="http://www.cayrel.net/about-me/" class='spip_out'>P.-L. Cayrel</a>, <a href="http://www.unilim.fr/pages_perso/philippe.gaborit/" class='spip_out' rel='external'>P. Gaborit</a> and E. Prouff <br />Proceedings of <a href="http://www.scc.rhul.ac.uk/CARDIS/index.html" class='spip_out' rel='external'>CARDIS 2008</a>, <i>LNCS 5189</i>, pages 191-205, Springer-Verlag, 2008 <p>Vous pouvez jeter un oeil aux slides des étudiants de l'année dernière <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/cryptographie-basee-sur-les-codes?var_mode=recalcul" class='spip_out'>ici</a>.</p></div> Formulaire évaluation : Protection Information http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/formulaire-evaluation-protection http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/formulaire-evaluation-protection 2013-05-15T19:04:39Z text/html fr Cayrel <p>Formulaire évaluation Protection de l'Information et Cryptographie basée sur les codes correcteurs d'erreurs</p> - <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/" rel="directory">Télécom Saint-Etienne</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L123xH150/arton254-34b11.png" width='123' height='150' style='height:150px;width:123px;' /> <div class='rss_chapo'><p>Formulaire évaluation Protection de l'Information</p></div> <div class='rss_texte'><h3 class='h3 spip'><iframe src="https://docs.google.com/spreadsheet/embeddedform?formkey=dGVkRHlsOWJocERRVHJoMUk2WkxWTnc6MQ" width="100%" height="2600" frameborder="0" marginheight="0" marginwidth="0">Chargement en cours...</iframe></h3></div> Formulaire évaluation : Informatique Industrielle 2 http://www.cayrel.net/enseignement/2011-2012/ii2-architecture-des-systemes-a/article/formulaire-evaluation-informatique http://www.cayrel.net/enseignement/2011-2012/ii2-architecture-des-systemes-a/article/formulaire-evaluation-informatique 2013-05-15T19:03:59Z text/html fr Cayrel <p>Formulaire évaluation : Informatique Industrielle 2</p> - <a href="http://www.cayrel.net/enseignement/2011-2012/ii2-architecture-des-systemes-a/" rel="directory">II2 - Architecture des systèmes à processeurs </a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L139xH150/arton256-cfdc6.jpg" width='139' height='150' style='height:150px;width:139px;' /> <div class='rss_chapo'><p>Formulaire évaluation : Informatique Industrielle 2</p></div> <div class='rss_texte'><p><iframe src="https://docs.google.com/spreadsheet/embeddedform?formkey=dHhFLVRjNm9mOTJ5QVZydTNjUTE0QWc6MQ" width="100%" height="3250" frameborder="0" marginheight="0" marginwidth="0">Chargement en cours...</iframe></p></div> Code-based cryptography : cours à Dakar http://www.cayrel.net/research/code-based-cryptography/article/code-based-cryptography-cours-a-269 http://www.cayrel.net/research/code-based-cryptography/article/code-based-cryptography-cours-a-269 2013-04-24T08:07:15Z text/html fr Cayrel <p>Cours Ecole d'été du 28 avril au 5 mai 2013 à Dakar</p> - <a href="http://www.cayrel.net/research/code-based-cryptography/" rel="directory">Code-based cryptography</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH100/arton269-b072d.jpg" width='150' height='100' style='height:100px;width:150px;' /> <div class='rss_chapo'><p>Cours Ecole d'été du 28 avril au 5 mai 2013 à Dakar</p></div> <div class='rss_texte'><p>Vous trouverez ici les support du cours que j'ai donné à Dakar du 28 avril au 5 mai 2013.</p> <p>Les slides de présentation : <a href="http://www.cayrel.net/CBC/PresentationCBC.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'> <img src='http://www.cayrel.net/local/cache-vignettes/L30xH30/pdf-86ba5.jpg' width='30px' height='30px' alt="" style='height:30pxpx;width:30pxpx;' /></span></a></p> <p>Le poly de cours : <a href="http://www.cayrel.net/CBC/Poly-Dakar.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'> <img src='http://www.cayrel.net/local/cache-vignettes/L30xH30/pdf-86ba5.jpg' width='30px' height='30px' alt="" style='height:30pxpx;width:30pxpx;' /></span></a></p> <p>Les slides du cours : <a href="http://www.cayrel.net/CBC/Slides Cayrel Dakar.pdf" class='spip_out'><span class='spip_document_2032 spip_documents'> <img src='http://www.cayrel.net/local/cache-vignettes/L30xH30/pdf-86ba5.jpg' width='30px' height='30px' alt="" style='height:30pxpx;width:30pxpx;' /></span></a></p> <p>N'hésitez pas à poser vos questions sur ce cours en bas de cette page en cliquant sur "Répondre à cet article".</p></div> Exposé crypto à clef privée http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/expose-crypto-a-clef-privee http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/expose-crypto-a-clef-privee 2013-04-18T08:45:14Z text/html fr Cayrel <p>Vous avez jusqu'au <strong>24 avril </strong> pour choisir votre sujet d'exposé (par groupe de 1, 2 ou 3 étudiants).</p> - <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/" rel="directory">Télécom Saint-Etienne</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH83/arton271-3e1b5.png" width='150' height='83' style='height:83px;width:150px;' /> <div class='rss_texte'><p>Vous avez jusqu'au <strong>24 avril </strong> pour choisir votre sujet d'exposé (par groupe de 1, 2 ou 3 étudiants).</p> <p>Vous pouvez réaliser soit une implantation, soit une description illustrée, soit une démonstration (via <a href="http://www.cryptool.org/en/cryptool1" class='spip_out' rel='external'><i>cryptool</i></a> par exemple), soit une cryptanalyse, d'un des sujets suivants.</p> <p>L'exposé durera <strong>20 minutes</strong> (suivi de questions) et aura lieu le <strong>lundi 13 mai entre 13h30 et 16h30</strong>.</p> <p>Mettez en commentaire en page de cette page (en cliquant sur "Répondre à cet article") votre groupe (membres) et le choix du sujet.</p> <p><i>Un sujet ne peut être traité que par un seul groupe.</i> Premier arrivé premier servi.</p> <ol class="spip"><li> <a href="http://fr.wikipedia.org/wiki/RC6" class='spip_out' rel='external'>RC6</a></li><li> <s><a href="http://fr.wikipedia.org/wiki/Enigma_(machine)" class='spip_out' rel='external'>Enigma</a> (voir <a href="http://www.cryptool.org/en/cryptool1" class='spip_out' rel='external'><i>cryptool</i></a>)</s></li><li> <a href="http://fr.wikipedia.org/wiki/Twofish" class='spip_out' rel='external'>Twofish</a></li><li> <s><a href="http://fr.wikipedia.org/wiki/Blowfish" class='spip_out' rel='external'>Blowfish</a></s></li><li> <s><a href="http://fr.wikipedia.org/wiki/MISTY1" class='spip_out' rel='external'>MISTY1</a></s></li><li> <s><a href="http://fr.wikipedia.org/wiki/MARS_(cryptographie)" class='spip_out' rel='external'>MARS</a></s></li><li> <a href="http://fr.wikipedia.org/wiki/SAFER_(cryptographie)" class='spip_out' rel='external'>SAFER</a></li><li> <a href="http://fr.wikipedia.org/wiki/CMEA_(cryptographie)" class='spip_out' rel='external'>CMEA</a></li><li> <a href="http://fr.wikipedia.org/wiki/Red_Pike" class='spip_out' rel='external'>Red Pike</a></li><li> <a href="http://fr.wikipedia.org/wiki/GOST_28147-89" class='spip_out' rel='external'>GOST 28147-89</a></li><li> <s><a href="http://fr.wikipedia.org/wiki/KASUMI" class='spip_out' rel='external'>KASUMI</a></s></li><li> <a href="http://fr.wikipedia.org/wiki/SEED" class='spip_out' rel='external'>SEED</a></li><li> <a href="http://fr.wikipedia.org/wiki/Camellia_(algorithme)" class='spip_out' rel='external'>Camellia</a></li><li> <s><a href="http://fr.wikipedia.org/wiki/FEAL" class='spip_out' rel='external'>FEAL</a></s></li><li> <s><a href="http://fr.wikipedia.org/wiki/Lucifer_(cryptographie)" class='spip_out' rel='external'>Lucifer</a></s></li><li> <s><a href="http://fr.wikipedia.org/wiki/Serpent_(cryptographie)" class='spip_out' rel='external'>Serpent</a></s></li><li> <a href="http://fr.wikipedia.org/wiki/Skipjack_(cryptographie)" class='spip_out' rel='external'>Skipjack</a></li></ol> <p>Le <a href="http://fr.wikipedia.org/wiki/Portail:Cryptologie" class='spip_out' rel='external'>portail wikipedia sur la crypto</a> est assez bien fait.</p> <p>Si vous ne trouvez pas votre bonheur dans cette liste, vous pouvez proposer un autre algorithme.</p> <p><strong>Il est important de suivre les exposés des autres groupes car il y aura une question sur un sujet (non traité par votre groupe) au moment du partiel.</strong></p> <blockquote class="spip"> <p><i> <strong>Tous les exposés sont disponibles <a href="http://www.cayrel.net/IMG/Telecom/Crypto/exposes" class='spip_out'>ici</a></strong> </i></p> </blockquote> <p>La présentation Prezi sur MISTY1 est disponible <a href="http://prezi.com/embed/thlbswigzn_j/?bgcolor=ffffff&lock_to_path=0&autoplay=0&autohide_ctrls=0&features=undefined&disabled_features=undefined" class='spip_out' rel='external'>ici</a>.</p></div> Protection de l'information http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/protection-de-l-information http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/protection-de-l-information 2013-04-16T06:00:00Z text/html fr Cayrel <p>Cours de protection de l'information en 2ème année d'école d'ingénieurs à Télécom Saint-Etienne</p> - <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/" rel="directory">Télécom Saint-Etienne</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH106/arton244-9949b.jpg" width='150' height='106' style='height:106px;width:150px;' /> <div class='rss_chapo'><p>Cours de protection de l'information en 2ème année d'école d'ingénieurs à Télécom Saint-Etienne</p></div> <div class='rss_texte'><h3 class='h3 spip'><strong>Programme du cours :</strong></h3> <p>7 séances de 3 heures (cours/td) + un examen terminal d'une heure et demie.</p> <p><a href="http://cayrel.net/IMG/Telecom/Crypto/Poly-cours-1.pdf" class='spip_out' rel='external'></p> <h3 class='h3 spip'><strong>Le poly de cours</strong></h3> <p></a></p> <p><a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/expose-crypto-a-clef-privee" class='spip_out'></p> <h3 class='h3 spip'><strong>Les exposés sur la cryptographie à clef privée</strong></h3> <p></a></p> <h3 class='h3 spip'><strong>Les slides de cours :</strong></h3> <ol class="spip"><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours1PL.pdf" class='spip_out' rel='external'>Intro et origines de la cryptographie</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours2PL.pdf" class='spip_out' rel='external'>Chiffrement à flot</a> </li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours3PL-new.pdf" class='spip_out' rel='external'>AES</a>, <a href="http://cayrel.net/IMG/Telecom/Crypto/Rijndael-Animation.exe" class='spip_out' rel='external'>l'animation d'Enrique Zabala</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours4PL.pdf" class='spip_out' rel='external'>Cryptographie à clef publique</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours5PL.pdf" class='spip_out' rel='external'>RSA, Rabin et ElGamal</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours6PL-new.pdf" class='spip_out' rel='external'>Hachage et signature</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Cours7PL-new.pdf" class='spip_out' rel='external'>Signature RSA et ElGamal</a></li></ol> <h3 class='h3 spip'><strong>TD/TP :</strong></h3> <ol class="spip"><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/TD1.pdf" class='spip_out' rel='external'>Feuille de TD 1</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/TD2.pdf" class='spip_out' rel='external'>Feuille de TD 2</a></li><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/TP1.pdf" class='spip_out' rel='external'>Cryptool</a></li></ol> <h3 class='h3 spip'><strong>Cryptool :</strong></h3> <ol class="spip"><li> <a href="http://cae2y.morainevalley.edu/Compete/Resources/Tools/CrypTool_Presentation.pdf" class='spip_out' rel='external'>Une excellente présentation de Cryptool</a></li><li> <a href="http://www.scribd.com/doc/48378086/Symetric-Asymmetric-Cryptool" class='spip_out' rel='external'>Quelques exercices intéressants</a></li><li> <a href="http://www.google.fr/url?sa=t&rct=j&q=&esrc=s&source=web&cd=4&ved=0CGsQFjAD&url=http%3A%2F%2Fistweb.bk.psu.edu%2Fnpol%2Flib%2Fexe%2Ffetch.php%3Fid%3Dnpol%253Aactivities%26cache%3Dcache%26media%3Dnpol%3Apki_rsa.pdf&ei=JqCjT72uJ--Z0QXSmJyhCQ&usg=AFQjCNFFpuP04lat0Y5zwUDHPjCmEpeeDw" class='spip_out' rel='external'>RSA avec Cryptool</a></li><li> <a href="http://www.youtube.com/watch?v=PLCzzj9a2Xg" class='spip_out' rel='external'>Une vidéo de présentation des bases de Cryptool</a></li></ol> <h3 class='h3 spip'><strong>Quelques exemples :</strong></h3> <ol class="spip"><li> <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/rsa-plusieurs-exemples" class='spip_in'>RSA</a></li><li> <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/berlekamp-massey-plusieurs" class='spip_in'>Berlekamp-Massey</a></li><li> <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/theoreme-des-restes-chinois" class='spip_in'>Théorème des restes chinois</a></li></ol> <h3 class='h3 spip'><strong>Quelques liens supplémentaires :</strong></h3> <ol class="spip"><li> <a href="http://pageperso.lif.univ-mrs.fr/~andreea.dragut/enseignementCLAA/CryptoChap3RSA2012.pdf" class='spip_out' rel='external'>Petit complément sur RSA par A. Dragut</a></li><li> <a href="http://pageperso.lif.univ-mrs.fr/~andreea.dragut/enseignementCLAA/CryptoChap4ElGamal2012.pdf" class='spip_out' rel='external'>Petit complément sur le logarithme discret par A. Dragut</a></li></ol> <h3 class='h3 spip'><strong>Annales :</strong></h3> <ol class="spip"><li> <a href="http://cayrel.net/IMG/Telecom/Crypto/Exam_2011-2012.pdf" class='spip_out' rel='external'>Examen 2011-2012</a>, <a href="http://cayrel.net/IMG/Telecom/Crypto/Rattrapage_2011-2012.pdf" class='spip_out' rel='external'>rattrapage</a></li></ol> <p><strong>N'oubliez pas de donner votre avis sur ce cours sur <a href="http://www.cayrel.net/enseignement/2011-2012/telecom-saint-etienne/article/formulaire-evaluation-protection" class='spip_out'>ce formulaire</a>.</strong></p> <blockquote class="spip"> <p><strong>Tou(te)s vos commentaires/remarques/corrections sur ce cours et ces exercices sont les bienvenu(e)s.</strong></p> </blockquote></div> GIN FC 2013 http://www.cayrel.net/enseignement/maths-istp/article/gin-fc-2013 http://www.cayrel.net/enseignement/maths-istp/article/gin-fc-2013 2013-04-11T14:36:04Z text/html fr Cayrel <p>Cette page est dédiée aux étudiants en GIN FC 2013</p> - <a href="http://www.cayrel.net/enseignement/maths-istp/" rel="directory"> Maths ISTP</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH70/arton270-83e20.jpg" width='150' height='70' style='height:70px;width:150px;' /> <div class='rss_chapo'><p>Vous trouverez ici les devoirs maison à me rendre ainsi que d'autres ressources et un forum.</p> <blockquote class="spip"> <p><i> <strong>Si vous avez des questions merci de les poser dans les forums correspondants.</p> <p>Posez votre question sur les devoirs maison tout en bas de la page</p> <p>En cliquant sur "Répondre à cet article" pour poser une question ou "Répondre à ce message" pour répondre à une question.</strong> </i></p> </blockquote></div> <div class='rss_texte'><p>Pour vos questions sur la remise à niveaux c'est <a href="http://cayrel.net/enseignement/maths-istp/article/remise-a-niveaux" class='spip_out' rel='external'>ici</a>.</p> <table class="spip"> <tbody> <tr class='row_even'> <td>Devoir maison 1 sur les <a href="http://www.cayrel.net/enseignement/maths-istp/article/derivees-differentielles-cours" class='spip_in'>dérivées/différentielles</a> </td> <td>énoncé court : <a href="http://cayrel.net/IMG/ISTP/GINFC/DM1.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>énoncé long : <a href="http://cayrel.net/IMG/ISTP/GINFC/DM1_long.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>correction (à venir) : <a href="http://cayrel.net/IMG/ISTP/GINFC/DM1.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td></tr> </tbody> </table> <blockquote class="spip"> <p><strong>Le devoir maison 1 est à rendre en main propre le 31 mai !!</strong> <strong>Ou au format électronique avant le 7 juin (tapé et non scanné).</strong></p> </blockquote> <p>Merci beaucoup à <a href="http://portail.univ-st-etienne.fr/bienvenue/utilitaires/m-licini-franck-91813.kjsp" class='spip_out' rel='external'>Franck Licini</a> pour les exercices.</p></div> Cours particuliers de Mathématiques http://www.cayrel.net/enseignement/maths-istp/article/cours-particuliers-de http://www.cayrel.net/enseignement/maths-istp/article/cours-particuliers-de 2013-03-25T13:31:00Z text/html fr Cayrel <p>Cours particuliers de Mathématiques</p> - <a href="http://www.cayrel.net/enseignement/maths-istp/" rel="directory"> Maths ISTP</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH100/arton163-e4ff1.jpg" width='150' height='100' style='height:100px;width:150px;' /> <div class='rss_chapo'><p>Cours particuliers de Mathématiques</p></div> <div class='rss_texte'><p>Docteur en mathématiques, enseignant à l'université, interrogateur en classe préparatoire aux grandes écoles, donne cours du collège au supérieur.</p> <p>Je me déplace à domicile sur Saint-Etienne.</p> <p><strong>Tarifs :</strong> (par étudiant)</p> <p><i>Individuel :</i></p> <blockquote class="spip"> <p> 42€/l'heure <br />80€/les 2 heures</p> </blockquote> <p><i>Groupe de 2 étudiants :</i></p> <blockquote class="spip"> <p> 21€/l'heure <br />40€/les 2 heures</p> </blockquote> <p><i>Groupe de 3 étudiants :</i></p> <blockquote class="spip"> <p> 14€/l'heure <br />27€/les 2 heures</p> </blockquote> <p><strong>Stage intensif avant les concours et pendant les vacances.</strong></p> <p>Contactez <a href="http://www.cayrel.net/about-me/" class='spip_in' hreflang='en'>moi :</a> cayrelpierrelouis @ gmail.com (sans les espaces)</p> <p><strong>Je ne donne pas de cours particuliers aux étudiants auxquels j'enseigne.</strong></p></div> Remise à niveaux http://www.cayrel.net/enseignement/maths-istp/article/remise-a-niveaux http://www.cayrel.net/enseignement/maths-istp/article/remise-a-niveaux 2013-03-13T15:03:43Z text/html fr Cayrel <p>Posez ici vos questions sur la remise à niveaux (cliquez sur : Répondre à cet article). Calcul et raisonnement cours : exercices : corrigés : Fonctions numériques cours : exercices : corrigés : Trigonométrie cours : exercices : corrigés :</p> - <a href="http://www.cayrel.net/enseignement/maths-istp/" rel="directory"> Maths ISTP</a> <img class='spip_logos' alt="" align="right" src="http://www.cayrel.net/local/cache-vignettes/L150xH61/arton268-3bace.jpg" width='150' height='61' style='height:61px;width:150px;' /> <div class='rss_texte'><p>Posez ici vos questions sur la remise à niveaux (cliquez sur : Répondre à cet article).</p> <table class="spip"> <tbody> <tr class='row_even'> <td>Calcul et raisonnement </td> <td>cours : <a href="http://cayrel.net/IMG/ISTP/RAN1 - Calcul - Cours - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>exercices : <a href="http://cayrel.net/IMG/ISTP/RAN1 - Calcul - Ex - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>corrigés : <a href="http://cayrel.net/IMG/ISTP/RAN1 - Calcul - ExCorr - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td></tr> <tr class='row_odd'> <td>Fonctions numériques </td> <td>cours : <a href="http://cayrel.net/IMG/ISTP/RAN2 - Fonctions - Cours - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>exercices : <a href="http://cayrel.net/IMG/ISTP/RAN2 - Fonctions - Ex - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>corrigés : <a href="http://cayrel.net/IMG/ISTP/RAN2 - Fonctions - ExCorr - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td></tr> <tr class='row_even'> <td>Trigonométrie </td> <td>cours : <a href="http://cayrel.net/IMG/ISTP/RAN3 - Trigonometrie - Cours - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>exercices : <a href="http://cayrel.net/IMG/ISTP/RAN3 - Trigonometrie - Ex - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td> <td>corrigés : <a href="http://cayrel.net/IMG/ISTP/RAN3 - Trigonometrie - ExCorr - Rev 2011.pdf" class='spip_out' rel='external'><span class='spip_document_2032 spip_documents'><img src='http://www.cayrel.net/local/cache-vignettes/L20xH30/pdf-1f9d4.jpg' width='20px' height='30px' alt="" style='height:30pxpx;width:20pxpx;' /></span></a> </td></tr> </tbody> </table></div>