By Topic

An elliptic curve cryptography based on matrix scrambling method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fatima Amounas ; R.O.I Group, Moulay Ismaïl University, Informatics Department, Faculty of Sciences and Technics, Box 509 Errachidia, Morocco ; El Hassan El Kinani

A new method on matrix scrambling based on the elliptic curve will be proposed in this paper. The proposed algorithm is based on random function and shifting technique of circular queue. In particular, we first transform the message into points on the elliptic curve as is the embedding system M→PM and then apply the encryption/decryption technique based on matrix scrambling. Our scheme is secure against most of the current attacking mechanisms.

Published in:

Network Security and Systems (JNS2), 2012 National Days of

Date of Conference:

20-21 April 2012