Suchergebnisse - parallel complexity of computations in finite fields

Low-Complexity Bit-Parallel Square Root Computation over GF(2^) for All Trinomials von Rodriguez-Henriquez, F., Morales-Luna, G., Lopez, J.

“… In this contribution, we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields …”
Volltext

Arithmetic Computation Using Self-Assembly of DNA Tiles: Point-Addition on Conic Curves over Finite Field GF(2^n) von Li, Yongnan, Xiao, Limin

“… This paper discusses how to accomplish point-addition, a basic operation in conic curves cryptosystem over finite field GF(2^n …”
Volltext

Parallel molecular computation of modular-multiplication with two same inputs over finite field GF(2n) using self-assembly of DNA tiles von Li, Yongnan, Xiao, Limin, Ruan, Li

“… Tile assembly model is a highly distributed parallel model of DNA computing. Finite field GF(2n) is one of the most commonly used mathematic sets for constructing public-key cryptosystem …”
Volltext

On the computation of rational solutions of underdetermined systems over a finite field von Giménez, Nardo, Matera, Guillermo, Pérez, Mariana, Privitelli, Melina

“… We design and analyze an algorithm for computing solutions with coefficients in a finite field Fq of underdetermined systems defined over Fq …”
Volltext

Bit-parallel finite field multipliers for irreducible trinomials von Imana, J.L., Sanchez, J.M., Tirado, F.

“… A new formulation for the canonical basis multiplication in the finite fields GF …”
Volltext

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants von Björklund, Andreas, Kaski, Petteri, Williams, Ryan

“… We present two new data structures for computing values of an n -variate polynomial P of degree at most d over a finite field of q elements …”
Volltext

On the computation of rational points of a hypersurface over a finite field von Matera, Guillermo, Pérez, Mariana, Privitelli, Melina

“… We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on “vertical strips …”
Volltext

High-Throughput Low-Complexity Unified Multipliers Over GF(2^) in Dual and Triangular Bases von Salarifard, Raziyeh, Bayat-Sarmadi, Siavash, Farmani, Mohammad

“… Multiplication is an essential operation in cryptographic computations. One of the important finite fields for such computations is the binary extension field …”
Volltext

Low space-complexity digit-serial dual basis systolic multiplier over Galois field GF(2m) using Hankel matrix and Karatsuba algorithm von Yan Hua, Ying, Lin, Jim-Min, Wun Chiou, Che, Lee, Chiou-Yng, Huan Liu, Yong

“… Multiplication is one important finite field arithmetic operation in cryptographic computations …”
Volltext

Parallel PWTD-Accelerated Explicit Solution of the Time-Domain Electric Field Volume Integral Equation von Yang Liu, Al-Jarro, Ahmed, Bagci, Hakan, Michielssen, Eric

“… A parallel plane-wave time-domain (PWTD)accelerated explicit marching-on-in-time (MOT …”
Volltext

Bit‐parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations von Mathe, Sudha Ellison, Boppana, Lakshmi

“… Cryptography in digital world must offer integrity and confidentiality using cryptographic algorithms which mainly involve multiplication operation in finite fields …”
Volltext

Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases von Haining Fan, Anwar Hasan, M.

“… Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using type …”
Volltext

Parallel Computation of Division over GF(2^n) Covering Divide-by-Zero Based on Tile Assembly Model von Li, Yongnan, Xiao, Limin

“… This paper proposes how to compute division over finite field GF(2 n ) that could cover the case of zero divisor based on tile assembly model …”
Volltext

Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography von Li, Jiakun, Wang, Weijiang, Zhang, Jingqi, Luo, Yixuan, Ren, Shiwei

“… The Montgomery Ladder algorithm used in PM is modified to a 4CC algorithm for better resource utilization and parallel computation …”
Volltext

Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m) von Hariri, A., Reyhani-Masoleh, A.

“… Multiplication and squaring are main finite field operations in cryptographic computations and designing efficient multipliers and squarers affect the performance of cryptosystems …”
Volltext

Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition von Chiou-Yng Lee, Meher, Pramod Kumar

“… Subquadratic multiplication algorithm has received significant attention of cryptographic hardware researchers for efficient implementation public-key …”
Volltext

Design of the Real-Time Single-Photodiode Digital Coherent Receiver Suitable for Free Space Optical Communication von Zhou, Keji, Cui, Sheng, Gu, Yunfeng, Tu, Yicong, Ke, Changjian, Liu, Deming

“… Coherent receivers have an exceptionally high sensitivity but their optical complexity and power consumption are too high, especially for the space-borne lasercom terminals …”
Volltext

Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials von Lee, Chiou-Yng, Lu, Erl-Huei, Lee, Jau-Yien

“… Then, two low-complexity bit-parallel systolic multipliers are presented based on the algorithm …”
Volltext

Resource-efficient and scalable solution to problem of real-data polyphase discrete Fourier transform channelisation with rational over-sampling factor von Jones, Keith John

“… The study describes the results of research carried out into the design of a parallel and resource-efficient solution to the real-data polyphase discrete Fourier transform (DFT), or PDFT …”
Volltext

Low Complexity Bit-P arallel Systolic P olynomial Basis Multiplier over Finite Fields GF (2 m ) von 이건직, Lee Keonjik

“… Multiplication is main finite field operation in cryptographic computations and designing efficient multiplier affect the performance of cryptosystems …”
Volltext