CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Small Domain Specific Language for Cryptographic Algorithms

by Jaimandeep Singh, Brijendra Kumar Joshi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 100 - Number 5
Year of Publication: 2014
Authors: Jaimandeep Singh, Brijendra Kumar Joshi
10.5120/17521-8083

Jaimandeep Singh, Brijendra Kumar Joshi . A Small Domain Specific Language for Cryptographic Algorithms. International Journal of Computer Applications. 100, 5 ( August 2014), 16-19. DOI=10.5120/17521-8083

@article{ 10.5120/17521-8083,
author = { Jaimandeep Singh, Brijendra Kumar Joshi },
title = { A Small Domain Specific Language for Cryptographic Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 100 },
number = { 5 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume100/number5/17521-8083/ },
doi = { 10.5120/17521-8083 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:29:10.541594+05:30
%A Jaimandeep Singh
%A Brijendra Kumar Joshi
%T A Small Domain Specific Language for Cryptographic Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 100
%N 5
%P 16-19
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper establishes the need for a small Domain Specific Language to support rapid testing and diagnosis of cryptographic algorithm. Such a language will require built-in support for modulo arithmetic, which is used for creating mathematical locks in modern crypto systems. The paper also provides a framework/prototype for such a language. It can further be used as a building block for broader set of language specific features.

References
  1. V Raghavan; 2010; "Principles of Compiler Design"; 1st edition, Tata McGraw Hill Education Private Limited, New Delhi, p 7, 70-80.
  2. John R. Levine, Tony Mason and Doug Brown; 1992; "lex & yacc"; 2nd Edition, O'Reilly, p 1–2.
  3. https://pypi. python. org/pypi/ply/3. 1 (accessed on June 24, 2014).
  4. http://www. dabeaz. com/ply/ply. html#ply_nn9 (accessed on June 24, 2014).
  5. Alfred V. Aho, Ravi Sethi and Jeffery D. Ullman; 2002; "Compilers: Principles, Techniques and Tools"; 9th Indian edition, Pearson Education (Singapore) Pte. Ltd. , Indian Branch, Delhi, p 215.
  6. http://clang. llvm. org/comparison. html (accessed on June 24, 2014).
  7. http://llvm. org/docs/ (accessed on July 12, 2014).
  8. http://www. llvmpy. org/ (accessed on June 25, 2014).
  9. Andrew W. Appel; 2001; "Modern Compiler Implementation in C"; Special Edition for Sale in South asia; Cambridge University Press.
  10. Jean Paul Tremblay and Paul G. Sorenson; 1985; "The Theory and Practice of Compiler Writing"; McGraw-Hill Book Company, USA.
  11. S. C. Johnson; 1975; "YACC: Yet Another Compiler Compiler"; Computing Science Technical Report no 32, Bell Laboratories, Murray Hills, New Jersey.
  12. http://flex. sourceforge. net/ (accessed on July 12, 2014).
  13. Brain W. Kernighan and Rob Pike, 1995, "The UNIX Programming Environment"; 9th Indian edition, Prentice-Hall of India Private Limited, New Delhi, p 233-260.
Index Terms

Computer Science
Information Sciences

Keywords

cryptography flex bison lex yacc ply parser grammar tokenizer compiler lexer llvm llvmpy.

Powered by PhDFocusTM