<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>cryptography by Ahmad Fyqrie Bin Ahmad Rozley</title>
      <link>https://padlet.com/i21020133/qav0jh13drdvo2en</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2022-03-23 06:41:35 UTC</pubDate>
      <lastBuildDate>2022-03-30 07:36:29 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Symmetric Encryption</title>
         <author>i19017451</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109113215</link>
         <description><![CDATA[<div>- is an old and best-known technique.&nbsp;<br>-  uses a secret key that can either be a number, a word or a string of random letters.<br>- is a blended with the plain text of a message to change the content in a particular way.&nbsp;<br>- The sender and the recipient should know the secret key that is used to encrypt and decrypt all the messages.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 06:45:09 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109113215</guid>
      </item>
      <item>
         <title>Topic</title>
         <author>i21020133</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109116325</link>
         <description><![CDATA[<div>1.&nbsp; &nbsp; &nbsp; MD5 - farid</div><div>2.&nbsp; &nbsp; &nbsp; SHA - ahmad</div><div>3.&nbsp; &nbsp; &nbsp; HMAC Hashing Algorithm - Kuan Bin</div><div>4.&nbsp; &nbsp; &nbsp; Symmetric Encryption - desmond</div><div>5.&nbsp; &nbsp; &nbsp; Asymmetric Encryption - desmond</div><div>6.&nbsp; &nbsp; &nbsp; Diffie-Hellman - Ting Hang</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 06:47:53 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109116325</guid>
      </item>
      <item>
         <title>Asymmetric encryption</title>
         <author>i19017451</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109122533</link>
         <description><![CDATA[<div>- is also known as public key cryptography, which is a relatively new method, compared to symmetric encryption.&nbsp;<br>- uses two keys to encrypt a plain text.<br>- Public key is made freely available to anyone who might want to send you a message.&nbsp;<br>- Second private key is kept a secret.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 06:54:06 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109122533</guid>
      </item>
      <item>
         <title>Asymmetric encryption vs Symmetric Encryption</title>
         <author>i19017451</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109123398</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1543311068/7cbe7d441fb7332393b9d8bc5ed635e7/image.png" />
         <pubDate>2022-03-23 06:54:53 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109123398</guid>
      </item>
      <item>
         <title>SHA</title>
         <author>i21020133</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109123764</link>
         <description><![CDATA[<div>- SHA stands for Secure Hashing Algorithm and it is a modified version of MD5 used for hashing data and certificates.&nbsp;<br>- Hashing cannot be cracked unless brute force is used<br>- Hashing changes the word into a combination of letters and numbers<br><br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1543308906/6531eefdb09a3c8b7ce9374c85262db0/image.png" />
         <pubDate>2022-03-23 06:55:07 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109123764</guid>
      </item>
      <item>
         <title>MD5</title>
         <author>i19017436</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109128014</link>
         <description><![CDATA[<div><br></div><div>- MD5 is a one-way cryptographic function that accepts any length message as input and produces a fixed-length digest value that may be used to authenticate the original message as output.</div><div>- originally designed as a cryptographic message authentication code algorithm for use on the internet.</div><div>- no longer reliable because MD5 collisions can occur with the commercial off-the-shelf computers<br>-encryption collision means two files have the same hash</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 06:59:06 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109128014</guid>
      </item>
      <item>
         <title>Different forms of SHA</title>
         <author>i21020133</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109128788</link>
         <description><![CDATA[<div>There are 2 general types of SHA: SHA-1 and SHA-2<br><br>The difference between SHA-1 and SHA-2 is that SHA-1 only return a 160-bit hash and it can be more easily brute-forced than SHA-2. SHA-2 gives every hash digest a unique value&nbsp;to make it more secure.<br><br>Subtypes of SHA are: SHA-256, SHA-512, SHA-224 and SHA-384&nbsp;<br><br>The larger numbers are just versions of SHA-2 that note the bit lengths. Basically, the number defines the bit-lengths of the hashed digest.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 06:59:55 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109128788</guid>
      </item>
      <item>
         <title>HMAC Hashing Algorithm</title>
         <author>jamespoon5517</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109131395</link>
         <description><![CDATA[<div>- HMACs are created by combining a cryptographic hash function with a secret key in any cryptographic technique.<br>- Input data and the secret key are both used to determine the hash function's output, which can only be known by the sender and recipient.<br>- The digest of an HMAC function can only be computed by parties that have access to the secret key.<br>- A correctly built HMAC digest of a message received by one party shows that the other party was the sender if the parties have a shared secret key and employ HMAC functions to authenticate.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 07:02:12 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109131395</guid>
      </item>
      <item>
         <title>is MD5 secure?</title>
         <author>i19017436</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109136712</link>
         <description><![CDATA[<div>it used to be secured because of two reasons:-<br><br>- It is impossible for an attacker to generate a message matching a specific hash value.<br><br>- It is impossible for an attacker to create two messages that produce the same hash value.<br><br>But it is no longer secure methods according to IETF</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 07:07:14 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109136712</guid>
      </item>
      <item>
         <title>How HMAC Works</title>
         <author>jamespoon5517</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109143479</link>
         <description><![CDATA[<div>- HMACs give the client and the server a shared private key that is only known to them.&nbsp;<br>- Every time a request comes in, the client generates a new hash (HMAC). When a client makes a request to the server, the requested data is encrypted using a private key and sent along with the request.&nbsp;<br>- Separate procedures are used to hash the message and the key, ensuring the integrity of the data being sent between the two.&nbsp;<br>- As soon as the server accepts a request, it generates its own HMAC. The HMACS are compared, and if they are the same, the client is deemed authentic.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 07:13:06 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109143479</guid>
      </item>
      <item>
         <title>Diffie-Hellman</title>
         <author>i20019629</author>
         <link>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109152008</link>
         <description><![CDATA[<div>The Diffie-Hellman key exchange was one of the most important developments in public-key cryptography<br>-safely developing and exchanging keys over an insecure channel.<br>-securely exchanging cryptographic keys over a public communications channel.<br>-This key can then be used to encrypt subsequent communications using a symmetric-key cipher.<br><br>To encode your messages, every “a” becomes&nbsp; “b”, every “b” becomes “c”, every “c” becomes “d”, and so on, all the way up to the “z” becoming an “a”.</div><div>As a result, the message “Let’s get dinner” becomes “Mfu’t hfu ejoofs”.</div><div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-03-23 07:20:30 UTC</pubDate>
         <guid>https://padlet.com/i21020133/qav0jh13drdvo2en/wish/2109152008</guid>
      </item>
   </channel>
</rss>
