<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>The convergence of slide-type reductions</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Michael</namePart>
  <namePart type="family">Walter</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">488F98B0-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-3186-2482</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrPi</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>PKC: IACR International Conference on Practice and Theory of Public Key Cryptography</namePart>
</name>



<name type="corporate">
  <namePart>Teaching Old Crypto New Tricks</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO’11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2021_PKC_Walter.pdf">https://research-explorer.ista.ac.at/download/9466/11416/2021_PKC_Walter.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2021</dateIssued><place><placeTerm type="text">Virtual</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Public-Key Cryptography – PKC 2021</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="eIssn">1611-3349</identifier>
  <identifier type="isbn">9783030752446</identifier>
  <identifier type="ISI">001294728500003</identifier><identifier type="doi">10.1007/978-3-030-75245-3_3</identifier>
<part><detail type="volume"><number>12710</number></detail><extent unit="pages">45-67</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Walter, M. (2021). The convergence of slide-type reductions. In &lt;i&gt;Public-Key Cryptography – PKC 2021&lt;/i&gt; (Vol. 12710, pp. 45–67). Virtual: Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-75245-3_3&quot;&gt;https://doi.org/10.1007/978-3-030-75245-3_3&lt;/a&gt;</apa>
<ieee>M. Walter, “The convergence of slide-type reductions,” in &lt;i&gt;Public-Key Cryptography – PKC 2021&lt;/i&gt;, Virtual, 2021, vol. 12710, pp. 45–67.</ieee>
<ama>Walter M. The convergence of slide-type reductions. In: &lt;i&gt;Public-Key Cryptography – PKC 2021&lt;/i&gt;. Vol 12710. Springer Nature; 2021:45-67. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-75245-3_3&quot;&gt;10.1007/978-3-030-75245-3_3&lt;/a&gt;</ama>
<mla>Walter, Michael. “The Convergence of Slide-Type Reductions.” &lt;i&gt;Public-Key Cryptography – PKC 2021&lt;/i&gt;, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-75245-3_3&quot;&gt;10.1007/978-3-030-75245-3_3&lt;/a&gt;.</mla>
<ista>Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.</ista>
<short>M. Walter, in:, Public-Key Cryptography – PKC 2021, Springer Nature, 2021, pp. 45–67.</short>
<chicago>Walter, Michael. “The Convergence of Slide-Type Reductions.” In &lt;i&gt;Public-Key Cryptography – PKC 2021&lt;/i&gt;, 12710:45–67. Springer Nature, 2021. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-75245-3_3&quot;&gt;https://doi.org/10.1007/978-3-030-75245-3_3&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>9466</recordIdentifier><recordCreationDate encoding="w3cdtf">2021-06-06T22:01:29Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-04-16T09:25:35Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
