The padding scheme for RSA signatures Batten, Lynn and Wolf, Christopher 2010, The padding scheme for RSA signatures, in ATIS 2010 : Proceedings of the 1st Applications and Techniques in Information Security Workshop, School of Information Systems, Deakin University, Melbourne, Vic., pp. 1-7. Attached Files Name Description MIMEType Size Downloads batten-thepaddingschemeforRSA-2010.pdf Published version application/pdf 69.96KB 106 Title The padding scheme for RSA signatures Author(s) Batten, Lynn orcid.org/0000-0003-4525-2423 Wolf, Christopher Conference name Applications and Techniques in Information Security. Workshop (1st : 2010 : Melbourne, Vicroria) Conference location Melbourne, Victoria Conference dates 10 Nov. 2010 Title of proceedings ATIS 2010 : Proceedings of the 1st Applications and Techniques in Information Security Workshop Editor(s) Warren, Matthew orcid.org/0000-0002-7529-431X Publication date 2010 Conference series Applications and Techniques in Information Security Workshop Start page 1 End page 7 Total pages 7 Publisher School of Information Systems, Deakin University Place of publication Melbourne, Vic. Keyword(s) RSA cryptography signing diophantine equation Summary The RSA scheme is used to sign messages; however, in order to avoid forgeries, a message can be padded with a fixed string of data P. De Jonge and Chaum showed in 1985 that forgeries can be constructed if the size of P (measured in bytes) is less than the size of N/3, where N is the RSA modulus. Girault and Misarsky then showed in 1997 that forgeries can be constructed if the size of P is less than the size of N/2. In 2001, Brier, Clavier, Coron and Naccache showed that forgeries can still be constructed when the size of P is less than two thirds the size of N. In this paper, we demonstrate that this padding scheme is always insecure; however, the complexity of actually finding a forgery is O(N). We then focus specifically on the next unsettled case, where P is less than 3/4 the size of N and show that finding a forgery is equivalent to solving a set of diophantine equations. While we are not able to solve these equations, this work may lead to a break-through by means of algebraic number theory techniques. ISBN 9781741561463 Language eng Field of Research 080402 Data Encryption Socio Economic Objective 890101 Fixed Line Data Networks and Services HERDC Research category E1 Full written paper - refereed HERDC collection year 2010 Copyright notice ©2010, Deakin University, School of Information Systems Free to Read? Yes Persistent URL http://hdl.handle.net/10536/DRO/DU:30033839 Document type: Conference Paper Collections: Faculty of Science, Engineering and Built Environment School of Information Technology Open Access Collection   Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved. Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au. Versions Version Filter Type Wed, 13 Apr 2011, 14:51:35 EST Thu, 21 Apr 2011, 11:27:45 EST Thu, 28 Apr 2011, 11:53:31 EST Thu, 28 Apr 2011, 14:32:28 EST Thu, 28 Apr 2011, 14:33:53 EST Fri, 16 Mar 2012, 18:50:37 EST Tue, 04 Jun 2013, 14:08:28 EST Mon, 14 Oct 2013, 12:48:07 EST Tue, 06 Sep 2016, 16:51:18 EST Tue, 05 Dec 2017, 10:48:56 EST Fri, 07 Sep 2018, 15:22:57 EST Filtered Full Citation counts:   Cited 0 times in TR Web of Science Cited 0 times in Scopus Search Google Scholar Access Statistics: 757 Abstract Views, 110 File Downloads  -  Detailed Statistics Created: Wed, 13 Apr 2011, 14:51:27 EST by Sandra Dunoon