Dinoflagellate cyst-based reconstructions of mid to late Holocene winter sea-surface temperature and productivity from an anoxic fjord in the NE Pacific Ocean

Published contemporary dinoflagellate distributional data from the NE Pacific margin and estuarine environments (n = 136) were re-analyzed using Canonical Correspondence Analysis (CCA) and partial Canonical Correspondence Analysis (pCCA). These analyses illustrated the dominant controls of winter temperature and productivity on the distribution of dinoflagellate cysts in this region. Dinoflagellate cyst-based predictive models for winter temperature and productivity were developed from the contemporary distributional data using the modern analogue technique and applied to subfossil data from two mid to late Holocene (~5500 calendar years before present–present) cores; TUL99B03 and TUL99B11, collected from Effingham Inlet, a 15 km long anoxic fjord located on the southwest coast of Vancouver Island that directly opens to the Pacific Ocean through Barkley Sound. Sedimentation within these basins largely comprises annually deposited laminated couplets, each made up of a winter deposited terrigenous layer and spring to fall deposited diatomaceous layer. The Effingham Inlet dinoflagellate cyst record provides evidence of a mid-Holocene gradual decline in winter SST, ending with the initiation of neoglacial advances in the region by ~3500 cal BP. A reconstructed Late Holocene increase in winter SST was initiated by a weakening of the California Current, which would have resulted in a warmer central gyre and more El Niño-like conditions.

FPGA montgomery modular multiplication architectures suitable for ECCs over GF(p)

New FPGA architectures for the ordinary Montgomery multiplication algorithm and the FIOS modular multiplication algorithm are presented. The embedded 18×18-bit multipliers and fast carry look-ahead logic located on the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions/subtractions required by these two algorithms. The architectures are developed for use in Elliptic Curve Cryptosystems over GF(p), which require modular field multiplication to perform elliptic curve point addition and doubling. Field sizes of 128-bits and 256-bits are chosen but other field sizes can easily be accommodated, by rapidly reprogramming the FPGA. Overall, the larger the word size of the multiplier, the more efficiently it performs in terms of area/time product. Also, the FIOS algorithm is flexible in that one can tailor the multiplier architecture is to be area efficient, time efficient or a mixture of both by choosing a particular word size. It is estimated that the computation of a 256-bit scalar point multiplication over GF(p) would take about 4.8 ms.