passwordmaker-rs - A Rust reimplementation of the PasswordMaker Pro password generation logic.

	Commit message (Collapse)	Author	Age	Files	Lines
*	Merge branch 'main' into feature/heap-allocation-free-base-conversion	Andreas Grois	2022-10-24	1	-1/+1
\|\
\| *	Improve long division performance.	Andreas Grois	2022-10-24	1	-1/+1
\| \| \| \| \| \| \| \| \| \| \| \|	In PasswordMaker, the numbers that are fed into long division can only decrease. Therefore, skipping leading zeros is a rather reasonable improvement.
\| *	Make some asserts debug_asserts. Add more benches.	Andreas Grois	2022-10-19	1	-4/+4
\| \| \| \| \| \| \| \| \| \|	Now that work on performance has started, accurate readings are important.
* \|	Add precomputed constants for common cases.	Andreas Grois	2022-10-23	5	-12/+92
\| \| \| \| \| \| \| \| \| \| \| \|	There are now 2 features that control the amount of precomputed constants. They can either be 0, 12, or 256. Most users will likely want to go with the 12, so this is the default feature.
* \|	Rename "potency" to "power", the English term.	Andreas Grois	2022-10-23	4	-51/+51
\| \| \| \| \| \| \| \| \| \|	It seems English doesn't use the word potency in this context, but rather uses power.
* \|	Precompute power+exponent for iterative conversion	Andreas Grois	2022-10-23	4	-75/+191
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	The maximum power of the base that can fit into a given data type is constant. There's no point in computing it at runtime, if we can just store it in a compile-time constants array. The code isn't the most beautiful, but that's mostly because Rust const functions are still a bit limited. One function was duplicated, because it was easy to get a slow version to compile in const context, and const context doesn't really care...
* \|	Add more unit tests to iterative_conversion.	Andreas Grois	2022-10-22	1	-23/+206
\| \|
* \|	Make n-digit division performing.	Andreas Grois	2022-10-22	1	-24/+18
\| \| \| \| \| \| \| \| \| \| \| \|	The handling of overflows was non-performing before. Now it's performing and correcting. This lets us skip a less-than check for N-digit numbers, causing a slight performance improvement.
* \|	Minor code cleanup. No performance impact.	Andreas Grois	2022-10-22	1	-28/+37
\| \|
* \|	Code cleanup and addition of unit tests.	Andreas Grois	2022-10-22	1	-78/+124
\| \|
* \|	Fix trait visibility.	Andreas Grois	2022-10-21	2	-2/+2
\| \|
* \|	Exponential search for largest potency.	Andreas Grois	2022-10-21	3	-8/+110
\| \| \| \| \| \| \| \| \| \|	Speeds up the 20 and 32 byte cases. Has slightly negative impact for 16 byte case.
* \|	Macro for single-digit-division.	Andreas Grois	2022-10-20	1	-37/+37
\| \| \| \| \| \| \| \|	Just to remove code duplication.
* \|	Minor: Shift Operation optimization.	Andreas Grois	2022-10-20	1	-10/+4
\| \|
* \|	Change normalization of Knuth division to shift.	Andreas Grois	2022-10-19	1	-6/+38
\| \| \| \| \| \| \| \|	That's a lot faster than division.
* \|	Add many-numbers test for long division.	Andreas Grois	2022-10-19	1	-6/+67
\| \|
* \|	Draft of iterative_conversion.	Andreas Grois	2022-10-18	6	-198/+100
\| \|
* \|	First draft of (untested) iterative conversion.	Andreas Grois	2022-10-18	6	-36/+628
\|/
*	Fix Rust 1.52 compat.	Andreas Grois	2022-10-11	1	-3/+2
\|
*	Refactor base_conversion. Fix hmac byte bug.	Andreas Grois	2022-10-11	3	-0/+215
	Moved the basis conversion into a submodule, to ease the upcoming rewrite. Add a couple of new integration tests. Fix a bug caused by misreading the PasswordMaker Pro HMAC code.