884 Hits in 10.8 sec

Stateful public-key cryptosystems

Mihir Bellare, Tadayoshi Kohno, Victor Shoup
2006 Proceedings of the 13th ACM conference on Computer and communications security - CCS '06  
We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions  ...  In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and 3 respectively in the original schemes, yielding  ...  with 160-bit groups.  ... 
doi:10.1145/1180405.1180452 dblp:conf/ccs/BellareKS06 fatcat:l3j5ufhl4nb7lmcbjdpgws67ry

A New Public-Key Cryptosystem [chapter]

David Naccache, Jacques Stern
1997 Lecture Notes in Computer Science  
This paper describes a new public-key cryptosystern where the ciphertext is obtained by multiplying the public-keys indexed by the message bits and the cleartext is recovered by factoring the ciphertext  ...  Encryption requires four multiplications / byte and decryption is roughly equivalent to the generation of an RSA signature.  ...  If one has to discard half of them, and if one wants to have a sub-minimal 160-bit message space, 50 of the primes will be eleven-bit, numbers and key generation will only be possible in the lucky event  ... 
doi:10.1007/3-540-69053-0_3 fatcat:vx3cxle56bag5lw6q6paynt6de

The State of Elliptic Curve Cryptography [chapter]

Neal Koblitz, Alfred Menezes, Scott Vanstone
2000 Towards a Quarter-Century of Public Key Cryptography  
Since the introduction of public-key cryptography by Diffie and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized.  ...  The resulting public-key systems provide relatively small block size, high speed, and high security.  ...  ElGamal [16] first described how this problem may be utilized in public-key encryption and digital signature schemes.  ... 
doi:10.1007/978-1-4757-6856-5_5 fatcat:6hvidisd6zdzzaarclkcqs4fsu

Exponentiation cryptosystems on the IBM PC

P. G. Comba
1990 IBM Systems Journal  
Exponentiation cryptosystems on the IBM PC Several cryptosystems based on exponentiation have been proposed in recent years.  ...  A different picture emerges when one compares any public key encryption/decryption time with the cor- responding time for the Data Encryption Algorithm.  ... 
doi:10.1147/sj.294.0526 fatcat:gpifafwqpfawfp3nd3gpvrspcm

Elliptic Curve Cryptosystems on Smart Cards [chapter]

Elsayed Mohammed, A. Emarah, Kh. El-Shennawy
2002 IFIP Advances in Information and Communication Technology  
ECC's unique properties make it especially well suited to smart card applications. ECC systems provide the highest strength per bit of any cryptosystem known today.  ...  Elliptic Curve Cryptography (ECC) offers small key size and high security.  ...  With a 160-bit modulus, an elliptic curve system seems to offer the same level of cryptographic security as DSA or RSA with l024-bit moduli.  ... 
doi:10.1007/978-0-387-35586-3_25 fatcat:ofkfo7gfgrfzro652lkf36qbku

An Enhanced Elliptic Curve Cryptosystem for Securing Data

Edward Kwadwo, James Ben, Frimpong Twum
2018 International Journal of Computer Applications  
Elliptic Curve cryptosystem (ECC) is a technique of public-key encryption, which is rooted on the arithmetical construction of elliptic curves over finite fields.  ...  It is terminated with key facts that the Elliptic Curve Cryptography has a shorter key length, saves bandwidth, which facilitates key generation during the encryption/decryption of data, also the assurance  ...  Because the strength of the security in the HTTP-SSL transmission is dependent on the encryption key size, expects try to increase the key size to 4096 bit.  ... 
doi:10.5120/ijca2018917688 fatcat:sbn4oplcfnd2xjn7axxddpak6a

The prevalence of kleptographic attacks on discrete-log based cryptosystems [chapter]

