Results 31 to 40 of about 10,903,755 (367)

Chromatic priming in hemianopic visual fields

open access: yesExperimental Brain Research, 2003
In three monkeys made hemianopic by unilateral striate cortical ablation, in one normal monkey and in a human hemianope (GY), we measured reaction times to chromatic targets presented in the normal hemifield as a function of prior chromatic primes in the blind field. The first of our three tasks showed an unspecific priming effect in that the colour of
Cowey, A, Stoerig, P, Hodinott-Hill, I
openaire   +3 more sources

FPGA Implementation of High-Speed Area-Efficient Processor for Elliptic Curve Point Multiplication Over Prime Field

open access: yesIEEE Access, 2019
Developing a high-speed elliptic curve cryptographic (ECC) processor that performs fast point multiplication with low hardware utilization is a crucial demand in the fields of cryptography and network security. This paper presents field-programmable gate
Md. Mainul Islam   +4 more
semanticscholar   +1 more source

On the Distribution of Atkin and Elkies Primes [PDF]

open access: yes, 2011
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational points on E ...
Shparlinski, Igor E.   +1 more
core   +2 more sources

Comparative field performance evaluation of different type of Pusa Electric Power Units

open access: yesThe Indian Journal of Agricultural Sciences, 2022
Pusa developed three walk-behind type electric power units were evaluated in 9.96 ha area for tillage in polyhouse, secondary tillage, planking and weeding-cum interculture operations at research farm of ICAR-IARI during kharif and rabi 2020 and 2021 ...
UTPAL EKKA, S P SINGH, M K SINGH
doaj   +1 more source

Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field [PDF]

open access: yesInternational Symposium on Symbolic and Algebraic Computation, 2016
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the~Nth coefficient of an algebraic series uses differential equations and has arithmetic ...
Alin Bostan, G. Christol, P. Dumas
semanticscholar   +1 more source

A new quantum-safe multivariate polynomial public key digital signature algorithm

open access: yesScientific Reports, 2022
We propose a new quantum-safe digital signature algorithm called Multivariate Polynomial Public Key Digital Signature (MPPK/DS). The core of the algorithm is based on the modular arithmetic property that for a given element g, greater than equal to two ...
Randy Kuang   +2 more
doaj   +1 more source

Calculation of Fourier-Galois transforms in reduced binary number systems [PDF]

open access: yesКомпьютерная оптика, 2018
The paper proposes a new method for calculating Fourier-Galois transforms (number-theoretical transforms), which are a modular analog of the discrete Fourier transform.
Vladimir Chernov
doaj   +1 more source

An updated meta-analysis of the primed goal-organizational behaviour relationship

open access: yesRoyal Society Open Science, 2023
Environmental cues (e.g. achievement-related words and pictures) can prime/activate, in the absence of awareness, a mental representation of importance stored in memory. Chen et al.'s 2021 Applied Psychology: An International Review 70, 216–253.
Gary P. Latham   +3 more
doaj   +1 more source

Computation of discrete logarithms in prime fields [PDF]

open access: yesDesigns, Codes and Cryptography, 1991
Let \(p\) be a prime and \(g\), \(x\) integers. The computation of \(y\) such that \(y\equiv g^ x(\mod p)\), \(0\leq y\leq p-1\), is referred to as discrete exponentiation. Given \(p\), \(g\) and \(y\) the computation of \(x\) is referred to as the discrete logarithm problem.
LaMacchia, B. A., Odlyzko, A. M.
openaire   +1 more source

Ternary number systems in finite fields [PDF]

open access: yesКомпьютерная оптика, 2018
The work continues the author's previous study of positional number systems in finite fields. The paper considers ternary number systems and arithmetic operations algorithms for the representation of elements of finite fields in the so-called ternary ...
Vladimir Chernov
doaj   +1 more source

Home - About - Disclaimer - Privacy