<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (randombit)</title>
    <link>https://pinboard.in/u:randombit/public/</link>
    <description>recent bookmarks from randombit</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://eprint.iacr.org/2018/700.pdf"/>
	<rdf:li rdf:resource="https://eprint.iacr.org/2017/1057"/>
	<rdf:li rdf:resource="https://choucroutage.com/Papers/SideChannelAttacks/ches-2002-joye.pdf"/>
	<rdf:li rdf:resource="http://delta.cs.cinvestav.mx/~francisco/arith/j52moinv.pdf"/>
	<rdf:li rdf:resource="https://eprint.iacr.org/2015/657"/>
	<rdf:li rdf:resource="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.3120&amp;rep=rep1&amp;type=pdf"/>
	<rdf:li rdf:resource="http://www.cs.ucsb.edu/~koc/docs/j37.pdf"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://eprint.iacr.org/2018/700.pdf">
    <title>SIDH on ARM: Faster Modular Multiplications for Faster Post-Quantum Supersingular Isogeny Key Exchange</title>
    <dc:date>2018-08-02T15:05:29+00:00</dc:date>
    <link>https://eprint.iacr.org/2018/700.pdf</link>
    <dc:creator>randombit</dc:creator><description><![CDATA["The techniques for modular multiplication presented in this work
have broad applications to other cryptographic schemes."]]></description>
<dc:subject>montgomery crypto ecc arm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:7ba335e5a8e5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ecc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:arm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://eprint.iacr.org/2017/1057">
    <title>Montgomery Arithmetic from a Software Perspective</title>
    <dc:date>2017-10-31T18:33:42+00:00</dc:date>
    <link>https://eprint.iacr.org/2017/1057</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto montgomery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:11af3f9a0638/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://choucroutage.com/Papers/SideChannelAttacks/ches-2002-joye.pdf">
    <title>The Montgomery Powering Ladder</title>
    <dc:date>2016-02-22T02:25:31+00:00</dc:date>
    <link>https://choucroutage.com/Papers/SideChannelAttacks/ches-2002-joye.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>montgomery crypto</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:6b5c80849b30/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://delta.cs.cinvestav.mx/~francisco/arith/j52moinv.pdf">
    <title>The Montgomery Modular Inverse - Revisited</title>
    <dc:date>2016-02-18T18:23:54+00:00</dc:date>
    <link>http://delta.cs.cinvestav.mx/~francisco/arith/j52moinv.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>montgomery crypto</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:67a29e8eb8aa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://eprint.iacr.org/2015/657">
    <title>Randomizing the Montgomery Powering Ladder</title>
    <dc:date>2015-12-13T17:05:31+00:00</dc:date>
    <link>https://eprint.iacr.org/2015/657</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[In this paper, we present novel randomized techniques to enhance Montgomery powering ladder. The proposed techniques increase the resistance against side-channel attacks and especially recently published correlation collision attacks in the horizontal setting. The first of these operates by randomly changing state such that the difference between registers varies, unpredictably, between two states. The second algorithm takes a random walk, albeit tightly bounded, along the possible addition chains required to compute an exponentiation. We also generalize the Montgomery powering ladder and present randomized (both left-to-right and right-to-left) $m$-ary exponentiation algorithms.]]></description>
<dc:subject>crypto toreview montgomery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:49108512f4e3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:toreview"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.3120&amp;rep=rep1&amp;type=pdf">
    <title>Analyzing and Comparing Montgomery Multiplication Algorithms</title>
    <dc:date>2015-07-04T13:44:09+00:00</dc:date>
    <link>http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.3120&amp;rep=rep1&amp;type=pdf</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Descrbies several combined multiply/reduce Montgomery techniques]]></description>
<dc:subject>montgomery math</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:c1eabfb6471d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:math"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.ucsb.edu/~koc/docs/j37.pdf">
    <title>Analyzing and Comparing Montgomery Multiplication Algorithms</title>
    <dc:date>2011-06-02T13:54:09+00:00</dc:date>
    <link>http://www.cs.ucsb.edu/~koc/docs/j37.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>montgomery crypto algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:f8cf6665ddf6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>