Sciweavers

233 search results - page 7 / 47
» Data Encryption Using MRF with an RSA Key
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 3 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
CSREASAM
2006
15 years 1 months ago
A Study on DRM System for On/Off Line Key Authentication
- This paper proposes a Hash Chain algorithm to create a key safer than the existing encryption method, and suggests an encryption method of higher security than the existing syste...
Kun-Won Jang, Chan-Kil Park, Jung-Jae Kim, Moon-Se...
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
15 years 6 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 4 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
INDOCRYPT
2004
Springer
15 years 5 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...