Rajendra S. Katti

Learn More
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 user anonymity. Their protocol addresses a weakness in the protocol proposed by Wu and Hsu. Unfortunately,(More)
Security for multicast communication by mutual (sender and receiver) authentication is a challenging problem in the smart grid given the unique constraints in communication bandwidth, computation time, and computational resources of field devices. Traditional public-key infrastructure based digital signature schemes (such as RSA) cannot be naively adapted(More)
–In this paper we present a new architecture for linear feedback shift registers (LFSR) that produce the output of several clock cycles at once. This enables the frequency of operation to be reduced by a factor equal to the number of outputs produced at a time. This in turn enables the reduction of the power-supply voltage. These two factors dramatically(More)
Elements of a finite field, GF ð2Þ, 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 multiplier. Such multipliers are used in error control coding and cryptography. We consider rings modulo trinomials and(More)
This paper investigates achieving fault tolerance by adaptive remapping in the context of Networks on Chip. The problem of dynamic application remapping is formulated and an efficient algorithm is proposed to address single and multiple PE failures. The new algorithm can be used to dynamically react and recover from PE failures in order to maintain system(More)
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 greater than the output of the second LCG, and a bit “0” is output otherwise. Breaking this scheme would require(More)
Two new signed binary representations are presented that simplify hardware or software necessary in elliptic curve crytosystems. Simplified algorithms are presented for computing the new binary representations. This speeds up elliptic cryptosystems. The algorithms are useful for smart card applications and digital signature verification applications. The(More)
Linear congruential generators (LCGs) of the form xi+1 = axi + b(mod m), have been used to generate pseudorandom numbers. However these generators have been known to be insecure. This implies that if a small sequence of numbers generated by an LCG is known then it is possible to predict the remaining numbers in the sequence that will be generated. We(More)
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 precomputed test data. No structural information of the IP cores is required by the encoding procedure. A(More)