4-bit mini aes

[Holdithoncho]

Hi all,

I was wondering how to implement a 4 bit mini aes on labview. Im very new to labview and dont really know how to go about doing this if anyone can help it would be greatly appreciated. Also, there is an algorithm snipped below. Thanks!

[rolfk]

It's a tiny image but looks to me like standard boolean algebra. The subscript probably indicates the bit index, the multiplication (or lack of a sign between two values is an AND) and the plus sign stands for an OR. The plus inside a circle is the EXOR and a bar over a value or entire term is the inversion.

[Holdithoncho]

Thank you for the responce. Would it be possible to show maybe a snippet of how the first line of the script would look in labview?

[GerdW]

Hi Holdithoncho,

---

@Holdithoncho wrote:

Would it be possible to show maybe a snippet of how the first line of the script would look in labview?

---

You still don't supply a "full resolution" image…

Suggestion:

[rolfk]

Gerd was faster

[Holdithoncho]

Great thanks for the help guys. I think i have a better understanding of what to do now. Thanks!

[JimmyKnuckles]

I have just stumbled across this thread and it looks interesting, the example you have posted above makes great sense so i tried out a few myself, but the last one has thrown me slightly.

How would you go about it? if you dont mind

[JimmyKnuckles]

Good evening, Im playing around with a query i saw on another post, it relates to 4-Bit Mini AES. 

IM just wondering if the above looks correct, and the fact the 4-bit AES doesn't really tell you if your program is correct doesn't help.

thanks

[rolfk]

I suppose you struggle with that special plus in a circle. That's an XOR operator!

[rolfk]

---

@JimmyKnuckles wrote:

Good evening, Im playing around with a query i saw on another post, it relates to 4-Bit Mini AES. 

IM just wondering if the above looks correct, and the fact the 4-bit AES doesn't really tell you if your program is correct doesn't help.

---

I would say the diagram could use some cleanup (Ctrl-U would be actually already an improvement in this case), but other than that it seems ok (Correction: you use X4 instead of X3 in the second lowest AND). Please note that the Compound Arithmetic node that you use for the ANDs and ORs also supports an XOR mode. I find boolean algebra diagrams that mix and match the Compound Arithmetic with the traditional Boolean operators a bit messy. Use either one but not both!

And yes verifying such code is not easy. Usually I try to find examples of input and output values or if possible some code in other languages that is claimed to work correctly, to verify a whole series of values and their calculation result.