RKR.V. Kamala

R.V. Kamala

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


R.V. Kamala has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • High-Throughput Montgomery Modular Multiplication

    by R.V. Kamala, M.B. Srinivas

    The efficiency of public key encryption schemes like RSA and elliptic curve cryptography can be improved using fast modular multiplication schemes. In this paper, the authors propose an efficient Montgomery modular multiplication technique that employs multi-bit shifting and carry-save addition to perform long-integer arithmetic and hence conventional lengthy additions required at each stage are avoided. The corresponding hardware realization is optimal in terms of delay and offers high data throughput compared to the recently proposed designs while it occupies slightly more area. The optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. The design has been evaluated on Virtex2 series FPGA for practical bit lengths of 512,1024 and 2048 bit


  • Modified Montgomery Modular Inversion with Reduced Number of Multiplications

    by R.V. Kamala, M.B. Srinivas

    In this paper, a modified algorithm to compute Montgomery modular Inverse that requires less number of Montgomery modular multiplications compared to the best known methods in literature is proposed. A method is also suggested for computing the Montgomery inverse using a modular multiplication algorithm recently proposed by Rainer et al. to compute the modular product. Our approaches are optimal in terms of computational delay and the practical efficiency has been evaluated for an operand length of 521-bit that is of interest to practical cryptographic applications. The proposed algorithms are expected to be of eminent importance for high-speed arithmetic