<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Fulbright Star Shines</title>
	<atom:link href="http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/feed/" rel="self" type="application/rss+xml" />
	<link>http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/</link>
	<description>What&#039;s Your View?</description>
	<lastBuildDate>Wed, 19 Jun 2013 07:17:44 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=abc</generator>
	<item>
		<title>By: Sean Smith</title>
		<link>http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/comment-page-1/#comment-3510</link>
		<dc:creator>Sean Smith</dc:creator>
		<pubDate>Tue, 23 Mar 2010 00:41:30 +0000</pubDate>
		<guid isPermaLink="false">http://exchange.telstra.com.au/?p=2527#comment-3510</guid>
		<description>Hi Craig,

Congratulations.  I have a question. The cryptography relies on complex mathematic equations to conceal the core data.  If so, isn&#039;t it likely that somebody could &quot;solve the puzzle&quot;?  Are there any other schools of thought on other ways to protect the integrity of data - such as source indicative identification or creation of alternate languages that are dynamic in their nature? 
My questions may bely my lack of knowledge on this subject but I am curious based on the fact that if someone can arrive at an equation as a means of hiding the data, someone/something might also discover the equation too. 
Cheers
Sean</description>
		<content:encoded><![CDATA[<p>Hi Craig,</p>
<p>Congratulations.  I have a question. The cryptography relies on complex mathematic equations to conceal the core data.  If so, isn&#8217;t it likely that somebody could &#8220;solve the puzzle&#8221;?  Are there any other schools of thought on other ways to protect the integrity of data &#8211; such as source indicative identification or creation of alternate languages that are dynamic in their nature?<br />
My questions may bely my lack of knowledge on this subject but I am curious based on the fact that if someone can arrive at an equation as a means of hiding the data, someone/something might also discover the equation too.<br />
Cheers<br />
Sean</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Robert Morsillo</title>
		<link>http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/comment-page-1/#comment-3387</link>
		<dc:creator>Robert Morsillo</dc:creator>
		<pubDate>Fri, 19 Mar 2010 05:40:41 +0000</pubDate>
		<guid isPermaLink="false">http://exchange.telstra.com.au/?p=2527#comment-3387</guid>
		<description>Congratulations Craig, how impressive is that! (Maths was my first love, but the rest is history as they say.)

Seriously though, I have a relative, Prof Ales Drapal, at Charles University, Prague, Czech Republick, who is a mathematician and moved into researching and teaching cryptography. He is a lovely guy, we talk philosophy, theology, some mathematics, and family stuff from time to time when we get together.

Just wondering, off chance, whether you would allow me to put him in touch with you and vice versa for, who knows, some serendipity?

Once again, congratulations and kind regards.</description>
		<content:encoded><![CDATA[<p>Congratulations Craig, how impressive is that! (Maths was my first love, but the rest is history as they say.)</p>
<p>Seriously though, I have a relative, Prof Ales Drapal, at Charles University, Prague, Czech Republick, who is a mathematician and moved into researching and teaching cryptography. He is a lovely guy, we talk philosophy, theology, some mathematics, and family stuff from time to time when we get together.</p>
<p>Just wondering, off chance, whether you would allow me to put him in touch with you and vice versa for, who knows, some serendipity?</p>
<p>Once again, congratulations and kind regards.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul</title>
		<link>http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/comment-page-1/#comment-3383</link>
		<dc:creator>Paul</dc:creator>
		<pubDate>Fri, 19 Mar 2010 05:09:28 +0000</pubDate>
		<guid isPermaLink="false">http://exchange.telstra.com.au/?p=2527#comment-3383</guid>
		<description>Sounds like an interesting career move mate!  Just don&#039;t get yourself arrested in the states for using too high level encryption =P  Remember, anything 256bit of above they can&#039;t hack (easily), so your not allowed to run it =P</description>
		<content:encoded><![CDATA[<p>Sounds like an interesting career move mate!  Just don&#8217;t get yourself arrested in the states for using too high level encryption =P  Remember, anything 256bit of above they can&#8217;t hack (easily), so your not allowed to run it =P</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mick Alford</title>
		<link>http://exchange.telstra.com.au/2010/03/19/fulbright-star-shines/comment-page-1/#comment-3381</link>
		<dc:creator>Mick Alford</dc:creator>
		<pubDate>Fri, 19 Mar 2010 04:59:44 +0000</pubDate>
		<guid isPermaLink="false">http://exchange.telstra.com.au/?p=2527#comment-3381</guid>
		<description>Wishing you all the best craig. Well done.</description>
		<content:encoded><![CDATA[<p>Wishing you all the best craig. Well done.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
