Results 161 to 170 of about 3,908 (215)

Spatiotemporal video of blood-brain barrier disruption in neuroinflammatory disorders. [PDF]

Front Physiol
Xu Y, Zhang Z, Feng K.
europepmc   +1 more source

Parametric action of homomorphic image of modular group and it's application in image encryption. [PDF]

Sci Rep
Rafiq A, Bibi S, Abbasi AZ, Ali TS, Abdullah N, Becheikh N, Ghachem K, Hassen W.   +7 more
europepmc   +1 more source

Research on deep learning architecture optimization method for intelligent scheduling of structural space. [PDF]

Sci Rep
Ying W, Hui L.
europepmc   +1 more source

A Secure and Efficient Authentication Scheme with Privacy Protection for Internet of Medical Things. [PDF]

Sensors (Basel)
Xu F, Wu J, An Q, Ziaur R.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Systolic modular multiplication

IEEE Transactions on Computers, 1993
A systolic array for modular multiplication is presented using the ideally suited algorithm of P.L. Montgomery (1985). Throughput is one modular multiplication every clock cycle, with a latency of 2n+2 cycles for multiplicands having n digits. Its main use would be where many consecutive multiplications are done, as in RSA cryptosystems. >
exaly   +2 more sources

An RNS modular multiplication algorithm

2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS), 2013
An RNS implementation of Barrett's modular multiplication algorithm is presented in this paper. Existing algorithms for RNS modular multiplication employ Montgomery's technique. An algorithmic comparison with such state-of-the-art solutions shows that the proposed algorithm may reduce the total number of modular multiplications per RNS modular ...
Thanos Stouraitis
exaly   +2 more sources

Modular multiple dispatch with multiple inheritance

Proceedings of the 2007 ACM symposium on Applied computing, 2007
Overloaded functions and methods with multiple dispatch are useful for extending the functionality of existing classes in an object-oriented language. However, such functions introduce the possibility of ambiguous calls that cannot be resolved at run time, and modular static checking that such ambiguity does not exist has proved elusive in the presence
Eric E. Allen, J. J. Hallett, Victor Luchangco, Sukyoung Ryu, Guy L. Steele Jr.   +4 more
openaire   +1 more source

A Fast Modular Multiplication Method

2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2010
Fast execution of modular multiplication is crucial to speed-up public key cryptography applications. This paper presents a modular multiplication method that exploits high-speed multiply-accumulate instructions supported in modern general-purpose architectures.
Ali Sentürk, Mustafa Gök
openaire   +1 more source

Bipartite Modular Multiplication Method

IEEE Transactions on Computers, 2008
This paper proposes a new modular multiplication method that uses Montgomery residues defined by a modulus M and a Montgomery radix R whose value is less than the modulus M. This condition enables the operand multiplier to be split into two parts that can be processed separately in parallel - increasing the calculation speed.
Marcelo E. Kaihara, Naofumi Takagi
openaire   +1 more source

Architectures for Fast Modular Multiplication

2011 14th Euromicro Conference on Digital System Design, 2011
Modular multiplication is the key ingredient needed to realize most public-key cryptographic primitives. In a modular setting, multiplications are carried in two steps: namely a usual integer arithmetic followed by a reduction step. Progress in any of these steps naturally improves the modular multiplication but it is not possible to interleave the ...
Ahmet Aris, Siddika Berna Örs, Gökay Saldamli   +2 more
openaire   +1 more source