Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Dan Boneh's courersa lecture on format preserving encryption at 5.50 mins , talks about truncating a PRF on n bits to PRF on t bits.

The approach is by appending (n-t) zeros to input t bits then applying AES on n bits and truncating it back to t bits . He says there are better ways to do it but does not mention how . anybody has idea on better ways to truncating PRF on t bits when t << n .

share|improve this question
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.