scispace - formally typeset
Search or ask a question
Book ChapterDOI

Encode-then-Encrypt : A Novel Framework for Reliable and Secure Communication

01 Jan 2019-pp 581-594
TL;DR: This paper's proposed Encode-then-Encrypt framework is defined using linear error correcting codes and elliptic curves to address these challenges as a single solution rather than addressing them separately.
Abstract: Achieving a reliable and secure communication is the major challenge in the context of data communication and storage. In this paper, Encode-then-Encrypt framework is defined using linear error correcting codes and elliptic curves to address these challenges as a single solution rather than addressing them separately. The working of the proposed framework is explained in detail by taking Reed-Solomon codes (with a set of encoding and decoding algorithms) and elliptic curves of characteristic 2 (with a set of encryption and decryption algorithms). We have outlined the advantages of using such elliptic curves and error correcting codes over any other cryptosystem defined in the existing literature. The proposed framework can be implemented as a part of any real-time communication system to ensure reliability and security.
References
More filters
Book
01 Jan 2003
TL;DR: In this article, the authors present a survey of the most popular methods for teaching creativity in the field of cryptography and apply them in the context of public-key cryptography and RSA.
Abstract: NOTATION PREFACE CHAPTER 0 READER'S GUIDE CHAPTER 1 OVERVIEW PART ONE SYMMETRIC CIPHERS CHAPTER 2 CLASSICAL ENCRYPTION TECHNIQUES CHAPTER 3 BLOCK CIPHERS AND THE DATA ENCRYPTION STANDARD CHAPTER 4 INTRODUCTION TO FINITE FIELDS CHAPTER 5 ADVANCED ENCRYPTION STANDARD CHAPTER 6 MORE ON SYMMETRIC CIPHERS CHAPTER 7 CONFIDENTIALITY USING SYMMETRIC ENCRYPTION PART TWO PUBLIC-KEY ENCRYPTION AND HASH FUNCTIONS CHAPTER 8 INTRODUCTION TO NUMBER THEORY CHAPTER 9 PUBLIC-KEY CRYPTOGRAPHY AND RSA CHAPTER 10 KEY MANAGEMENT OTHER PUBLIC-KEY CRYPTOSYSTEMS CHAPTER 11 MESSAGE AUTHENTICATION AND HASH FUNCTIONS 1 CHAPTER 12 HASH AND MAC ALGORITHMS CHAPTER 13 DIGITAL SIGNATURES AND AUTHENTICATION PROTOCOLS PART THREE NETWORK SECURITY PRACTICE CHAPTER 14 AUTHENTICATION APPLICATIONS CHAPTER 15 ELECTRONIC MAIL SECURITY CHAPTER 16 IP SECURITY CHAPTER 17 WEB SECURITY PART FOUR SYSTEM SECURITY CHAPTER 18 INTRUDERS CHAPTER 19 MALICIOUS SOFTWARE CHAPTER 20 FIREWALLS APPENDICES APPENDIX A STANDARDS AND STANDARD-SETTING ORGANIZATIONS APPENDIX B PROJECTS FOR TEACHING CRYPTOGRAPHY AND NETWORK SECURITY ONLINE APPENDICES APPENDIX C SIMPLIFIED DES APPENDIX D THE MEANING OF mod APPENDIX E MORE ON SIMPLIFIED AES APPENDIX F KNAPSACK PUBLIC-KEY ALGORITHM APPENDIX G PROOF OF THE DIGITAL SIGNATURE ALGORITHM GLOSSARY REFERENCES INDEX LIST OF ACRONYMS

1,569 citations

Book
01 Jan 1987
TL;DR: Some topics in Elementary Number Theory include Finite Fields and Quadratic Residues, Primality and Factoring, and Elliptic Curves.
Abstract: 1: Some Topics in Elementary Number Theory. 2: Finite Fields and Quadratic Residues. 3: Cryptography. 4: Public Key. 5: Primality and Factoring. 6: Elliptic Curves.

1,085 citations

Book
01 Jan 2005
TL;DR: This work aims to provide a context for Error Correcting Coding and to inspire a new generation of coders to tackle the challenge of Space-Time Coding.
Abstract: Preface. List of Program Files. List of Laboratory Exercises. List of Algorithms. List of Figures. List of Tables. List of Boxes. PART I: INTRODUCTION AND FOUNDATIONS. 1. A Context for Error Correcting Coding. PART II: BLOCK CODES. 2. Groups and Vector Spaces. 3. Linear Block Codes. 4. Cyclic Codes, Rings, and Polynomials. 5. Rudiments of Number Theory and Algebra. 6. BCH and Reed-Solomon Codes: Designer Cyclic Codes. 7. Alternate Decoding Algorithms for Reed-Solomon Codes. 8. Other Important Block Codes. 9. Bounds on Codes. 10. Bursty Channels, Interleavers, and Concatenation. 11. Soft-Decision Decoding Algorithms. PART III: CODES ON GRAPHS. 12. Convolution Codes. 13. Trefils Coded Modulation. PART IV: INTERATIVELY DECODED CODES. 14. Turbo Codes. 15. Low-Density Parity-Check Codes. 16. Decoding Algorithms on Graphs. PART V: SPACE-TIME CODING. 17. Fading Channels and Space-Time Coding. References. Index.

1,055 citations

Posted Content
TL;DR: In this paper, the authors perform a review of elliptic curve cryptography (ECC) as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC.
Abstract: In this paper, we perform a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. We study four popular protocols that make use of this type of public-key cryptography: Bitcoin, secure shell (SSH), transport layer security (TLS), and the Austrian e-ID card. We are pleased to observe that about 1 in 10 systems support ECC across the TLS and SSH protocols. However, we find that despite the high stakes of money, access and resources protected by ECC, implementations suffer from vulnerabilities similar to those that plague previous cryptographic systems.

167 citations