mynode/packages/lib/services/e2ee/ppk/webCrypto/buildRsaCryptoProvider.test.ts

import { webcrypto } from 'node:crypto';
import buildRsaCryptoProvider from './buildRsaCryptoProvider';
import { PublicKeyAlgorithm } from '../../types';


describe.each([
	{ algorithm: PublicKeyAlgorithm.RsaV2 },
	{ algorithm: PublicKeyAlgorithm.RsaV3 },
])('buildRsaCryptoProvider (%j)', ({ algorithm }) => {
	const rsaProvider = buildRsaCryptoProvider(algorithm, webcrypto);

	// The default error message when a message is larger than the maximum length
	// can be confusing. Verifies that a better message is provided:
	test('should encrypt data up to the maximum length, then throw', async () => {
		const { keyPair, keySize: keySizeBits } = await rsaProvider.generateKeyPair();

		// Should handle the case where given empty input
		const keyLengthBytes = keySizeBits / 8;
		expect(await rsaProvider.encrypt('', keyPair)).toHaveLength(keyLengthBytes);

		const maximumLength = rsaProvider.maximumPlaintextLengthBytes;
		expect(maximumLength).toBeGreaterThanOrEqual(190);
		for (let length = 1; length <= maximumLength; length++) {
			const hexData = Buffer.alloc(length).toString('hex');
			// Verify that it encrypts without throwing
			const encrypted = await rsaProvider.encrypt(hexData, keyPair);
			expect(encrypted.length).toBeGreaterThanOrEqual(keyLengthBytes);
		}

		for (let length = maximumLength + 1; length <= maximumLength * 2; length++) {
			const hexData = Buffer.alloc(length).toString('hex');
			await expect(() => rsaProvider.encrypt(hexData, keyPair)).rejects.toThrow(/Data too long/);
		}
	});

	test('output should not contain the input (medium-length input)', async () => {
		const { keyPair } = await rsaProvider.generateKeyPair();

		for (const hexInput of ['123456789aa', '111aaaabbbbccccddddaa', '567890aaa']) {
			expect(await rsaProvider.encrypt(hexInput, keyPair)).not.toContain(hexInput);
			expect(await rsaProvider.encrypt(hexInput, keyPair)).not.toContain(
				Buffer.from(hexInput, 'hex').toString('base64'),
			);
		}
	});
});