Proceedings on Advances in cryptology---CRYPTO '86
Efficient, perfect random number generators
CRYPTO '88 Proceedings on Advances in cryptology
A “paradoxical” identity-based signature scheme resulting from zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
A cryptographic library for the Motorola DSP56000
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Password authentication with insecure communication
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Off-Line Cash Transfer by Smart Cards.
Off-Line Cash Transfer by Smart Cards.
Low-exponent RSA with related messages
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor
IEEE Transactions on Computers
AES Implementation on FPGA: Time - Flexibility Tradeoff
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
On Multiple Precision Based Montgomery Multiplication without Precomputation of N0' = -N0-1 mod W
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
| Hi-index | 0.00 |
Today, many smart card processors are able to perform a 512-bit RSA signature in less than 100 ms. This power is not always necessary. We may reduce the costs (die size) by conceiving a standalone working crypto-processor well suited for some kinds of applications. We chose, as example of feasibility, to implement the GQ scheme to authenticate the card and to guarantee the integrity of the amount to pay in a prepaid token application. A chip complying with the smart card specifications and able to perform the whole protocol, in less than one second, was build.