Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Saadat Pourmozafari"'
Publikováno v:
Computer and Knowledge Engineering, Vol 4, Iss 1, Pp 25-34 (2021)
Full adder is one of the essential circuits among the various processing elements used in VLSI and other technologies circuits, because they are mainly employed in other arithmetic circuits, such as multi-digit adders, subtractors, and multipliers. T
Externí odkaz:
https://doaj.org/article/8476f9713f6f4348b635351f506fbad4
Publikováno v:
EDCC
Fault tree analysis is one of the most widely used methods in reliability calculation and failure probability analysis. Although fault tree analysis is a popular method, its simulation is time-consuming. Therefore, speeding up fault tree simulations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a8049f189a779c886ba5c3f7e495014
https://doi.org/10.1109/edcc.2019.00019
https://doi.org/10.1109/edcc.2019.00019
Publikováno v:
Journal of Circuits, Systems and Computers. 28:1950207
Carbon nanotube field-effect transistors (CNTFETs) are excellent candidates for the replacement of traditional CMOS circuits. One of the most important modules in many arithmetic circuits is multiplier. Sometimes multipliers may occupy more area as w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9861201d4f95a10de236c798d43289ff
https://doi.org/10.1142/s0218126619502074
https://doi.org/10.1142/s0218126619502074
Publikováno v:
Journal of Circuits, Systems and Computers. 20:531-548
Modular calculations are widely used in many applications, especially in public key cryptography. Such operations are very time consuming, due to their long operands. To improve the performance of these calculations, many methods have been introduced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a98312c40c033da4ec218c9974aad991
https://doi.org/10.1142/s0218126611007438
https://doi.org/10.1142/s0218126611007438
Publikováno v:
IEICE Electronics Express. 7:513-519
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem and other cryptosystems with modular operations. Radix-2 version of this algorithm is simple and fast in hardware implementations. In this paper t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31281ea53d763652611691b98137d6c0
https://doi.org/10.1587/elex.7.513
https://doi.org/10.1587/elex.7.513
Publikováno v:
COMPUTING AND INFORMATICS; Vol 29, No 5 (2010): Computing and Informatics; 849-880
There are many architectures for RSA hardware implementation which improve its performance. Two main methods for this purpose are Montgomery and RNS. These are fast methods to convert plaintext to ciphertext in RSA algorithm with hardware implementat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=issn13359150::83cbde77df8bf0cbb1031b17f68477e9
http://www.cai.sk/ojs/index.php/cai/article/view/116
http://www.cai.sk/ojs/index.php/cai/article/view/116
Publikováno v:
ITNG
Basic operations of public key cryptography are multiplication and exponentiation. Because of long operand length, their processing is very time consuming operations. The basic of all of these operations is multi operand addition. To improve this ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3793c946bef6da9e47aaedbee26cd6a1
https://doi.org/10.1109/itng.2008.32
https://doi.org/10.1109/itng.2008.32
Publikováno v:
ITNG
Modulo 2n + 1 and 2n - 1 multiplication plays an important role in residue number systems. In this paper two efficient methods for converting the input number to these moduli are presented. One of them has less area than the other but the second one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::344908dbdb0999a5960728a2259eda2d
https://doi.org/10.1109/itng.2006.60
https://doi.org/10.1109/itng.2006.60
Publikováno v:
Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004..
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several architectures for speed up its calculations. In this paper, we use carry sav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e9b946a7a7011c61cbe48285aa3cac6
https://doi.org/10.1109/icm.2004.1434229
https://doi.org/10.1109/icm.2004.1434229
Publikováno v:
ITCC (1)
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several improvements for making it suitable for hardware implementation. Radix-2 ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dbcc6c47306499838b95f2ec241e656
https://doi.org/10.1109/itcc.2005.204
https://doi.org/10.1109/itcc.2005.204