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?
Added some references to the problem description.
Sum all integers from 1 to 2^n
Whether the input is vector?
Doubling elements in a vector
Add two numbers
Optimal Asymmetric Encryption Padding of message for RSA Cryptography
Convert base 10 to base x (2-16)
Output the Montgomery Form of the Input Matrix
Find the treasures in MATLAB Central and discover how the community can help you!
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