Variably Modified Permutation Composition: Difference between revisions

Revision as of 07:30, 29 March 2019

Latest revision as of 10:22, 8 October 2024

(16 intermediate revisions by 13 users not shown)

Line 1:

{{Short description|Stream cipher}}

{{context|date=October 2009}}

'''VMPC''' ('''Variably Modified Permutation Composition''') for [[cryptography]] is a [[stream cipher]] similar to the

well known and popular cipher [[RC4]] designed by [[Ron Rivest]]. It was designed by Bartosz ZoltakŻółtak, presented in 2004 at the [[Fast Software Encryption]] conference. VMPC is a modification of the [[RC4]] cipher.<ref name=maximov>{{cite paperjournal |title=Two Linear Distinguishing Attacks on VMPC and RC4A and Weakness of RC4 Family of Stream Ciphers (Corrected) |author=Alexander Maximov |journal=Cryptology ePrint Archive |date=2007-02-22 |url=https://eprint.iacr.org/2007/070 }} (originally presented at FSE 2006 confernececonference)</ref>

The core of the cipher is the VMPC function, a transformation of ''n''-element [[permutation]]s defined as:

'''VMPC''' ('''Variably Modified Permutation Composition''') is a [[stream cipher]] similar to the

well known and popular cipher [[RC4]] designed by [[Ron Rivest]]. It was designed by Bartosz Zoltak, presented in 2004 at the [[Fast Software Encryption]] conference. VMPC is a modification of the [[RC4]] cipher.<ref name=maximov>{{cite paper |title=Two Linear Distinguishing Attacks on VMPC and RC4A and Weakness of RC4 Family of Stream Ciphers (Corrected) |author=Alexander Maximov |date=2007-02-22 |url=https://eprint.iacr.org/2007/070 }} (originally presented at FSE 2006 confernece)</ref>

The core of the cipher is the VMPC function, a transformation of n-element [[permutation]]s defined as:

'''for''' x '''from''' 0 '''to''' n-1:

g(x) = VMPC(f)(x) = f(f(f(x))+1)

The function was designed such that inverting it, i.e. obtaining {{mono|f}} from {{mono|g}}, would be a complex problem. According to computer simulations the average number of operations required to recover {{mono|f}} from {{mono|g}} for a 16-element permutation is about 2¹¹,; for 64-element permutation -, about 2⁵³; and for a 256-element permutation -, about 2²⁶⁰.{{Citation needed|date=September 2015}}

In 2006 at Cambridge University, Kamil Kulesza investigated the problem of inverting VMPC and concluded "results indicate that VMPC is not a good candidate for a cryptographic one-way function".<ref name="Kulesza2006">{{cite paperweb|last1=Kulesza|first1=Kamil|date= 2008-10-27|title=On Inverting the VMPC One-Way Function|url=http://www-old.newton.ac.uk/preprints/NI06009.pdf|accessdateaccess-date=9 February 2015}}</ref>

The VMPC function is used in an [[encryption]] algorithm -– the VMPC [[stream cipher]]. The algorithm allows for efficient in software implementations; to encrypt {{mono|L}} bytes of plaintext do:

<source lang="text" line>

n = 0

Repeat steps 3-8 L times:

s = P[ (s + P[n]) mod 256 ]

Output P[ (P[P[s]]+1) mod 256 ]

Temp = P[n]

P[n] = P[s]

P[s] = Temp #Swap(P[n], P[s])

n = (n + 1) mod 256

</source>

Where 256-element permutation {{mono|P}} and integer value {{mono|s}} are obtained from the encryption password using the VMPC-KSA (Key Scheduling Algorithm).

<span style="color: green;">''All arithmetic is performed modulo 256.''</span>

== VMPC-R ==

ni := 0

'''while''' GeneratingOutput:

j := S[j + S[i]]

'''output''' S[S[S[j]] + 1]

swap S[i] and S[j] <span style="color: green;">(''b := S[j]; S[j] := S[i]; S[i] := b)'')</span>

i := i + 1

'''endwhile'''

Where 256-element permutation {{mono|P}} and integer value {{mono|s}} are obtained from the encryption password using the VMPC-KSA (Key Scheduling Algorithm).

VMPC-R is a stream cipher derived from VMPC that uses a more complex

==References==