MULTI-S01: Difference between revisions
m minor fixes, mostly disambig links using AWB |
No edit summary |
||
| Line 5: | Line 5: | ||
Since the calculation consists of addition and multiplication over the [[finite field]], the algorithm is more suited to hardware implementation, although software implementation is still feasible. |
Since the calculation consists of addition and multiplication over the [[finite field]], the algorithm is more suited to hardware implementation, although software implementation is still feasible. |
||
MULTI-S01 with the PRNG [[Panama (cryptography)|Panama]] |
MULTI-S01 with the PRNG [[Panama (cryptography)|Panama]] was among the cryptographic techniques recommended for Japanese government use by [[CRYPTREC]] in 2003, however, has been dropped to "candidate" by CRYPTREC revision in 2013. It has also been submitted to [[International Organization for Standardization|ISO]]/[[International Electrotechnical Commission|IEC]] 18033 Part 4 which defines stream-cipher standards. |
||
The security of MULTI-S01 is based on that of underlying PRNG. If a secure PRNG is used, then the security of MULTI-S01 with respect to confidentiality and data integrity has been proven. As for the data integrity, the security proof is basically the same as one for [[Carter–Wegman MAC scheme]], which is proven to be information-theoretically secure. |
The security of MULTI-S01 is based on that of underlying PRNG. If a secure PRNG is used, then the security of MULTI-S01 with respect to confidentiality and data integrity has been proven. As for the data integrity, the security proof is basically the same as one for [[Carter–Wegman MAC scheme]], which is proven to be information-theoretically secure. |
||
Revision as of 02:32, 28 November 2013
In cryptography, MULTI-S01 (pronounced multi-ess-zero-one), is an encryption algorithm based on a pseudorandom number generator (PRNG). MULTI-S01 is an encryption scheme preserving both confidentiality and data integrity. The scheme defines a pair of algorithms; the encryption, the corresponding decryption with verification. Coupling with an efficient keystream generator, such as Panama, MUGI, and RC4, the algorithm efficiently encrypts a message in the manner of a single path process, i.e. online algorithm. The decryption function cannot be used in such manner for keeping whole resultant data until successful verification.
The keysize of MULTI-S01 is determined by which keystream generator to use. MULTI-S01 takes a security parameter which determines the upperbound probability of successful forgery.
Since the calculation consists of addition and multiplication over the finite field, the algorithm is more suited to hardware implementation, although software implementation is still feasible.
MULTI-S01 with the PRNG Panama was among the cryptographic techniques recommended for Japanese government use by CRYPTREC in 2003, however, has been dropped to "candidate" by CRYPTREC revision in 2013. It has also been submitted to ISO/IEC 18033 Part 4 which defines stream-cipher standards.
The security of MULTI-S01 is based on that of underlying PRNG. If a secure PRNG is used, then the security of MULTI-S01 with respect to confidentiality and data integrity has been proven. As for the data integrity, the security proof is basically the same as one for Carter–Wegman MAC scheme, which is proven to be information-theoretically secure.
References
- Soichi Furuya, Kouichi Sakurai, ``Single-path Authenticated-encryption Scheme Based on Universal Hashing, in Selected Areas in Cryptography, 9th Annual Workshop, SAC 2002, St. John's, Newfoundland, Canada, Aug. 2002, Revised Papers, ed. K. Nyberg and H. Heys, pp. 94–109, Lecture Notes in Computer Science vol. 2595, Springer-Verlag, 2002.
- Soichi Furuya, Dai Watanabe, Yoichi Seto, Kazuo Takaragi, ``Integrity-Aware Mode of Stream Cipher, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85-A no. 1, pp. 58–65, 2002.
