Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'501'711
Articles rated: 2609

19 April 2024
 
  » arxiv » 1503.1806

 Article overview


Restricted linear congruences and an authenticated encryption scheme
Khodakhast Bibak ; Bruce M. Kapron ; Venkatesh Srinivasan ; Roberto Tauraso ; László Tóth ;
Date 5 Mar 2015
AbstractIn this paper, using properties of Ramanujan sums and of the finite Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+cdots +a_kx_kequiv b pmod{n}$, with $(x_i,n)=t_i$ ($1leq ileq k$), where $a_1,t_1,ldots,a_k,t_k, b,n$ ($ngeq 1$) are arbitrary integers. Some special cases of this problem have been studied in many papers, and have found very interesting applications in number theory, combinatorics, and cryptography, among other areas. We also propose an authenticated encryption scheme, and using our explicit formula, analyze the integrity of this scheme.
Source arXiv, 1503.1806
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica