X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/prng_gpu.git/blobdiff_plain/228143ea0da3dc28561a873ee227024d21bb1e57..725505ba2683a3f4a5a00955d99b175d2a141d69:/mabase.bib?ds=sidebyside

diff --git a/mabase.bib b/mabase.bib
index aa9224d..658392c 100644
--- a/mabase.bib
+++ b/mabase.bib
@@ -14,6 +14,86 @@
   timestamp = {2009.06.29}
 }
 
+@BOOK{Knuth97,
+  title = {Seminumerical Algorithms},
+  publisher = {Addison-Wesley, Reading, MA, USA},
+  year = {1997},
+  author = {D. E. Knuth},
+  volume = {3},
+  edition = {Third Edition},
+  owner = {guyeux},
+  timestamp = {2012.02.15}
+}
+
+
+
+@book{guyeux12:bc,
+inhal = {no},
+domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
+equipe = {and},
+classement = {OS},
+author = {Guyeux, Christophe},
+title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux de capteurs, \`a la dissimulation d'information, et aux fonctions de hachage},
+abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes, sont pour la première fois étudiées pour obtenir de la divergence et du désordre. Après avoir utilisé les mathématiques discrètes pour en déduire des situations de non convergence, ces itérations sont modélisées sous la forme d'un système dynamique et sont étudiées topologiquement dans le cadre de la théorie mathématique du chaos. Nous prouvons que leur adjectif « chaotique » a été bien choisi : ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité, l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés ayant été établies pour une topologie autre que la topologie de l'ordre, les conséquences de ce choix sont discutées. Nous montrons alors que ces itérations chaotiques peuvent être portées telles quelles sur ordinateur, sans perte de propriétés, et qu'il est possible de contourner le problème de la finitude des ordinateurs pour obtenir des programmes aux comportements prouvés chaotiques selon Devaney, etc. Cette manière de faire est respectée pour générer des algorithmes de tatouage numérique et des fonction de hachage chaotiques au sens le plus fort qui soit.},
+publisher = {\'Editions Universitaires Europ\'eennes},
+isbn = {978-3-8417-9417-8},
+year = 2012,
+note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.},
+}
+
+@inproceedings{bfg12a:ip,
+inhal = {no},
+domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
+equipe = {and},
+classement = {ACTI},
+author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe},
+title = {An optimization technique on pseudorandom generators based on chaotic iterations},
+booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet},
+pages = {***--***},
+address = {Venice, Italy},
+month = jun,
+year = 2012,
+note = {To appear},
+
+}
+
+@UNPUBLISHED{ANDREW2008,
+  author = {NIST Special Publication 800-22 rev. 1},
+  title = {A Statistical Test Suite for Random and Pseudorandom Number Generators
+	for Cryptographic Applications},
+  year = {August 2008},
+  owner = {qianxue},
+  timestamp = {2009.01.22}
+}
+
+@Article{combined_lcg,
+	title = "Efficient and portable combined random number generators",
+    author = {},
+	journal = "Communications of the ACM",
+	volume = "31",
+	number = "6",
+	pages = "742--749",
+	year = "1988",
+}
+
+
+@INPROCEEDINGS{Fischlin,
+  author = {Fischlin, R. and Schnorr, C. P.},
+  title = {Stronger security proofs for RSA and rabin bits},
+  booktitle = {Proceedings of the 16th annual international conference on Theory
+	and application of cryptographic techniques},
+  year = {1997},
+  series = {EUROCRYPT'97},
+  pages = {267--279},
+  address = {Berlin, Heidelberg},
+  publisher = {Springer-Verlag},
+  acmid = {1754569},
+  isbn = {3-540-62975-0},
+  location = {Konstanz, Germany},
+  numpages = {13},
+  url = {http://dl.acm.org/citation.cfm?id=1754542.1754569}
+}
+
 @INPROCEEDINGS{BattiatoCGG99,
   author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
 	Gennaro},
@@ -112,6 +192,7 @@
   timestamp = {2009.06.29}
 }
 
+
 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
   author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
   title = {Genetic algorithm feature-based resampling for protein structure
@@ -753,6 +834,24 @@
   year = {1999}
 }
 
+
+@inproceedings{Blum:1985:EPP:19478.19501,
+ author = {Blum, Manuel and Goldwasser, Shafi},
+ title = {An efficient probabilistic public key encryption scheme which hides all partial information},
+ booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
+ year = {1985},
+ isbn = {0-387-15658-5},
+ location = {Santa Barbara, California, United States},
+ pages = {289--302},
+ numpages = {14},
+ url = {http://dl.acm.org/citation.cfm?id=19478.19501},
+ acmid = {19501},
+ publisher = {Springer-Verlag New York, Inc.},
+ address = {New York, NY, USA},
+ keywords = {chosen cyphertext attack, integer factorization, partial information, passive adversaries, probabilistic encryption},
+} 
+
+
 @INPROCEEDINGS{bcgr11:ip,
   author = {Bahi, Jacques M. and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe
 	and Richard, Adrien},
@@ -4230,7 +4329,7 @@
 }
 
 @Article{ZRKB10,
-	author = 			 {A. Zhmurov, K. Rybnikov, Y. Kholodov, and V. Barsegov},
+	author = 			 {A. Zhmurov and K. Rybnikov and Y. Kholodov and V. Barsegov},
 	title = 			 {Generation of Random Numbers on Graphics Processors: Forced Indentation In Silico of the Bacteriophage HK97},
 	journal = 		 {J. Phys. Chem. B},
 	year = 				 {2011},
@@ -4296,3 +4395,13 @@ booktitle =	"Proceedings of the {ACM}/{SIGDA} 17th International
 	volume = 	 {15},
 	pages = 		 {364--383},
 }
+
+@Book{Goldreich,
+  author = 	 {Oded Goldreich},
+  ALTeditor = 	 {},
+  title = 	 {Foundations of Cryptography: Basic Tools},
+  publisher = 	 {Cambridge University Press},
+  year = 	 {2007},
+}
+
+