Fundamental concepts of any programming language:

Variable (Storage)

Control Structures ( Loop – condition )

Data Structures

Operation

ZERMELO Ula Chftha F Shi 9nt Akher je me rappele pas

- Principe : Juste les ensemble union + Card

- A+ 0 = 0
- A + S(b) = S(a+b)
- 0=O
- 1 = 0 U O = {O}
-
- Constructing the functions by recursion

MPC Framework proof of concept:

1) Definition des operations: (Programmation )

+ ; - ; x ; / ; mod ; pow ; and ; ou ; xor ; not ; comparaison

Analyze:

+ sub for x and pow and /

- Sub for +
- A mod b = a- b int(a/b)
- And , or , not are elementary but we can convert theme to addition
- Comparaison also and operation not can be converted to addition
- Condition can be converted to logicial expression
Loop problem?? Not maniabl convert a loop to recursive function

Idea about making any function in programming language to be a

mathematical function??
Make Recursive function secure how to do it
Make some rule to say if we can transform sot set of operation to a secure one or not.
Ex. Add(a,b) can’t be a secure one … but add (a,b,c ) it can

WHY?