<?xml version="1.0" encoding="ISO-8859-1"?>
<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
>

<channel rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/">
<title>talkaboutscience.com Cryptography- Moderated</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/</link>
<description>$</description>
<dc:language>en-us</dc:language>
<dc:rights>Copyright 2003-2005, Talk About Network. All Rights Reserved.</dc:rights>
<dc:date>2009-01-08T00:01:59+00:00</dc:date>
<dc:publisher>TAN</dc:publisher>
<dc:creator>rss@talkaboutnetwork.com</dc:creator>
<dc:subject>Discussion</dc:subject>
<syn:updatePeriod>hourly</syn:updatePeriod>
<syn:updateFrequency>1</syn:updateFrequency>
<syn:updateBase>1970-01-01T00:00+00:00</syn:updateBase>
<items>
 <rdf:Seq>
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2206.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2203.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2201.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2200.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2199.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2198.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2196.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2195.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2194.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2193.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2183.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2182.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2181.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2180.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2179.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2178.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2177.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2176.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2175.html" />
<rdf:li rdf:resource="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2174.html" />
 </rdf:Seq>
</items>
<image rdf:resource="http://tan12.talkaboutnetwork.com/images/spacer.gif" /> 
<textinput rdf:resource="http://talkaboutscience.com/group/sci.crypt.research/search.html" />
</channel>

