Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
RC4
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===RC4<sup>+</sup>=== RC4<sup>+</sup> is a modified version of RC4 with a more complex three-phase key schedule (taking about three times as long as RC4, or the same as RC4-drop512), and a more complex output function which performs four additional lookups in the S array for each byte output, taking approximately 1.7 times as long as basic RC4.<ref name ="rc4+">{{Citation |chapter=Analysis of RC4 and Proposal of Additional Layers for Better Security Margin |chapter-url=http://eprint.iacr.org/2008/396 |author1=Subhamoy Maitra |author2=Goutam Paul |title=Progress in Cryptology - INDOCRYPT 2008 |date=19 September 2008 |pages=27β39 |series=Lecture Notes in Computer Science |volume=5365 |publisher=Springer-Verlag |isbn=978-3-540-89753-8 |doi=10.1007/978-3-540-89754-5_3 |id=Cryptology ePrint Archive: Report 2008/396 |access-date=2011-11-04|url=http://eprint.iacr.org/2008/396.pdf |citeseerx=10.1.1.215.7178 }}</ref> <span style="color: green;">''All arithmetic modulo 256. ''<<'' and ''>>'' are left and right shift, ''β'' is exclusive OR''</span> '''while''' GeneratingOutput: i := i + 1 a := S[i] j := j + a Swap S[i] and S[j] <span style="color: green;">(''b := S[j]; S[j] := S[i]; S[i] := b;'')</span> c := S[i<<5 β j>>3] + S[j<<5 β i>>3] '''output''' (S[a+b] + S[cβ0xAA]) β S[j+b] '''endwhile''' This algorithm has not been analyzed significantly.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)