Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri
, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); [WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper by tarcieri · Pull Request #47 · RustCrypto/universal-hashes · GitHub
Skip to content

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper - #47

Closed
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar
Closed

[WIP] poly1305: AVX2 based on Bhattacharyya/Sarkar paper#47
tarcieri wants to merge 1 commit into
masterfrom
poly1305/avx2-bhattacharyya-sarkar

Conversation

@tarcieri

Copy link
Copy Markdown
Member

Mechanical translation originally based on Corrode.

The original source code seems to be incomplete, but still amenable to a mechanical translation:

https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305

Notably its internal buffering in the original source code is commented out, but not part of the UniversalHash-trait API.

We could potentially throw away all of the optimizations for larger-than-block-size buffers and the incomplete code for buffering non-block-aligned messages to get a baseline AVX2-optimized implementation of Poly1305.

That said, this code is failing the basic test vectors, probably owing to its incompleteness, and it probably makes more sense to base an AVX2 implementation on well-tested code which may perform slower but is known to work and be generally robust.

Mechanical translation originally based on Corrode.
The original source code seems to be incomplete, but still amenable to a
mechanical translation:
https://github.com/Sreyosi/Improved-SIMD-Implementation-of-Poly1305
Notably its internal buffering in the original source code is commented
out, but not part of the `UniversalHash`-trait API.
We could potentially throw away all of the optimizations for
larger-than-block-size buffers and the incomplete code for buffering
non-block-aligned messages to get a baseline AVX2-optimized
implementation of Poly1305.
That said, this code is failing the basic test vectors, probably owing
to its incompleteness, and it probably makes more sense to base an AVX2
implementation on well-tested code which may perform slower but is known
to work and be generally robust.
Comment threadpoly1305/src/avx2.rs
Comment on lines +222 to +266
if in_len >= 768 {
let mut r8 = red5x64(mul130(state.r4, state.r4, state.r45));
let mut r12 = red5x64(mul130(r8, state.r4, state.r45));
let mut r85 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r8), (_mm256_slli_epi32((r8), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
let mut r125 = _mm256_permutevar8x32_epi32(
(_mm256_add_epi32((r12), (_mm256_slli_epi32((r12), (2))))),
(_mm256_set_epi32(4, 3, 2, 1, 1, 1, 1, 1)),
);
r8 = _mm256_blend_epi32((r8), (r85), (0xE0));
r12 = _mm256_blend_epi32((r12), (r125), (0xE0));
r85 = _mm256_permute2x128_si256((r85), (r85), (0));
r125 = _mm256_permute2x128_si256((r125), (r125), (0));

loop {
p = add4x130(
red4x130(muladd4x130P(
muladd4x130P(mul4x130P(p, r12, r125), align4x128(load4x128(ip)), r8, r85),
align4x128(load4x128(ip.add(16))),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(32))),
);
in_len -= 192;
ip = ip.add(48);
if in_len < 192 {
break;
}
}

if in_len >= 128 {
p = add4x130(
red4x130(muladd4x130P(
mul4x130P(p, r8, r85),
align4x128(load4x128(ip)),
state.r4,
state.r45,
)),
align4x128(load4x128(ip.add(16))),
);
in_len -= 128;
ip = ip.add(32);

Copy link
Copy Markdown
MemberAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It looks like an optimization which only wants to implement the current UniversalHash trait (which precludes optimizations for outputs larger than the UHF itself) could omit this entire codeblock and also any functions which are only invoked for this "wide" optimization.

@tarcieri

Copy link
Copy Markdown
MemberAuthor

Closed in favor of #49

@tarcieri
tarcieri deleted the poly1305/avx2-bhattacharyya-sarkar branch June 16, 2020 01:23
Sign up for freeto join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant

@tarcieri