On an implementation of the Mohan-Adiga algorithm

Authors:
Gisela Meister
Affiliations:
-
Venue:
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Year:
1991

Citing 4
Cited 1

A smart card implementation of the Fiat-Shamir identification scheme

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Factoring with two large primes (extended abstract)

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Precautions taken against various potential attacks in ISO/IEC DIS 9796: digital signature scheme giving message recovery

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM

RSA moduli with a predetermined portion: techniques and applications

ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several asymmetric cryptographic systems such as the RSA system [6] require modular exponentiation of large integers. This paper discusses a modular routine described in [2], which is suited for smart cards. It is based on the Mohan-Adiga algorithm [5]. This algorithm is comparatively fast, if the leading half of the bits of the modulus is 1. It will be shown that this restriction has some severe implications on the number of suitable primes and on the security of the system. If one decrements the number of leading 1's then the security level of the system is increased while the speed is decreased.