Adam Young, Moti Yung
1997 Lecture Notes in Computer Science  
Finally, note that it has been perceived that the DSA signature scheme was originally designed to be robust against its abuse as a public-key channel-to distinguish it from RSA signatures (where the signing  ...  The notion of a Secretly Embedded Trapdoor with Universal Protection (SETUP) and its variations on attacking black-box cryptosysterns has been recently introduced.  ...  Theorem 1 ElGamal encryption has a strong setup version. Typically, when public key cryptography is needed to encrypt bulk data, hybrid cryptosystems are used.  ... 
doi:10.1007/bfb0052241 fatcat:q5kavyhxrjh4xmfuu7k6brgeya

A new public key cryptosystem based on higher residues

David Naccache, Jacques Stern
1998 Proceedings of the 5th ACM conference on Computer and communications security - CCS '98  
The deterministic version is practically oriented: encryption amounts to a single exponentiation w.r.t. a modulus with at least 768 bits and a 160-bit exponent.  ...  This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer.  ...  We wish to thank Julien Stern for suggesting us this alternative mode of encryption. We also want to thank J.  ... 
doi:10.1145/288090.288106 dblp:conf/ccs/NaccacheS98 fatcat:czqcxtkprzazxe2rfsrcjyecaq

Digital signature and public key cryptosystem in a prime order subgroup of Zn* [chapter]

Colin Boyd
1997 Lecture Notes in Computer Science  
There are similarities with the best known digital signatures and public key cryptosystems (RSA and discrete logarithm based schemes) in terms of the mathematical structure.  ...  With regard to computational requirements the new schemes are competitive and, in particular, are more e cient than the best known schemes when averaged over both public and private key computations.  ...  Acknowledgements I am very grateful to Wenbo Mao of Hewlett-Packard for many constructive critical comments.  ... 
doi:10.1007/bfb0028490 fatcat:rqltzihbojc7biw7ce5gko7bjy

Elliptic Curve Cryptosystems [chapter]

2005 Series on Coding Theory and Cryptology  
In particular, we are interested in public-key cryptosystems that use the elliptic curve discrete logarithm problem to establish security.  ...  To illustrate certain points, we also discuss a sample implementation of the elliptic curve analogue of the El Gamal cryptosystem.  ...  Acknowledgements Many thanks go to my thesis supervisors David Avis (at McGill University) and Claude Crépeau (at Université de Montréal) for their patient guidance and generous advice.  ... 
doi:10.1142/9789812703309_0006 fatcat:qtjvt6vivvcftlwgfwd7wjhree

Elliptic Curve Cryptosystems [chapter]

Ian F. Blake, XuHong Gao, Ronald C. Mullin, Scott A. Vanstone, Tomik Yaghoobian
1993 Applications of Finite Fields  
In particular, we are interested in public-key cryptosystems that use the elliptic curve discrete logarithm problem to establish security.  ...  To illustrate certain points, we also discuss a sample implementation of the elliptic curve analogue of the El Gamal cryptosystem.  ...  Acknowledgements Many thanks go to my thesis supervisors David Avis (at McGill University) and Claude Crépeau (at Université de Montréal) for their patient guidance and generous advice.  ... 
doi:10.1007/978-1-4757-2226-0_8 fatcat:qolt5n2aibetfedkcdw6dkxvaa

Lattice Polly Cracker cryptosystems

Massimo Caboara, Fabrizio Caruso, Carlo Traverso
2011 Journal of symbolic computation  
Using Gröbner bases for the construction of public key cryptosystems has been often attempted, but has always failed.  ...  We show how to build a cryptosystem based on lattice ideals and their Gröbner bases, and, after breaking a simple variant, we construct a more elaborate one.  ...  While LPC has shown that Gröbner bases can be used in the construction of public key cryptosystems, that apparently cannot be broken trivially, and perform quite reasonably compared with other lattice  ... 
doi:10.1016/j.jsc.2010.10.004 fatcat:cb7pm2rmifcslk6tb3tzi7yfsy

Design and Hardware Implementation of a Separable Image Steganographic Scheme Using Public-key Cryptosystem [article]

Salah Harb, M. Omair Ahmad, M.N.S Swamy
2020 arXiv   pre-print
The proposed public-key cryptosystem offers a separable framework that allows to embed or extract secret data and encrypt or decrypt the carrier using the public-private key pair, independently.  ...  In this paper, a novel and efficient hardware implementation of steganographic cryptosystem based on a public-key cryptography is proposed.  ...  Pixels of the cover image are encrypted by paillier cryptosystem with a public key to generate an encrypted image.  ... 
arXiv:2006.02775v1 fatcat:2fly2mxwtnawzmtoqu4ovekd5e

A Simple BGN-Type Cryptosystem from LWE [chapter]

Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
2010 Lecture Notes in Computer Science  
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similarly to the cryptosystem of Boneh, Goh, and Nissim (BGN).  ...  Security is based on the hardness of learning with errors (LWE), which is known to be as hard as certain worst-case lattice problems.  ...  They show how to use this template to combine the BGN cryptosystem with the cryptosystem of Kawachi et al.  ... 
doi:10.1007/978-3-642-13190-5_26 fatcat:dypzr247cbg5xicouhf2siw6ym

A Survey of Public-Key Cryptosystems

Neal Koblitz, Alfred J. Menezes
2004 SIAM Review  
We give an overview of the most important public-key cryptosystems and discuss the difficult task of evaluating the merit of such systems.  ...  In contrast, the most obvious notion of security for a public-key encryption scheme -that an adversary who is given a public key and a ciphertext C derived with that public key is unable to determine (  ...  Next, the client selects a random session key, encrypts it with the server's RSA public key, and transmits the resulting ciphertext to the server.  ... 
doi:10.1137/s0036144503439190 fatcat:wix7yrhdnzaslooaugb5ttrt7y
« Previous Showing results 1 — 15 out of 884 results