Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Method for hiding information in lattice

Method for hiding information in lattice

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A method is presented for encoding a message in the lattice of the GGH public-key cryptosystem. The approach is more efficient than the authors' original contribution and also has a stronger notion of plaintext awareness. With the encoding scheme, encryption of a given message has a computational requirement of only O(n), which is superior to the original scheme which requires O(n2).

Inspec keywords: encoding; public key cryptography

Other keywords: GGH public-key cryptosystem; security; message encoding; lattice; probabilistic encryption; plaintext awareness

Subjects: Cryptography theory; Codes; Cryptography

References

    1. 1)
      • Goldreich, O., Goldwasser, S., Halvei, S.: `Public-key cryptosystems from lattice reductionproblems', Proc. CRYPTO'97, 1997, Santa Barbara, CA, p. 112–131.
    2. 2)
      • S. Goldwasser , S. Micali . Probabilistic encryption. J. Comput. Syst. Sci. , 270 - 299
    3. 3)
      • Ajtai, M., Dwork, C.: `A public-key cryptosystem with worst-case/average-case equivalence', Proc. 29th STOC, 1997, Texas, p. 284–293.
    4. 4)
      • van Emde Boas, P.: `Another NP-complete problem and the complexity of computing short vectorsin a lattice', 81-04, 1981.
    5. 5)
      • Ajtai, M.: `Generating hard instances of lattice problems', Proc. 28th STOC, 1996, Philadelphia, p. 99–108.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19981589
Loading

Related content

content/journals/10.1049/el_19981589
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address