Loading...
Search for:
crypto-systems
0.011 seconds
Dual-basis superserial multipliers for secure applications and lightweight cryptographic architectures
, Article IEEE Transactions on Circuits and Systems II: Express Briefs ; Vol. 61, Issue. 2 , February , 2014 , pp. 125-129 ; ISSN: 15497747 ; Mozaffari Kermani, M ; Azarderakhsh, R ; Lee, C. Y ; Sharif University of Technology
Abstract
Cryptographic algorithms utilize finite-field arithmetic operations in their computations. Due to the constraints of the nodes which benefit from the security and privacy advantages of these algorithms in sensitive applications, these algorithms need to be lightweight. One of the well-known bases used in sensitive computations is dual basis (DB). In this brief, we present low-complexity superserial architectures for the DB multiplication over GF (2m). To the best of our knowledge, this is the first time that such a multiplier is proposed in the open literature. We have performed complexity analysis for the proposed lightweight architectures, and the results show that the hardware complexity...
A new public key encryption scheme equivalent to factoring
, Article 2007 International Conference on Security and Management, SAM'07, Las Vegas, NV, 25 June 2007 through 28 June 2007 ; 2007 , Pages 546-552 ; 1601320485 (ISBN); 9781601320483 (ISBN) ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
2007
Abstract
In this paper, we propose a new public key encryption scheme similar to ElGamal cryptosystem. We prove that it is provably secure, based on intractability of factoring problem and intuitively show that our scheme is as least as secure as RSA and ElGamal cryptosystems. We will also show that decryption in our scheme could be done four times faster than ElGamal