Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography

We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring elements into larger rings via suitable homomorphisms obtained from modulus scaling. Our approach is closely related to,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Gaubatz, Gunnar, Sunar, Berk
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences arithmetic codes Computer science control theory systems Cryptography cyclic codes error detection Exact sciences and technology fault tolerance Finite field arithmetic homomorphic embedding idempotency Information, signal and communications theory Memory and file management (including protection and security) Memory organisation. Data processing modulus scaling public-key cryptography Signal and communications theory Software Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!