Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2018
Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers
IEEE Transactions on Computers (ITCO), Volume 67, Issue 1January 2018, Pages 86–101https://doi.org/10.1109/TC.2017.2723879Current Graphics Processing Units (GPUs) are capable of obtaining high computational performance in scientific applications. Nevertheless, programmers have to use suitable parallel algorithms for these architectures and usually have to consider ...
- research-articleOctober 2015
New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic
IEEE Transactions on Computers (ITCO), Volume 64, Issue 10Oct. 2015, Pages 2875–2890https://doi.org/10.1109/TC.2015.2389817We present two new strategies for parallel implementation of scalar multiplication over elliptic curves. We first introduce a Montgomery-halving algorithm which is a variation of the original Montgomery-ladder for point multiplication. This Montgomery-...
- research-articleJuly 2015
Parallel Reproducible Summation
IEEE Transactions on Computers (ITCO), Volume 64, Issue 7July 2015, Pages 2060–2070https://doi.org/10.1109/TC.2014.2345391Reproducibility, i.e. getting bitwise identical floating point results from multiple runs of the same program, is a property that many users depend on either for debugging or correctness checking in many codes [10]. However, the combination of dynamic ...
- research-articleFebruary 2015
New Regular Radix-8 Scheme for Elliptic Curve Scalar Multiplication without Pre-Computation
IEEE Transactions on Computers (ITCO), Volume 64, Issue 2Feb. 2015, Pages 438–451https://doi.org/10.1109/TC.2013.213The recent advances in mobile technologies have increased the demand for high performance parallel computing schemes. In this paper, we present a new algorithm for evaluating elliptic curve scalar multiplication that can be used on any abelian group. We ...
- opinionJanuary 2014
-
- research-articleFebruary 2011
Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
IEEE Transactions on Computers (ITCO), Volume 60, Issue 2February 2011, Pages 266–281https://doi.org/10.1109/TC.2010.163This paper is devoted to the design of fast parallel accelerators for the cryptographic \eta_T pairing on supersingular elliptic curves over finite fields of characteristics two and three. We propose here a novel hardware implementation of Miller's ...
- research-articleNovember 2010
Conditional Partial Order Graphs: Model, Synthesis, and Application
IEEE Transactions on Computers (ITCO), Volume 59, Issue 11November 2010, Pages 1480–1493https://doi.org/10.1109/TC.2010.58The paper introduces a new formal model for specification and synthesis of control paths in the context of asynchronous system design. The model, called Conditional Partial Order Graph (CPOG), captures concurrency and choice in a system's behavior in a ...
- research-articleSeptember 2009
Orchestrating Horizontal Parallelism and Vertical Instruction Packing of Programs to Improve System Overall Efficiency
IEEE Transactions on Computers (ITCO), Volume 58, Issue 9September 2009, Pages 1211–1220https://doi.org/10.1109/TC.2009.41Both performance and energy efficiency are critical concerns for embedded systems and portable devices. Multi-issue processors can exploit the instruction-level parallelism (ILP) of programs to improve the performance greatly, however, most of the time ...
- research-articleAugust 2009
Striping-Aware Sequential Prefetching for Independency and Parallelism in Disk Arrays with Concurrent Accesses
IEEE Transactions on Computers (ITCO), Volume 58, Issue 8August 2009, Pages 1146–1152https://doi.org/10.1109/TC.2009.14Traditional studies on disk arrays have focused on parallelism or load balance of disks. However, this paper reveals that the independency of disks is more important than parallelism for concurrent reads of large numbers of processes in striped disk ...
- research-articleJune 2009
Potential Impact of Value Prediction on Communication in Many-Core Architectures
IEEE Transactions on Computers (ITCO), Volume 58, Issue 6June 2009, Pages 759–769https://doi.org/10.1109/TC.2009.28The newly emerging many-core-on-a-chip designs have renewed an intense interest in parallel processing. By applying Amdahl's formulation to the programs in the PARSEC and SPLASH-2 benchmark suites, we find that most applications may not have sufficient ...
- research-articleApril 2008
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
IEEE Transactions on Computers (ITCO), Volume 57, Issue 4April 2008, Pages 472–480https://doi.org/10.1109/TC.2007.70822In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type of irreducible polynomials. We derive explicit formulae for the space and ...
- research-articleMarch 2008
An Efficient Data-Distribution Mechanism in a Processor-In-Memory (PIM) Architecture Applied to Motion Estimation
IEEE Transactions on Computers (ITCO), Volume 57, Issue 3March 2008, Pages 375–388https://doi.org/10.1109/TC.2007.70818In general, the main purpose for using PIM modules is to dramatically increase the Data-Level Parallelism (DLP) and avoid the limited issue rate of current systems (even when they include SIMD extensions) caused by the limited data bandwidth and ...
- research-articleMarch 2008
Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
IEEE Transactions on Computers (ITCO), Volume 57, Issue 3March 2008, Pages 289–302https://doi.org/10.1109/TC.2007.70815We present an innovative methodology for accelerating the elliptic curve point formulae over prime fields. This flexible technique uses the substitution of multiplication with squaring and other cheaper operations, by exploiting the fact that field ...