Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describe highly efficient constructions, XE and XEX, that turn a blockcipher E: K x {0, 1} n  → {0,1} into a takable blockcipher E: κ x T × {0, 1} n  → {0, 1} n  having tak space T = {0, 1} n  x ∥ where ∥ is a set of tuples of integers such as ∥ = [1.. 2 n/2 ] x [0.. 10]. When tak T is obtained from tak S by incrementing one if its numerical components, the cost to compute  T  K (M) having already computed some  S  K  (M') is one blockcipher call plus a small and constant number of elementary machine operations. Our constructions work by associating to the i th  coordinate of ∥ an element α i  ∈ F* 2 n and multiplying by α i  when one increments that component of the tak.  illustrate the use of this approach by refining the authenticated-encryption scheme OCB and the message authentication code PMAC, yielding variants of these algorithms that are simpler and faster than the original schemes, and yet have simpler proofs. Our results bolster the thesis of Liskov, Rivest, and Wagner [10] that a desirable approach for designing modes of operation is to start from a takable blockcipher.  elaborate on their idea, suggesting the kind of tak space, usage-discipline, and blockcipher-based instantiations that give rise to simple and efficient modes.
['Phillip Rogaway']
I am writing a research paper on a idea Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
[{"from": "human", "value": "I am writing a research paper on a idea Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describe highly efficient constructions, XE and XEX, that turn a blockcipher E: K x {0, 1} n  \u2192 {0,1} into a takable blockcipher E: \u03ba x T \u00d7 {0, 1} n  \u2192 {0, 1} n  having tak space T = {0, 1} n  x \u2225 where \u2225 is a set of tuples of integers such as \u2225 = [1.. 2 n/2 ] x [0.. 10]. When tak T is obtained from tak S by incrementing one if its numerical components, the cost to compute  T  K (M) having already computed some  S  K  (M') is one blockcipher call plus a small and constant number of elementary machine operations. Our constructions work by associating to the i th  coordinate of \u2225 an element \u03b1 i  \u2208 F* 2 n and multiplying by \u03b1 i  when one increments that component of the tak.  illustrate the use of this approach by refining the authenticated-encryption scheme OCB and the message authentication code PMAC, yielding variants of these algorithms that are simpler and faster than the original schemes, and yet have simpler proofs. Our results bolster the thesis of Liskov, Rivest, and Wagner [10] that a desirable approach for designing modes of operation is to start from a takable blockcipher.  elaborate on their idea, suggesting the kind of tak space, usage-discipline, and blockcipher-based instantiations that give rise to simple and efficient modes."}]