I have read that difficulty in breaking many algorithms are based either on Factorization or discrete logarithm. I am reading about schemes that are similar to RSA which make use of integer factorization and Schnorr scheme, which is based on discrete logarithm problem.
My idea is to create signature based on any of these schemes. I am using this on embedded system, where the limitations are
- Less computing power as compared to Laptop/Desktop
- Amount of data sent between parties is less; may be 128 bits of messages
- Data allowed for signature is also less; usually 64 to 128 bits
Considering this which ones is relatively difficult for the attacker?