<image rdf:about="http://tan12.talkaboutnetwork.com/images/spacer.gif">
<title>talkaboutscience.com Cryptography- Moderated</title>
<url>http://tan12.talkaboutnetwork.com/images/spacer.gif</url>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/</link>
</image>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2206.html">
<title>Is this problem relevant to the Diffie-Hellman problem?</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2206.html</link>
<description>I have a  problem in my study of cryptography:  We know that if a polynomial f(x) has a degree of k, given a set of k +1 data points (x_0,f(x_0)),...,(x_k,f(x_k)), we can know the evaluation of f(x) at any value x, by the polynomial interpolation.  T...</description>
<dc:creator>simon ltSimon.SCh.000@[EMAIL PROTECTED]
...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-10-24T05:35:15+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2203.html">
<title>Cartcam block cipher - C implementation</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2203.html</link>
<description>This is new cipher source code - maybe someone needs it. Its very interesting, how to make it more secure, what number of rounds is optimal.      /*      Cartman.C by Alexander Myasnikov **/ /*      Cartman Tiny block cipher for Delphi programmers   ...</description>
<dc:creator>darksoftware@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-10-20T08:14:06+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2201.html">
<title>SHA parallel computation</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2201.html</link>
<description>Hi, guys!  I am trying to implement SHA-256 on GPU using CUDA. And I want each thread to compute hash for one block or data chunk at a time and store the hashes in scratch space. After all threads finished their work I want to compute final hash from...</description>
<dc:creator>Tadas Vilkeliskis ltvilkeliskis.t@[EMAIL...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-10-14T04:57:58+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2200.html">
<title>[ACM DRM 2008] Submission server open</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2200.html</link>
<description>Dear all,          The submission server for ACM DRM 2008 is open (submission deadline: May 23).  Details follow.          Best regards,           -Greg and Marc.  ---------------------------------------------------------------------- Call for Papers...</description>
<dc:creator>marc.joye@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-05-10T13:10:14+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2199.html">
<title>Correlation between Statistical and Algebraic Analysis on Block</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2199.html</link>
<description>Is there any correlation between difficulty of statistical and algebraic analysis ?  If cipher X can be expressed as more complex algebraic equation than cipher Y then does cipher X tend to has better statistical (differential or linear) characterist...</description>
<dc:creator>Ridwan ltridwan.nurhayat@[EMAIL PROTECTE...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-05-04T11:59:51+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2198.html">
<title>CFP: StorageSS 08</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2198.html</link>
<description>--------------------------------------------------- Apologies if you received multiple copies of this posting. ---------------------------------------------------                      *** CALL FOR PAPERS ***  4th International Workshop on Storage Sec...</description>
<dc:creator>yongdaek@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-05-04T10:54:02+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2196.html">
<title>random mapping</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2196.html</link>
<description>i would like to ask if anyone know how i can find following papers :  H. Rubin,R.Sitgreaves, Probability distributions related to random transformations on a finite set Tech. Rept. Stanford University,1954.  Jay E.Folkert the distribution of the numb...</description>
<dc:creator>nur ltnurdansaran@[EMAIL PROTECTED]
gt
</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-01-23T08:06:42+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2195.html">
<title>13th European Symposium on Research in Computer Security (ESORIC</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2195.html</link>
<description>F i r s t     C a l l     F o r     P a p e r s  13th European Symposium on Research in Computer Security (ESORICS08) 6-8 October, 2008 Malaga, Spain  http://www.isac.uma.es/esorics08/   Papers offering novel research contributions in any aspect of c...</description>
<dc:creator>Alcaraz Tello ltalcaraztello@[EMAIL PROT...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2008-01-23T12:37:37+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2194.html">
<title>semi-knowledge proof vs zero-knowledge proof</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2194.html</link>
<description>Hi,all, maybe I post a non-sense topic.But when I  learned  zero- knowledge proof, I wonder why there is nothing about semi-knowledge proof,or maybe quantitive-knowledge proof? Then I  came to the literature,I only found something about knowledge com...</description>
<dc:creator>wangxahq@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-11-26T13:19:58+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2193.html">
<title>Call for Participation: ASIACRYPT 2007</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2193.html</link>
<description>Dear all  Please see below the call for participation for ASIACRYPT 2007, the 13th Annual International Conference on the Theory and Application of Cryptology  Information Security. Program with paper details is also included.  Raphael Phan ASIACRYPT...</description>
<dc:creator>raphaelphan.crypt@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-11-20T09:52:20+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2183.html">
<title>Reversible hashing</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2183.html</link>
<description>Hi, I would like to know if make sense the statement Reversible hashing. I mean is possible to develop a hash algorithm, or better a digest algorithm, (variable input lenght, fixed output lenght) that do not respect the rule to be one-way. I dont wan...</description>
<dc:creator>federico.bertola.job@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-11-04T02:18:48+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2182.html">
<title>New practical lattice based public key cryptosystem</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2182.html</link>
<description>Hello,  I am a 20 year old german student and hobby cryptographer, with strong interests in public key algorithms, cryptographic protocolls and cryptanalysis.  In the year 2003 I came up with a new signature scheme based on the closest vector problem...</description>
<dc:creator>=?iso-8859-15?Q?Gerold_Gr=FCnauer?= ltGe...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-10-08T23:17:19+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2181.html">
<title>ACM-DRM 2007 - Call for Participation</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2181.html</link>
<description>CALL FOR PARTICIPATION -------------------------------------------- ACM Digital Rights Management Workshop 2007 -------------------------------------------- October 29, 2007, Alexandria VA, USA Collocated with ACM-CCS 2007 ---------------------------...</description>
<dc:creator>sol3gga@[EMAIL PROTECTED]

</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-10-09T03:17:29+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2180.html">
<title>TeX question for cryptographers</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2180.html</link>
<description>Hi,  I need to typeset (latex2e) a series of articles containing very large numbers that dont fit on any-sized line. They typically have 300 to 1000 decimal digits. This is within the range of numbers commonly used in cryptography, hence the posting ...</description>
<dc:creator>Usenet poster ltlook@[EMAIL PROTECTED]
g...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-31T14:32:59+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2179.html">
<title>virXAFF3fpwsBB7BHfqOVIhmqjixgzJqduy9h3wAPfsoYPtvx1bEtgUeLDhMcYfH</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2179.html</link>
<description>to the end-user.   http://www.crypto.com/key_study/report.shtml                     The Risks of Key Recovery, Key Escrow,                     and Trusted Third-Party Encryption                                   Hal Abelson[1]                        ...</description>
<dc:creator>yesZsKvN3Mus6@[EMAIL PROTECTED]
 (K. U. ...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T03:13:29+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2178.html">
<title>Dont get the counters differently, agree them mysteriously.</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2178.html</link>
<description>Clothes, by Jack Herer, 1992, ISBN 1-878125-00-1 # #   The Police-taught DARE program encourages students to turn in #   friends and family by becoming a police informant.  :   Real life: a child in school answers the friendly and inquiring police : ...</description>
<dc:creator>Robette ltfsejztil@[EMAIL PROTECTED]
gt
</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T04:20:49+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2177.html">
<title>BaSJm991djSzZg8wkgvng6Yrvuqo1uIzj5kp6Ezyznum1wkwhoZDsZCSxeCY6UyD</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2177.html</link>
<description>cards #           Health insurance card #           Medical history/blood type/organ donor cards #           Automobile insurance card #           Telephone credit card(s) #           Membership card for clubs, museums, etc. #           Frequent flye...</description>
<dc:creator>Eve ltnc0VdG6Iu@[EMAIL PROTECTED]
gt
</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T03:37:48+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2176.html">
<title>L5iwHdokbzg0PGRNCRD73N9CzV9tUBCiqIijQsK0nb3dZlfw8Z7qPsWucYG3ZD4T</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2176.html</link>
<description>up conversations outside at a long distance.   *   Above the Law, by David Burnham, ISBN 0-684-80699-1, 1996 * *   The leading lobbyist for CALEA was Louis Freeh, the aggressive new *   director of the FBI. The governments most important investigativ...</description>
<dc:creator>O. U. Tigg, MD ltcdQaQV@[EMAIL PROTECTED...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T03:30:29+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2175.html">
<title>We tie them, then we half sum Sheri and Marks distinct utteranc</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2175.html</link>
<description>and kicked it under :   a tree.   *   1984, author George Orwell, 1949, ISBN 0-679-41739-7 *    *   There was a gasp and thump behind Winston, and he received a violent *   kick on the ankle which nearly flung him off balance. * *   One of the men ha...</description>
<dc:creator>W. K. Rone ltjzy5ww@[EMAIL PROTECTED]
gt...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T03:06:07+00:00</dc:date>
</item>

<item rdf:about="http://www.talkaboutscience.com/group/sci.crypt.research/messages/2174.html">
<title>Yt9FLbR2YxR7wfkv2HqN3bChxGVXniignGluzAXdTytq57HautdcaCXRUtfLip9a</title>
<link>http://www.talkaboutscience.com/group/sci.crypt.research/messages/2174.html</link>
<description>*   view. *    *   When I invite others into my home for social occasions, it means an offer *   of great intimacy to me and is not a casual event to be taken lightly. My *   possessions and living area are private to me --- that is, very personal. *...</description>
<dc:creator>94f5XwNh4U9U@[EMAIL PROTECTED]
 (Francoi...</dc:creator>
<dc:subject>Discussion</dc:subject>
<dc:date>2007-08-14T06:11:30+00:00</dc:date>
</item>


<textinput rdf:about="http://talkaboutscience.com/group/sci.crypt.research/search.html">
<title>Search talkaboutscience.com Cryptography- Moderated</title>
<description>Search talkaboutscience.com Cryptography- Moderated</description>
<name>q</name>
<link>http://talkaboutscience.com/group/sci.crypt.research/search.html</link>
</textinput>

</rdf:RDF>
