نتایج جستجو برای: same base multiplication

تعداد نتایج: 925821  

2015
Faris Kadi Torben Winzer Andreas Knorr Ermin Malic

We present a microscopic study on the impact of doping on the carrier dynamics in graphene, in particular focusing on its influence on the technologically relevant carrier multiplication in realistic, doped graphene samples. Treating the time- and momentum-resolved carrier-light, carrier-carrier, and carrier-phonon interactions on the same microscopic footing, the appearance of Auger-induced ca...

2002
Wieland Fischer Jean-Pierre Seifert

We present a novel technique which allows a virtual increase of the bitlength of a crypto-coprocessor in an efficient and elegant way. The proposed algorithms assume that the coprocessor is equipped with a special modular multiplication instruction. This instruction, called MultModDiv(A,B,N) computes A ∗ B mod N and (A ∗B)/N . In addition to the doubling algorithm, we also present two conceivab...

2016
Anita Aghaie Stanislaw P Radziszowski

Scalar point multiplication has encountered significant attention in Elliptic curve cryptography (ECC) which is gaining popularity due to providing same level security with smaller key sizes compared to traditional cryptosystems, such as Ron Rivest, Adi Shamir, and Leonard Adleman (RSA). Point multiplication (KP) in ECC is basically performed on point addition and point doubling on elliptic cur...

2004
Sashisu Bajracharya Deapesh Misra

We propose to implement the Mesh Design for implementing the Number Field Sieve particularly which will be used to perform the Matrix step to do Matrix Multiplication. Mesh approach is proposed by Daniel Bernstein which brought down the cost of Number Field Sieve by significant factor especially in the matrix step[5]. The computation is done in the mesh-connected array of processors, which util...

2014
Yogesh Singh Rathore Dharminder Kumar

Matrix Multiplication is one of the most commonly used algorithm in many application areas like Sonar Systems, Relational Database Management System and other applications like algebra etc. Matrix Multiplication is quite difficult when it tends to infinity. In this paper we study and evaluate the execution time of simple matrix multiplication and optimized matrix multiplication with OpenMP on m...

M. A. Mansouri-Birjandi M. Soroosh

In this paper, we calculate electron and hole impactionization coefficients in In0.52Al0.48As using a Monte Carlo modelwhich has two valleys and two bands for electrons and holesrespectively. Also, we calculate multiplication factor for electronand hole initiated multiplication regimes and breakdown voltagein In0.52Al0.48As PIN avalanche photodiodes. To validate themodel, we compare our simulat...

Ameneh Malekzadeh Fatemeh Abiar Dil Khodabakhsh Niknam Marzieh Makvandi Mojtaba Baghernejad

Silica-bonded n-propyltriethylene-tetramine (SBNPTT) was found as an efficient solid base for the synthesis of 2-amino-5-oxo-5,6,7,8-tetrahydro-4H-chromenes. Chromene derivatives were obtained via the three-component condensation reaction of aromatic aldehydes, malononitrile, and dimedone at 80 oC under solvent-free conditions. The heterogeneous solid base showed much the same efficiency when u...

Journal: :IACR Cryptology ePrint Archive 2011
Sujoy Sinha Roy Chester Rebeiro Debdeep Mukhopadhyay Junko Takahashi Toshinori Fukunaga

The paper proposes a τ−NAF method for scalar multiplication on Koblitz curves, which requires asymptotically 0.215m point additions in GF (2). For τ−NAF method, point quading operation (a→ a) is performed instead of point squarings. The proposed method is faster than normal τ−NAF method, which requires around m 3 point additions. However, like width w based τ−NAF methods, there is an overhead o...

2003
Fernando Tinetti Emilio Luque

This paper presents a natural and efficient implementation for the classical broadcast message passing routine which optimizes performance of Ethernet based clusters. A simple algorithm for parallel matrix multiplication is specifically designed to take advantage of both, parallel computing facilities (CPUs) provided by clusters, and optimized performance of broadcast messages on Ethernet based...

Journal: :CoRR 2017
Markus Bläser Matthias Christandl Jeroen Zuiddam

We show that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers. We do this by constructing two polynomials that vanish on all complex tensors with format four-by-four-by-four and border rank at most six, but that do not vanish simultaneously on any tensor with the same support as the two-by-two matrix multiplication tensor....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید