Tony Arcieri

dbl: retire crate and vendor implementation into downstream users?

1

The `dbl` crate contains an implementation of doubling / multiply-by-x for the polynomial x^128 + x^7 + x^2 + x + 1 over GF(2^128). It's used in `aes-siv`, `cmac`, `pmac`,...

Alternative to #659/#661 and #662 which leverages `subtle::Choice` and `subtle::ConditionallySelectable` as the optimization barriers. Really the previous masking was there to conditionally add the scalar field modulus on underflow, so...

const-oid: type for OIDs in DB

3

The latest `const-oid` prereleases support two different types for representing OIDs: `ObjectIdentifier` and `ObjectIdentifierRef`, the difference being the former is owned and the latter uses a borrowed byte slice and...

To resolve #94, removes the `Copy` supertrait bound on `ConditionallySelectable`, replacing it with `Sized` instead. It turns out the bound is only used in the default implementation of `ConditionallySelectable::conditional_swap`, and...

`const fn` support

3

In `crypto-bigint` we've had to build an entirely parallel set of types in order to support `const fn`: [`ConstChoice`](https://docs.rs/crypto-bigint/0.6.0-rc.0/crypto_bigint/struct.ConstChoice.html) and [`ConstCtOption`](https://docs.rs/crypto-bigint/0.6.0-rc.0/crypto_bigint/struct.ConstCtOption.html), which are `const fn`-friendly versions of `subtle`'s equivalent `Choice`...

`adler` is unmaintained. `adler2` is a maintained fork by the author of `miniz_oxide` https://github.com/oyvindln/adler2

This is a list of release blockers for `crypto-bigint` v0.6.0, nearly all of which are final releases of dependencies which are currently in a prerelease state: - [ ] MSRV...

Replaces macro-based code sharing between the stack-allocated and heap-allocated `*Uint` types with `const fn` using `const_mut_refs`. Stabilization of this feature is (hopefully) imminent and the PR to do so is...

Implement `safegcd-bounds`

2

This is a corresponding tracking issue for this TODO: https://github.com/RustCrypto/crypto-bigint/blob/ae30093/src/modular/safegcd.rs#L341 The bounds we currently implement for Bernstein-Yang are the ones described in the paper, which proves that the algorithm will...