Results 311 to 320 of about 10,903,755 (367)

Efficient Hardware Implementation of 256-bit ECC Processor Over Prime Field

European Conference on Cognitive Ergonomics, 2019
Exchange of private information over the public domain is very much susceptible to unauthorized access, therefore this necessitates the need for a cryptosystem to ensure the protection of information against forthcoming threats.
Md.Shahinur Rahman, Md. Selim Hossain, Enamul Hasan Rahat, Debopriya Roy Dipta, Hossain Mansur Resalat Faruque, F. Fattah   +5 more
semanticscholar   +1 more source

Testing Low-Degree Polynomials over Prime Fields

45th Annual IEEE Symposium on Foundations of Computer Science, 2004
AbstractWe present an efficient randomized algorithm to test if a given functionf: 𝔽→ 𝔽p(wherepis a prime) is a low‐degree polynomial. This gives a local test for Generalized Reed‐Muller codes over prime fields. For a given integertand a given real ε > 0, the algorithm queriesfatO($ O({{1}\over{\epsilon}}+t.p^{{2t \over p-1}+1}) $) points to ...
Jutla, Charanjit S., Patthak, Anindya C., Rudra, Atri, Zuckerman, David   +3 more
openaire   +2 more sources

33us, 94uJ Optimal Ate Pairing Engine on BN Curve over 254b Prime Field in 65nm CMOS FDSOI

International Symposium on Security in Computing and Communications, 2019
We have designed optimal ate paring engine on BN curve over 254bit prime field in 65nm CMOS FDSOI process. Algorithm is broken down into 2nd extension of the prime field (Fp2) and optimized for pipelined multiplier of Fp2, results in global optimum ...
M. Ikeda, Tadayuki Ichihashi, H. Awano
semanticscholar   +1 more source

A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime field

International journal of circuit theory and applications, 2018
This workpresents a novel high‐speed redundant‐signed‐digit (RSD)‐based elliptic curve cryptographic (ECC) processor for arbitrary curves over a general prime field. The proposed ECC processor works for any value of the prime number and curve parameters.
Y. A. Shah, Khalid Javeed, Shoaib Azmat, Xiaojun Wang   +3 more
semanticscholar   +1 more source

Hardware Implementation of Text Encryption using Elliptic Curve Cryptography over 192 bit Prime Field

International Conference on Advances in Computing, Communications and Informatics, 2018
With the continuous evolution of the global internet, the security of exchanging information has become increasingly serious. Many malicious entities can retrieve the valuable information via an unsecured medium.
M. Jaiswal, K. Lata
semanticscholar   +1 more source

Normal Rational Curves Over Prime Fields

Designs, Codes and Cryptography, 1997
A \(k\)-arc of \(PG(n,q)\), with \(k \geq n+1\), is set of \(k\) points of \(PG(n,q)\) such that no \(n+1\) of them belong to a hyperplane. Standard examples of \((q+1)\)-arcs of \(PG(n,q)\) are the normal rational curves. The author characterizes the normal rational curves in \(PG(n,p)\) for \(p\) prime and \(2 \leq n \leq p-2\) as the only \((p+1 ...
openaire   +1 more source

Prime Tuples in Function Fields

2016
How many prime numbers are there? How are they distributed among other numbers? These are questions that have intrigued mathematicians since ancient times. However, many questions in this area have remained unsolved, and seemingly unsolvable in the forseeable future.
openaire   +2 more sources

Affine extractors over prime fields

Combinatorica, 2011
An affine extractor is a map from the \(n\)-dimensional vector space over a finite field to the field that is balanced on every affine subspace of sufficiently large dimension. Affine extractors have been studied by \textit{A.~Gabizon} and \textit{R.~Raz} [Combinatorica 28, No.
openaire   +2 more sources

Kummer for Genus One Over Prime-Order Fields

Journal of Cryptology, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karati, Sabyasachi, Sarkar, Palash
openaire   +2 more sources

NORM-EUCLIDEAN CYCLIC FIELDS OF PRIME DEGREE

International Journal of Number Theory, 2012
Let K be a cyclic number field of prime degree ℓ. Heilbronn showed that for a given ℓ there are only finitely many such fields that are norm-Euclidean. In the case of ℓ = 2 all such norm-Euclidean fields have been identified, but for ℓ ≠ 2, little else is known. We give the first upper bounds on the discriminants of such fields when ℓ > 2.
openaire   +2 more sources