<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[IT430 GDB1 Solution and discussion]]></title><description><![CDATA[<p dir="auto">Total Marks	5<br />
Starting Date	Thursday, August 01, 2019<br />
Closing Date	Friday, August 02, 2019<br />
Status	Open<br />
Question Title	Signatures<br />
Question Description	<br />
Topic:</p>
<p dir="auto">Do you think that digital signature is more reliable than paper based signature?</p>
<p dir="auto">You are required to give your opinion that whether digital signature is more reliable than paper based signature or not?</p>
<p dir="auto">Note: Maximum 4 to 5 lines with 12 Font size in Times new Roman.</p>
]]></description><link>https://community.secnto.com//topic/273/it430-gdb1-solution-and-discussion</link><generator>RSS for Node</generator><lastBuildDate>Mon, 08 Jun 2026 21:47:56 GMT</lastBuildDate><atom:link href="https://community.secnto.com//topic/273.rss" rel="self" type="application/rss+xml"/><pubDate>Fri, 02 Aug 2019 01:06:43 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to IT430 GDB1 Solution and discussion on Wed, 29 Jan 2020 14:17:31 GMT]]></title><description><![CDATA[<p dir="auto"><a class="plugin-mentions-user plugin-mentions-a" href="/user/zareen" aria-label="Profile: zareen">@<bdi>zareen</bdi></a> said in <a href="/post/3682">IT430 GDB1 Solution and discussion</a>:</p>
<blockquote>
<p dir="auto">Do you think that in hash function can be decrypted and reversible?</p>
</blockquote>
<p dir="auto">No, they cannot be decrypted. These functions are not reversible. There is no deterministic algorithm that evaluates the original value for the specific hash.</p>
<p dir="auto">However, if you use a cryptographically secure hash password hashing then you can may still find out what the original value was. These functions were designed to produce hash codes for big volumes of data / files. That is why they were designed to be very fast. It is relative easy to calculate MD5 and SHA1 hashes over a big number of inputs and use that to create a reverse lookup table.</p>
<p dir="auto"><a href="https://crypto.stackexchange.com/questions/59924/can-sha-or-md5-results-be-decrypted" target="_blank" rel="noopener noreferrer nofollow ugc">Reff</a></p>
]]></description><link>https://community.secnto.com//post/3683</link><guid isPermaLink="true">https://community.secnto.com//post/3683</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Wed, 29 Jan 2020 14:17:31 GMT</pubDate></item><item><title><![CDATA[Reply to IT430 GDB1 Solution and discussion on Wed, 29 Jan 2020 14:15:51 GMT]]></title><description><![CDATA[<p dir="auto">Suppose you are application developer in multi-national company ABC and used hash function that converts an input values into another compressed values. Do you think that in hash function can be decrypted and reversible?</p>
<p dir="auto">You are required to give your comments with valid reason in favor or against it.</p>
<p dir="auto">%(red)[Note: Maximum 4 to 5 lines]</p>
]]></description><link>https://community.secnto.com//post/3682</link><guid isPermaLink="true">https://community.secnto.com//post/3682</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Wed, 29 Jan 2020 14:15:51 GMT</pubDate></item></channel></rss>