{"id":251918,"date":"2026-07-13T01:38:11","date_gmt":"2026-07-12T22:38:11","guid":{"rendered":"https:\/\/1kitap1.com\/en\/analysis-cryptography-n-information-science-nicholas-j-daras-1\/"},"modified":"2026-07-13T01:38:11","modified_gmt":"2026-07-12T22:38:11","slug":"analysis-cryptography-n-information-science-nicholas-j-daras-1","status":"publish","type":"post","link":"https:\/\/1kitap1.com\/en\/analysis-cryptography-n-information-science-nicholas-j-daras-1\/","title":{"rendered":"Analysis Cryptography N Information Science – Nicholas J Daras (1)"},"content":{"rendered":"
\"<\/figure>\n

The study of the Riemann hypothesis involves Vasyunin cotangent sums which are a generalization of the well-known Dedekind sums. The present survey chapter summarizes the various investigations on these sums and their law of reciprocity to apply the obtained results on Vasyunin formula linked to the B\u00b4aez-Duarte criterion for the Riemann hypothesis. 1. Introduction The study of Riemann zeta function has led to several approaches to attack the Riemann hypothesis.<\/p>\n

The most important is the Hilbertian approach initiated by Beurling\u2013Nyman and developed in its mod- ern form by B\u00b4aez-Duarte and Balazard. The Vasyunin formula is M. Goubi an important tool to calculate the inner products of a certain fam- ily of vectors. In this formula, we see the Vasyunin cotangent sums which are a generalization of the Dedekind sums.<\/p>\n

In this survey chap- ter, we expose di\ufb00erent investigations on Vasyunin cotangent sums and their reciprocity law in the spirit of improving the computation of the curious part of the Vasyunin formula. 2. Cryptography Modern cryptography [16] is focused on formal reasoning and anal- ysis. We need formal de\ufb01nitions, precise assumptions and proofs of security. In public-key code, only the private key must be kept secret, and the public key may be shared. Modern cryptography needs knowledge in analytic and algebraic number theory. In each case, we give an example to better explain the strong link between cryptography and number theory.<\/p>\n

For public-key RSA, let \u03c6 be the Euler function and M = pq, where p, q are two random n-bit primes and we choose a > 1 such that (a, \u03c6(M)) = 1, thereafter we com- pute \u00afa the inverse of a modulo \u03c6(M). The public key is (M, a) and the private key is (M, \u00afa).<\/p>\n

Encryption and decryption for a mes- sage m \u2208{0, 1, 2, . . . , M \u22121} are, respectively, ma (mod M) and c\u00afa (mod N), with c = ma. For veri\ufb01cation, we have the identity c\u00afa = (ma)\u00afa = m. The secret of this algorithm is the prime factor- ization of the modulus M. If the primes p; q such that M = pq are known, then the private key becomes public. Let Rn be the R-vectorial space with the classical inner product. A lattice L is a subgroup of the form L = Zv1 + Zv2 + \u00b7 \u00b7 \u00b7 + Zvm with v1, v2, .<\/p>\n

. . , vm are linearly independent. Let the matrix A = (\u27e8vi, vj\u27e9)1\u2264i,j\u2264m, then the volume of L is vol(L) = \u0002 | det A|. Lattice cryptography is based on the shortest vector problem: given a basis of a lattice L and \ufb01nd v \u2208L such that \u2225v\u2225= min0\u0338=x\u2208L \u2225x\u2225. Or we can \ufb01x y \u2208Rn and \ufb01nd the vector v such that \u2225v\u2212y\u2225= miny\u0338=x\u2208L \u2225x\u2212y\u2225.<\/p>\n

\n

Application of Quantitative Techniques for the Prediction of Bank Acquisition Targets by F. Pasiouras, S. K. Tanna and C. Zopounidis Vol. 4 Theory and Algorithms for Cooperative Systems edited by D. Grundel, R. Murphey and P. M. Pardalos Vol. 3 Marketing Trends for Organic Food in the 21st Century edited by G.<\/p>\n

Baourakis Vol. 2 Supply Chain and Finance edited by P. M. Pardalos, A. Migdalas and G. Baourakis Vol. 1 Optimization and Optimal Control edited by P. M. Pardalos, I. Tseveendorj and R. Enkhbat Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE Library of Congress Control Number: 2023003616 British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library.<\/p>\n

Series on Computers and Operations Research \u2014 Vol. 10 ANALYSIS, CRYPTOGRAPHY AND INFORMATION SCIENCE Copyright \u00a9 2023 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the publisher.<\/p>\n

For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher. ISBN 978-981-127-191-5 (hardcover) ISBN 978-981-127-192-2 (ebook for institutions) ISBN 978-981-127-193-9 (ebook for individuals) For any available supplementary material, please visit https:\/\/www.worldscientific.com\/worldscibooks\/10.1142\/13296#t=suppl Desk Editors: Logeshwaran Arumugam\/Steven Patt Typeset by Stallion Press Email: enquiries@stallionpress.com Printed in Singapore c\u20dd2023 World Scienti\ufb01c Publishing Company https:\/\/doi.org\/10.1142\/9789811271922 fmatter Preface Analysis, Cryptography and Information Science presents chapters in a broad spectrum of areas of mathematical analysis and its various interconnections to other \ufb01elds as well as chapters in the domains of cryptography and information science.<\/p>\n

The chapters of this book also feature the interplay between the above-mentioned domains. E\ufb00ort has been made for the present work to have a strong interdisciplinary \ufb02avor and feature a variety of topics of current vibrant interest and research activity.<\/p>\n<\/blockquote>\n

This is a short excerpt from the opening of “” by Unknown, quoted for review and introduction purposes. All rights belong to the copyright holders.<\/em><\/p>\n

\n
\n

Table of Contents<\/p>\nToggle<\/span><\/path><\/svg><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n