Results 331 to 340 of about 9,865,590 (355)

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

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

Asynchronous-Symmetric Channel-Hopping Sequences Over Prime Field for Cognitive Radio Networks

IEEE Communications Letters, 2018
In this letter, two families of asynchronous-symmetric channel-hopping (CH) sequences over prime field are constructed. With straightforward construction algorithms, they provide a flexible balance between adjustable cardinality, full degree-of ...
Ming-hsuan Chiang, Guu-chang Yang, Chih-Feng Chiang, W. Kwong   +3 more
semanticscholar   +1 more source

A Tiny Coprocessor for Elliptic Curve Cryptography over the 256-bit NIST Prime Field

International Conference on VLSI Design, 2016
Elliptic curve cryptography (ECC) over prime fields offers a wide range of portability since the underlying arithmetic operations that are performed over integers can be supported by general purpose computing devices.
Jeroen Bosmans, S. Roy, K. Järvinen, I. Verbauwhede   +3 more
semanticscholar   +1 more source

FPGA based efficient Elliptic curve cryptosystem processor for NIST 256 prime field

IEEE Region 10 Conference, 2016
In this work, we propose a very efficient Elliptic curve cryptosystem processor for NIST 256 prime field. The proposed crypto processor includes sub blocks to perform modular arithmetic in the finite field which are addition, subtraction, multiplication ...
N. Shylashree, V. Sridhar, Deepthi Patawardhan   +2 more
semanticscholar   +1 more source

Tile before multiplication: An efficient strategy to optimize DSP multiplier for accelerating prime field ECC for NIST curves

Design Automation Conference, 2014
High speed DSP blocks present in the modern FPGAs can be used to implement prime field multiplication to accelerate Elliptic Curve scalar multiplication in prime fields.
Debapriya Basu Roy, Debdeep Mukhopadhyay, Masami Izumi, J. Takahashi   +3 more
semanticscholar   +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

An FPGA implementation of NIST 256 prime field ECC processor

International Conference on Electronics, Circuits, and Systems, 2013
In this paper, we propose a new Application Specific Instruction-set (ASIP) ECC processor based on Redundant Signed Digit representation with a novel Iterative-Recursive Karatsuba multiplier.
Hamad Marzouqi, M. Al-Qutayri, K. Salah
semanticscholar   +1 more source

STATISTICS OF PRIME DIVISORS IN FUNCTION FIELDS

International Journal of Number Theory, 2009
We show that the prime divisors of a random polynomial in 𝔽q[t] are typically "Poisson distributed". This result is analogous to the result in ℤ of Granville [1]. Along the way, we use a sieve developed by Granville and Soundararajan [2] to give a simple proof of the Erdös–Kac theorem in the function field setting. This approach gives stronger results
openaire   +2 more sources

Key generation based on elliptic curve over finite prime field

International Journal of Electronic Security and Digital Forensics, 2012
With the explosion of networks and the huge amount of data transmitted along, securing data content is becoming more and more important. Data encryption is widely used to ensure security in open networks, like the internet.
S. M. C. Vigila, K. Muneeswaran
semanticscholar   +1 more source