Abstract
We introduce an improvement of the powerline system [4] called Fractional Powerline System . Its transmission rate is larger than that of the powerline system for comparable parameters. As a consequence it can be considered as more secure. That new PKC is especially convenient for short messages. For instance, 136 bits messages can be transmitted by conveying 208 bits over the channel and this will resist all knowns attacks. A variant is suggested for which, at a cost of increasing the size of the public key, the average number of bit messages can be as high as 146 with a transmission rate of 81% which is to be compared with the 43% of the Powerline System with comparable parameters. A signature scheme based upon appending a small number of random bits to a message is made easier by the higher transmission rate.
Centre National de la Recherche Scientifique
Preview
Unable to display preview. Download preview PDF.
References
E.F. Brickell, A.M. Odlyzko, Cryptanalysis: a survey of recent resiults,Proc. IEEE 76 (1988),578–593.
B.Chor, R.L. Rivest, A knapsack-type public key Cyptosystem based on arithmetic in finite fields, IEEE Trans. Informs. Theory 34 (1988), 901–909.
T.M. Cover, Enumerative source encoding, IEEE Trans. Inf. Theory, VolIT-19,p. 73 77,1973.
H.W.Lenstra, Jr. On the Chor-Rivest Knapsack Cryptosystem, J. Cryptology (1991) 3:149–155
F.J. MacWilliams and N. J. A. Sloane, The theory of Error-correcting codes, Amsterdam, North-Holland, 1977.
C.P. Schnorr and H.H. Hörner, Attacking the Chor-Rivest Cryptosystem by Lattice Reduction Advances in Cryptology-EUROCRYPT'95 LNCS NO 921 Springer
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Camion, P., Chabanne, H. (1997). On the powerline system. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028493
Download citation
DOI: https://doi.org/10.1007/BFb0028493
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive