Toward a theory of one -way functions via gate complexity of Boolean functions

One of the most important properties of a cryptographic system is a proof of its security. There are two types of security: information (or theoretical) security and computational (or practical) security. The focus of this work is on provable computational security via gate (or circuit) complexity o...

Full description

Saved in:

Bibliographic Details
Main Author:	Interlando, J Carmelo
Format:	Dissertation
Language:	English
Published:	ProQuest Dissertations & Theses 01.01.2006
Subjects:	Electrical engineering Mathematics
ISBN:	9780542377037, 0542377039
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!