cardinal9999/cryptoquail

[outdated] A Python cryptography package with more features, simplicity, and quality.

My Profile

Scratch: @Fee-bee-fee-bay

My best repository is currently Pekin.

Stats

What I'm Working On:

Making a JavaScript version of Pekin.

cryptoquail's Issues

How can primegen.generate() run faster?

When I typed in primegen.generate(50, 50000) into IDLE, it took a few seconds to generate [50021, 50023, 50033, 50047].

How can I make the function faster?

ψ_hash returns a large output when "XOR folding".

When I type this into my Python compiler:

import cryptoquail.hash as hash_
print(hash_.ψ_hash("abcdefghijklmnopqrstuvwxyz1234567890!@#$%^&*()"))

It returns this:

b'\x03\x07\x03\x0f\x03\x07\x03\x1f\x03\x07\x03\x0f\x03\x03\x07\x03\x0f\ta\x07{\x0c\x01DEFGHIJKLMNOPQRSTUVWXYZ[\]\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x13\x04#\x06\x07\x08A\t\r\x0b\x0c'

However, if you run this code:

print(len(ψ_hash("abcdefghijklmnopqrstuvwxyz1234567890!@#$%^&*()")))

it returns 69. It is supposed to return 36, because that's the limit.

If you look at the source code, there is no if statement detecting long outputs and repeating the XOR fold.
I tried to repeat the XOR folding process if the length is greater than 36, but it raised an error.

Is there a way to shorten a long hash without causing a hash collision?