Zobrazeno 1 - 10
of 70
pro vyhledávání: '"R.S. Katti"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
R.S. Katti, Aida Vosoughi
Publikováno v:
IEEE Transactions on Information Forensics and Security. 7:895-903
Key-based interval splitting arithmetic coding (KSAC) has been proposed to improve the security of traditional arithmetic coding (AC). Chosen-plaintext attacks have been proposed for KSAC when the same key is used to encrypt different messages. In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63fa9d28ea0454080807bee67b6113ef
https://doi.org/10.1109/tifs.2012.2187514
https://doi.org/10.1109/tifs.2012.2187514
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 57:203-207
In this brief, we propose the generation of a pseudorandom bit sequence (PRBS) using a comparative linear congruential generator (CLCG) as follows. A bit ?1? is output if the first linear congruential generator (LCG) produces an output that is greate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aeb55aa34d78e4968ed632e4347e3ce0
https://doi.org/10.1109/tcsii.2010.2041813
https://doi.org/10.1109/tcsii.2010.2041813
Autor:
Joseph P. Brennan, R.S. Katti
Publikováno v:
Journal of the Franklin Institute. 346:10-16
Montgomery multiplication of two elements a and b of a finite field F q is defined as abr - 1 where r is a fixed field element in F q × . In this paper we define Montgomery multiplication of elements a ( x ) and b ( x ) in a polynomial ring modulo t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a5e8e4f16f6d1458f71b73b4d7138a9
https://doi.org/10.1016/j.jfranklin.2008.06.002
https://doi.org/10.1016/j.jfranklin.2008.06.002
Autor:
R.S. Katti, Xiaoyu Ruan
Publikováno v:
IEEE Transactions on Computers. 56:545-556
This paper presents a new compression technique for testing the intellectual property (IP) cores in system-on-chips. The pattern run-length compression applies the well-known run-length coding to equal and complementary consecutive patterns of the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b93f10004a743bec352749a207f43921
https://doi.org/10.1109/tc.2007.1007
https://doi.org/10.1109/tc.2007.1007
Autor:
R.S. Katti, X. Ruan
Publikováno v:
IEEE Transactions on Computers. 55:1300-1305
We present a new source coding scheme with smaller expected length than Shannon-Fano-Elias codes. The ordering of source symbols input to the proposed encoding algorithm can be arbitrary. We show that this property leads to exponential complexity for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fec202798f8ebb59bfa64f44b3f201c
https://doi.org/10.1109/tc.2006.155
https://doi.org/10.1109/tc.2006.155
Autor:
Kumar V. Mangipudi, R.S. Katti
Publikováno v:
Computers & Security. 25:420-425
Anonymity is a desirable security feature in addition to providing user identification and key agreement during a user's login process. Recently, Yang et al., proposed an efficient user identification and key distribution protocol while preserving us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6653c32007278bc0f8458080c4436f73
https://doi.org/10.1016/j.cose.2006.05.002
https://doi.org/10.1016/j.cose.2006.05.002
Publikováno v:
IEEE Transactions on Circuits and Systems I: Regular Papers. 53:1487-1495
In this paper, we present a new low-power architecture for linear feedback shift registers (LFSRs) that produces the output of several clock cycles of a serial LFSR at once while reducing the activity factors of the flip-flop outputs. The frequency o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::413654ed908a10693fe68e23e9fcb0f7
https://doi.org/10.1109/tcsi.2006.877889
https://doi.org/10.1109/tcsi.2006.877889
Autor:
R.S. Katti, X. Ruan
Publikováno v:
IEEE Transactions on Computers. 54:124-131
The common computation in elliptic curve cryptography (ECC), aP + bQ, is performed by extending Shamir's method for the computation of the product of powers of two elements in a group. The complexity of computing aP + bQ is dependent on the joint wei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d6eb4ec204f1d6135b51a015e9b88cd
https://doi.org/10.1109/tc.2005.27
https://doi.org/10.1109/tc.2005.27
Autor:
R.S. Katti, Joseph P. Brennan
Publikováno v:
IEEE Transactions on Computers. 52:418-427
Elements of a finite field, GF(2/sup m/), are represented as elements in a ring in which multiplication is more time efficient. This leads to faster multipliers with a modest increase in the number of XOR and AND gates needed to construct the multipl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88598a49c42cdc2c8f948adf2faadb11
https://doi.org/10.1109/tc.2003.1190583
https://doi.org/10.1109/tc.2003.1190583