Hi, I looked in net for Oracle and found the following limitation. PUF depends on physical variations of chip at time of manufacturing and after processing, should function as a better Oracle than any other algorithm. Limitations (as per wikipedia)Edit <https://en.m.wikipedia.org/w/index.php?title=Random_oracle&action=edit§ion=2>
According to the Church–Turing thesis <https://en.m.wikipedia.org/wiki/Church%E2%80%93Turing_thesis>, no function computable by a finite algorithm can implement a true random oracle (which by definition requires an infinite description because it has infinitely many possible inputs, and its outputs are all independent from each other and need to be individually specified by any description). Thanks and Regards, Sankalp Bagaria. On Mon 18 Feb, 2019, 7:15 AM Salz, Rich, <[email protected]> wrote: > Do you know what I mean by an oracle? > > > > - PUF provides a cheaper alternative to complex and expensive > cryptographic circuitry. As keys need not be stored at the IoT device. When > PUF receives a challenge from server, it calculates response and sends it > to server. > >
_______________________________________________ TLS mailing list [email protected] https://www.ietf.org/mailman/listinfo/tls
