30,750 research outputs found
Efficient Unified Arithmetic for Hardware Cryptography
The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1], the US federal Digital Signature Standard [2], elliptic curve cryptography [3, 4], and also recently identity based cryptography [5, 6]. Most popular finite fields that are heavily used in cryptographic applications due to elliptic curve based schemes are prime fields GF(p) and binary extension fields GF(2n). Recently, identity based cryptography based on pairing operations defined over elliptic curve points has stimulated a significant level of interest in the arithmetic of ternary extension fields, GF(3^n)
Inverse Uncertainty Quantification using the Modular Bayesian Approach based on Gaussian Process, Part 2: Application to TRACE
Inverse Uncertainty Quantification (UQ) is a process to quantify the
uncertainties in random input parameters while achieving consistency between
code simulations and physical observations. In this paper, we performed inverse
UQ using an improved modular Bayesian approach based on Gaussian Process (GP)
for TRACE physical model parameters using the BWR Full-size Fine-Mesh Bundle
Tests (BFBT) benchmark steady-state void fraction data. The model discrepancy
is described with a GP emulator. Numerical tests have demonstrated that such
treatment of model discrepancy can avoid over-fitting. Furthermore, we
constructed a fast-running and accurate GP emulator to replace TRACE full model
during Markov Chain Monte Carlo (MCMC) sampling. The computational cost was
demonstrated to be reduced by several orders of magnitude.
A sequential approach was also developed for efficient test source allocation
(TSA) for inverse UQ and validation. This sequential TSA methodology first
selects experimental tests for validation that has a full coverage of the test
domain to avoid extrapolation of model discrepancy term when evaluated at input
setting of tests for inverse UQ. Then it selects tests that tend to reside in
the unfilled zones of the test domain for inverse UQ, so that one can extract
the most information for posterior probability distributions of calibration
parameters using only a relatively small number of tests. This research
addresses the "lack of input uncertainty information" issue for TRACE physical
input parameters, which was usually ignored or described using expert opinion
or user self-assessment in previous work. The resulting posterior probability
distributions of TRACE parameters can be used in future uncertainty,
sensitivity and validation studies of TRACE code for nuclear reactor system
design and safety analysis
Efficient unified Montgomery inversion with multibit shifting
Computation of multiplicative inverses in finite fields GF(p) and GF(2/sup n/) is the most time-consuming operation in elliptic curve cryptography, especially when affine co-ordinates are used. Since the existing algorithms based on the extended Euclidean algorithm do not permit a fast software implementation, projective co-ordinates, which eliminate almost all of the inversion operations from the curve arithmetic, are preferred. In the paper, the authors demonstrate that affine co-ordinate implementation provides a comparable speed to that of projective co-ordinates with careful hardware realisation of existing algorithms for calculating inverses in both fields without utilising special moduli or irreducible polynomials. They present two inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inversion algorithm. The similarity of the two algorithms allows the design of a single unified hardware architecture that performs the computation of inversion in both fields. They also propose a hardware structure where the field elements are represented using a multi-word format. This feature allows a scalable architecture able to operate in a broad range of precision, which has certain advantages in cryptographic applications. In addition, they include statistical comparison of four inversion algorithms in order to help choose the best one amongst them for implementation onto hardware
Layered architecture for quantum computing
We develop a layered quantum computer architecture, which is a systematic
framework for tackling the individual challenges of developing a quantum
computer while constructing a cohesive device design. We discuss many of the
prominent techniques for implementing circuit-model quantum computing and
introduce several new methods, with an emphasis on employing surface code
quantum error correction. In doing so, we propose a new quantum computer
architecture based on optical control of quantum dots. The timescales of
physical hardware operations and logical, error-corrected quantum gates differ
by several orders of magnitude. By dividing functionality into layers, we can
design and analyze subsystems independently, demonstrating the value of our
layered architectural approach. Using this concrete hardware platform, we
provide resource analysis for executing fault-tolerant quantum algorithms for
integer factoring and quantum simulation, finding that the quantum dot
architecture we study could solve such problems on the timescale of days.Comment: 27 pages, 20 figure
- …