<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/cryptography"><title>BibSonomy bookmarks for /tag/cryptography</title><link>https://www.bibsonomy.org/tag/cryptography</link><description>BibSonomy RSS Feed for /tag/cryptography</description><items><rdf:Seq><rdf:li rdf:resource="https://wireilla.com/papers/ijcis/V14N2/14224ijcis01.pdf"/><rdf:li rdf:resource="http://extropians.weidai.com/extropians.3Q97/4356.html"/><rdf:li rdf:resource="https://wiki.debian.org/Subkeys"/><rdf:li rdf:resource="http://https://www.schneier.com/blog/archives/2022/02/breaking-245-bit-elliptic-curve-encryption-with-a-quantum-computer.html"/><rdf:li rdf:resource="https://www.zdf.de/nachrichten/politik/cryptoleaks-bnd-cia-operation-rubikon-100.html"/><rdf:li rdf:resource="https://blog.trailofbits.com/2019/07/08/fuck-rsa/"/><rdf:li rdf:resource="http://crypto.cs.mcgill.ca/~simonpie/webdav/ipad/EBook/Crypto/Guide%20to%20Elliptic%20Curve%20Cryptography%20-%20D.%20Hankerson,%20A.%20Menezes,%20S.%20Vanstone.pdf"/><rdf:li rdf:resource="https://stackoverflow.com/questions/31813080/windows-10-ssh-keys/46502014#46502014"/><rdf:li rdf:resource="https://www.heise.de/tipps-tricks/E-Mails-verschluesseln-lohnt-sich-das-3900717.html"/><rdf:li rdf:resource="https://www.bsi.bund.de/SharedDocs/Downloads/DE/BSI/Publikationen/TechnischeRichtlinien/TR02102/BSI-TR-02102.pdf?__blob=publicationFile"/><rdf:li rdf:resource="https://lkrv.fri.uni-lj.si/crypto-portal"/><rdf:li rdf:resource="https://www.easycrypt.info/trac/wiki/SchoolUMD2015"/><rdf:li rdf:resource="http://www.heise.de/security/dienste/Krypto-Kampagne-2111.html"/><rdf:li rdf:resource="http://www.iks-jena.de/mitarb/lutz/logfile/"/><rdf:li rdf:resource="http://www.itconsult.co.uk/stamper.htm"/><rdf:li rdf:resource="http://www.pgpi.org/"/><rdf:li rdf:resource="http://www.foebud.org/index.html"/><rdf:li rdf:resource="http://unsafe-passwords.com/"/><rdf:li rdf:resource="http://www.heise.de/security/meldung/Mail-Verschluesselung-Mittwochs-PGP-Schluessel-zertifizieren-bei-Heise-2077038.html"/></rdf:Seq></items></channel><item rdf:about="https://wireilla.com/papers/ijcis/V14N2/14224ijcis01.pdf"><title>A universal whitening algorithm for commercial random number generators</title><description>In this work, we present a universal whitening algorithm using n-qubit permutation matrices to
remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators
and its comparison with cryptographic hash functions and block ciphers.</description><link>https://wireilla.com/papers/ijcis/V14N2/14224ijcis01.pdf</link><dc:creator>alinta</dc:creator><dc:date>2024-10-17T11:34:35+02:00</dc:date><dc:subject>&amp; Biological Coding Computation Cryptography Evolutionary Quantum and cryptography </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;In this work, we present a universal whitening algorithm using n-qubit permutation matrices to
remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators
and its comparison with cryptographic hash functions and block ciphers.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/&amp;"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Biological"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Coding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evolutionary"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Quantum"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/and"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://extropians.weidai.com/extropians.3Q97/4356.html"><title>extropians: tunneling through the Singularity</title><description></description><link>http://extropians.weidai.com/extropians.3Q97/4356.html</link><dc:creator>bshanks</dc:creator><dc:date>2024-03-22T06:00:43+01:00</dc:date><dc:subject>bobble cryptography singularity vinge </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-03-22T06:00:43+01:00&#034; href=&#034;http://extropians.weidai.com/extropians.3Q97/4356.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://extropians.weidai.com/extropians.3Q97/4356.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bobble"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/singularity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/vinge"/></rdf:Bag></taxo:topics></item><item rdf:about="https://wiki.debian.org/Subkeys"><title>Subkeys - Debian Wiki</title><description>gpg2 --with-keygrip --list-key</description><link>https://wiki.debian.org/Subkeys</link><dc:creator>jaeschke</dc:creator><dc:date>2023-03-20T12:42:32+01:00</dc:date><dc:subject>cryptography gnupg gpg key management pgp privacy security subkey </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;gpg2 --with-keygrip --list-key&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gnupg"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gpg"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/key"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/management"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pgp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/privacy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/subkey"/></rdf:Bag></taxo:topics></item><item rdf:about="http://https://www.schneier.com/blog/archives/2022/02/breaking-245-bit-elliptic-curve-encryption-with-a-quantum-computer.html"><title>Breaking 256-bit Elliptic Curve Encryption with a Quantum Computer</title><description>Finally, we calculate the number of physical qubits required to break the 256-bit elliptic curve encryption of keys in the Bitcoin network within the small available time frame in which it would actually pose a threat to do so. It would require 317 × 106 physical qubits to break the encryption within one hour using the surface code, a code cycle time of 1 μs, a reaction time of 10 μs, and a physical gate error of 10-3. To instead break the encryption within one day, it would require 13 × 106 physical qubits.</description><link>http://https://www.schneier.com/blog/archives/2022/02/breaking-245-bit-elliptic-curve-encryption-with-a-quantum-computer.html</link><dc:creator>ccx</dc:creator><dc:date>2022-02-11T03:10:07+01:00</dc:date><dc:subject>cryptography quantum_computing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Finally, we calculate the number of physical qubits required to break the 256-bit elliptic curve encryption of keys in the Bitcoin network within the small available time frame in which it would actually pose a threat to do so. It would require 317 × 106 physical qubits to break the encryption within one hour using the surface code, a code cycle time of 1 μs, a reaction time of 10 μs, and a physical gate error of 10-3. To instead break the encryption within one day, it would require 13 × 106 physical qubits.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/quantum_computing"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.zdf.de/nachrichten/politik/cryptoleaks-bnd-cia-operation-rubikon-100.html"><title>#Cryptoleaks: Wie BND und CIA alle täuschten - ZDFheute 11.02.2020</title><description>Recherchen von ZDF, Washington Post und SRF belegen, dass BND und CIA grobe Menschrechtsverletzungen verschwiegen, als sie heimlich Staaten ausspionierten.</description><link>https://www.zdf.de/nachrichten/politik/cryptoleaks-bnd-cia-operation-rubikon-100.html</link><dc:creator>meneteqel</dc:creator><dc:date>2020-02-11T13:30:37+01:00</dc:date><dc:subject>Spionage Verschlüsselung bnd cia cryptography cryptoleaks </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Recherchen von ZDF, Washington Post und SRF belegen, dass BND und CIA grobe Menschrechtsverletzungen verschwiegen, als sie heimlich Staaten ausspionierten.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Spionage"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Verschlüsselung"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bnd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cia"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptoleaks"/></rdf:Bag></taxo:topics></item><item rdf:about="https://blog.trailofbits.com/2019/07/08/fuck-rsa/"><title>Seriously, stop using RSA | Trail of Bits Blog</title><description>Found linked from Whose Curve Is It Anyway &lt;https://whosecurve.com/&gt;. | Here at Trail of Bits we review a lot of code. From major open source projects to exciting new proprietary software, we’ve seen it all. But one common denominator in all of these systems is that for some inexplicable reason people still seem to think RSA is a good cryptosystem to use. Let me save…</description><link>https://blog.trailofbits.com/2019/07/08/fuck-rsa/</link><dc:creator>mkf</dc:creator><dc:date>2020-01-16T18:15:26+01:00</dc:date><dc:subject>cryptography rsa </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Found linked from Whose Curve Is It Anyway &amp;lt;https://whosecurve.com/&amp;gt;. | Here at Trail of Bits we review a lot of code. From major open source projects to exciting new proprietary software, we’ve seen it all. But one common denominator in all of these systems is that for some inexplicable reason people still seem to think RSA is a good cryptosystem to use. Let me save…&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/rsa"/></rdf:Bag></taxo:topics></item><item rdf:about="http://crypto.cs.mcgill.ca/~simonpie/webdav/ipad/EBook/Crypto/Guide%20to%20Elliptic%20Curve%20Cryptography%20-%20D.%20Hankerson,%20A.%20Menezes,%20S.%20Vanstone.pdf"><title>Guide to Elliptic Curve Cryptography - D. Hankerson, A. Menezes, S. Vanstone</title><description></description><link>http://crypto.cs.mcgill.ca/~simonpie/webdav/ipad/EBook/Crypto/Guide%20to%20Elliptic%20Curve%20Cryptography%20-%20D.%20Hankerson,%20A.%20Menezes,%20S.%20Vanstone.pdf</link><dc:creator>overleaf</dc:creator><dc:date>2018-07-02T20:26:36+02:00</dc:date><dc:subject>cryptography ellipticcurves </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2018-07-02T20:26:36+02:00&#034; href=&#034;http://crypto.cs.mcgill.ca/~simonpie/webdav/ipad/EBook/Crypto/Guide%20to%20Elliptic%20Curve%20Cryptography%20-%20D.%20Hankerson,%20A.%20Menezes,%20S.%20Vanstone.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://crypto.cs.mcgill.ca/~simonpie/webdav/ipad/EBook/Crypto/Guide%20to%20Elliptic%20Curve%20Cryptography%20-%20D.%20Hankerson,%20A.%20Menezes,%20S.%20Vanstone.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ellipticcurves"/></rdf:Bag></taxo:topics></item><item rdf:about="https://stackoverflow.com/questions/31813080/windows-10-ssh-keys/46502014#46502014"><title>Windows 10 SSH keys - Stack Overflow</title><description></description><link>https://stackoverflow.com/questions/31813080/windows-10-ssh-keys/46502014#46502014</link><dc:creator>achakraborty</dc:creator><dc:date>2018-06-07T17:14:48+02:00</dc:date><dc:subject>cryptography git question ssh stackoverflow windows </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2018-06-07T17:14:48+02:00&#034; href=&#034;https://stackoverflow.com/questions/31813080/windows-10-ssh-keys/46502014#46502014&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://stackoverflow.com/questions/31813080/windows-10-ssh-keys/46502014#46502014&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/git"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/question"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ssh"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stackoverflow"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/windows"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.heise.de/tipps-tricks/E-Mails-verschluesseln-lohnt-sich-das-3900717.html"><title>E-Mails verschlüsseln - lohnt sich das?</title><description>E-Mail-Verschlüsselung ist seit Jahren ein Thema. Und seit Jahren setzt sie sich nicht durch. Das hat verschiedene Gründe. Wir zeigen trotzdem, wie es geht.</description><link>https://www.heise.de/tipps-tricks/E-Mails-verschluesseln-lohnt-sich-das-3900717.html</link><dc:creator>thtbln</dc:creator><dc:date>2018-04-17T21:56:05+02:00</dc:date><dc:subject>cryptography e-mail pgp security </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;E-Mail-Verschlüsselung ist seit Jahren ein Thema. Und seit Jahren setzt sie sich nicht durch. Das hat verschiedene Gründe. Wir zeigen trotzdem, wie es geht.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/e-mail"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pgp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.bsi.bund.de/SharedDocs/Downloads/DE/BSI/Publikationen/TechnischeRichtlinien/TR02102/BSI-TR-02102.pdf?__blob=publicationFile"><title>Kryptographische Verfahren: Empfehlungen und Schlüssellängen, Version 2018-01 - BSI-TR-02102.pdf</title><description>BSI Technical Guidelines for cryptographical algorithms and key length</description><link>https://www.bsi.bund.de/SharedDocs/Downloads/DE/BSI/Publikationen/TechnischeRichtlinien/TR02102/BSI-TR-02102.pdf?__blob=publicationFile</link><dc:creator>marcsaric</dc:creator><dc:date>2018-03-11T19:47:05+01:00</dc:date><dc:subject>bsi cryptography fulltext gpg hash paper sha technical_report </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;BSI Technical Guidelines for cryptographical algorithms and key length&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bsi"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fulltext"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gpg"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hash"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sha"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/technical_report"/></rdf:Bag></taxo:topics></item><item rdf:about="https://lkrv.fri.uni-lj.si/crypto-portal"><title>Kriptogram</title><description></description><link>https://lkrv.fri.uni-lj.si/crypto-portal</link><dc:creator>michelc</dc:creator><dc:date>2017-10-24T14:07:31+02:00</dc:date><dc:subject>Slovenian cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-10-24T14:07:31+02:00&#034; href=&#034;https://lkrv.fri.uni-lj.si/crypto-portal&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://lkrv.fri.uni-lj.si/crypto-portal&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Slovenian"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.easycrypt.info/trac/wiki/SchoolUMD2015"><title>SchoolUMD2015 – EasyCrypt</title><description></description><link>https://www.easycrypt.info/trac/wiki/SchoolUMD2015</link><dc:creator>hernan</dc:creator><dc:date>2017-08-09T19:36:36+02:00</dc:date><dc:subject>cryptography easycrypt summer_school </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-08-09T19:36:36+02:00&#034; href=&#034;https://www.easycrypt.info/trac/wiki/SchoolUMD2015&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.easycrypt.info/trac/wiki/SchoolUMD2015&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/easycrypt"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/summer_school"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.heise.de/security/dienste/Krypto-Kampagne-2111.html"><title>Krypto-Kampagne | heise Security</title><description></description><link>http://www.heise.de/security/dienste/Krypto-Kampagne-2111.html</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:05+02:00</dc:date><dc:subject>security internet cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:05+02:00&#034; href=&#034;http://www.heise.de/security/dienste/Krypto-Kampagne-2111.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.heise.de/security/dienste/Krypto-Kampagne-2111.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/internet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.iks-jena.de/mitarb/lutz/logfile/"><title>Lutz Donnerhacke: Ewiges Logfile</title><description></description><link>http://www.iks-jena.de/mitarb/lutz/logfile/</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:05+02:00</dc:date><dc:subject>security internet cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:05+02:00&#034; href=&#034;http://www.iks-jena.de/mitarb/lutz/logfile/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.iks-jena.de/mitarb/lutz/logfile/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/internet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.itconsult.co.uk/stamper.htm"><title>PGP Digital Timestamping Service</title><description></description><link>http://www.itconsult.co.uk/stamper.htm</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:05+02:00</dc:date><dc:subject>security pgp timestamp cryptography tools </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:05+02:00&#034; href=&#034;http://www.itconsult.co.uk/stamper.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.itconsult.co.uk/stamper.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pgp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/timestamp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.pgpi.org/"><title>The International PGP Home Page</title><description></description><link>http://www.pgpi.org/</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:05+02:00</dc:date><dc:subject>pgp security cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:05+02:00&#034; href=&#034;http://www.pgpi.org/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.pgpi.org/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pgp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.foebud.org/index.html"><title>Willkommen beim FoeBuD e.V. - FoeBuD e.V.</title><description></description><link>http://www.foebud.org/index.html</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:05+02:00</dc:date><dc:subject>security privacy cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:05+02:00&#034; href=&#034;http://www.foebud.org/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.foebud.org/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/privacy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://unsafe-passwords.com/"><title>Unsafe Password Generator – Generate popular and easy to remember passwords.</title><description></description><link>http://unsafe-passwords.com/</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-14T13:12:38+02:00</dc:date><dc:subject>security fun cryptography </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-14T13:12:38+02:00&#034; href=&#034;http://unsafe-passwords.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://unsafe-passwords.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fun"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.heise.de/security/meldung/Mail-Verschluesselung-Mittwochs-PGP-Schluessel-zertifizieren-bei-Heise-2077038.html"><title>Mail-Verschlüsselung: Mittwochs PGP-Schlüssel zertifizieren bei Heise | heise Security</title><description></description><link>http://www.heise.de/security/meldung/Mail-Verschluesselung-Mittwochs-PGP-Schluessel-zertifizieren-bei-Heise-2077038.html</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-14T13:12:38+02:00</dc:date><dc:subject>pgp cryptography keyserver </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-14T13:12:38+02:00&#034; href=&#034;http://www.heise.de/security/meldung/Mail-Verschluesselung-Mittwochs-PGP-Schluessel-zertifizieren-bei-Heise-2077038.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.heise.de/security/meldung/Mail-Verschluesselung-Mittwochs-PGP-Schluessel-zertifizieren-bei-Heise-2077038.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pgp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cryptography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/keyserver"/></rdf:Bag></taxo:topics></item></rdf:RDF>