this looks like a very cool problem, perhaps a bit of a summary description of the standard (c.f. 27-page doc) may help make it a bit more enticing for curious but non-crypto-oriented people like myself?
Remove the vowels
Maximum running product for a string of numbers
Test if a Number is a Palindrome without using any String Operations
Determine if input is a Narcissistic number
Combinations using Stirling numbers of the second kind
Optimal Asymmetric Encryption Padding decoding of message for RSA Cryptography
Mask Generation Function (MGF1) for PKCS #1 Standard utilizing Optimal Asymmetric Encryption Padding for RSA Cryptography
Montgomery Reduction Algorithm (REDC)
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office