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.
First N Perfect Squares
Project Euler: Problem 10, Sum of Primes
Sum the Infinite Series
Simple problem creating a function from an abstract specification.
Make a vector of prime numbers
Sum of all the divisors of n
Determine RSA keys (public and private) given two prime number character strings (p and q)
Elliptic Curve Cryptography (ECC) Point Addition
AES MixColumns() Transformation
Area of Triangle with Oblique Coordinates
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