About the numbers of the injective and of the super-increasing vectors and some particularities of the strong modular multiplication

The numbers of injective and of super-increasing vectors appeared in knapsack cryptosystems are estimated. Besides, it is shown that the set of increasing injective vectors is uniformly covered by the vectors received from the super-increasing vectors through the strong modular multiplication and the ascending ordering the vector elements.