How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge proofs of identity
Journal of Cryptology
A New Euclidean Division Algorithm for Residue Number Systems
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
The PASSERINE public key encryption and authentication mechanism
NordSec'10 Proceedings of the 15th Nordic conference on Information Security Technology for Applications
| Hi-index | 0.00 |
This paper describes in detail a recent smart-card prototype that performs a 20-bit zero-knowledge identification In less than one second on a simple 8-bit microcontroller without any dedmted crypto-engme aboard. A curious property of our implementation is its inherent linear complexity : unlike all the other protocols brought to our knowledge, the overall performance of our prover (computation and transmission) is simply proportional to the size of the modulus (and not to its square). Therefore (as paradoxical as this may seem...) there will always exist a modulus size l above whch our software-coded prover will be faster than any general-purpose hardware accelerator. The choice of a very unusual number representation technique (particularly adapted to Fisher-Micali-Rackoff's protocol) combined with a recent modulo delegation scheme, allows to acfueve a complete 20-bit zero-knowledge interaction in 964 ms (with a 4 MHz clock). The microcontroller (ST16623, the prover), which communicates with a PC via an ISO 7816-3 (115,200 baud) interface, uses only 400 EEPROM bytes for storing its 64-byte keys.